The Improvement on Algorithm of DNA Computing on 0-1 Planning Problem

Abstract

The old algorithm to solve 0-1 planning problem using DNA computing only searches the feasible solution set from all solution set, then we give an algorithm which can search optimization solution of 0-1 planning problem from all solution set by encoding specially solution set, using technique of electrophoresis and fluorescence labeling technique, and then we give an example to explain the algorithm validity and correctness. We also give a kind of strategy to deal with the negative real number of value coefficient and the complexity of our algorithm is ( ) O m .

DNA algorithm on making spanning tree problem

“…Study on DNA computing model [1][2][3][4] is an active branch of research field of DNA computing [5][6][7], where sticker model has the characteristics of general purpose computer system, which adopts single-double strand mixed-encoding structure on memory complex to store information, and during whole operation, DNA strand need not be extended, enzyme need not participate in it and DNA strand can be used repeatedly, therefore, it has an important meaning for the development of DNA computing [8][9][10] to research sticker model.…”

DNA computing for a dominating set problem based on sticker models

“…In addition, their work confirmed the reliability of sticker models because the implementation was that of a reduced version of the sticker model. Zhou et al (2005) presented an algorithm of DNA computing on 0-1 programming problem. Zhang et al (2006) gave a DNA solution to minimal vertex dominating set problem.…”