This paper shows how to use sticker to construct solution space of DNA for the library sequences in the set-packing problem and the clique problem. Then, with biological operations, we propose DNAbased algorithms to remove illegal solutions and to find legal solutions for the set-packing and clique problems from the solution space of sticker. Any NP-complete problem in Cook’s Theorem can be reduced and solved by the proposed DNA-based computing approach if its size is equal to or less than that of the set-packing problem. Otherwise, Cook’s Theorem is incorrect on DNA-based computing and a new DNA algorithm should be developed from the characteristics of the NP-complete problem. Finally, the result to DNA simulation is given. key words: biological computing, molecular computing, DNA-based computing
[1]
Minyi Guo,et al.
Fast parallel molecular algorithms for DNA-based computation: factoring integers
,
2004,
Proceedings. Fourth IEEE Symposium on Bioinformatics and Bioengineering.
[2]
L M Adleman,et al.
Molecular computation of solutions to combinatorial problems.
,
1994,
Science.
[3]
M. Guo,et al.
Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.
,
2003,
Bio Systems.
[4]
Minyi Guo,et al.
Molecular solutions for the subset-sum problem on DNA-based supercomputing.
,
2004,
Bio Systems.