Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing

BioSystems

Volumn 80, Issue 1, 2005, Pages 71-82

  Guo, Minyi ^a,b   Chang, Weng Long ^c   Ho, Machael ^c   Lu, Jian ^b   Cao, Jiannong ^d  

^a UNIVERSITY OF AIZU   (Japan)

^b NANJING UNIVERSITY   (China)

^c SOUTHERN TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

^d HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Cook's Theorem; DNA based computing; Molecular computing; NP complete problems; NP hard problems; Vertex cover problem

Indexed keywords

DNA;

COMPUTER SYSTEM; THEORETICAL STUDY;

ALGORITHM; ARTICLE; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL;

EID: 14644430909     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.biosystems.2004.10.003     Document Type: Article

References (30)

1. R.R. Sinden DNA Structure and Function 1994 Academic Press
2. L. Adleman Molecular computation of solutions to combinatorial problems Science 266 1994 1021 1024
3. R.J. Lipton DNA solution of hard computational problems Science 268 1995 542 545
4. Q. Quyang, P.D. Kaplan, S. Liu, and A. Libchaber DNA solution of the maximal clique problem Science 278 1997 446 449
5. M. Arita, A. Suyama, and M. Hagiya A heuristic approach for Hamiltonian path problem with molecules Proceedings of Second Genetic Programming (GP-97) 1997 457 462
6. N. Morimoto, M. Arita, and A. Suyama Solid phase DNA solution to the Hamiltonian path problem Series in Discrete Mathematics and Theoretical Computer Science vol. 48 1999 93 206
7. A. Narayanan, and S. Zorbala DNA algorithms for computing shortest paths J.R. Koza Genetic Programming 1998: Proceedings of the Third Annual Conference 1998 718 724
8. S.-Y. Shin, B.-T. Zhang, and S.-S. Jun Solving traveling salesman problems using molecular programming Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), vol. 2 1994 994 1000
9. T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms second ed. 2001 The MIT Press
10. M.R. Garey, and D.S. Johnson Computer and Intractability 1979 Freeman San Fransico, CA
11. D. Boneh, C. Dunworth, R.J. Lipton, and J. Sgall On the computational power of DNA Discrete Applied Mathematics vol. 71 1996 79 94 (special issue on computational molecular biology)
12. L.M. Adleman On constructing a molecular computer. DNA based computers R. Lipton E. Baum Series in Discrete Mathematics and Theoretical Computer Science 1996 American Mathematical Society 1 21
13. Amos, M., 1997. DNA computation, Ph.D. Thesis, Department of Computer Science, The University of Warwick.
14. Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N.V., Goodman, M.F., Rothemund, P.W.K., Adleman, L.M., 1999. Sticker Based Model for DNA Computation, Princeton University, In: Landweber, L., Baum, E. (Eds.), In: Proceedings of the second annual workshop on DNA Computing, Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 1-29.
15. Perez-Jimenez, M.J., Sancho-Caparrini, F., 2001. Solving Knapsack Problems in a Sticker Based Model. In: Proceedings of the Seventh Annual Workshop on DNA Computing, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society.
16. G. Paun, G. Rozenberg, and A. Salomaa DNA Computing: New Computing Paradigms 1998 Springer-Verlag New York 3-540-64196-3
17. W.-L. Chang, and M. Guo Solving the dominating-set problem in Adleman-Liptons Model The Third International Conference on Parallel and Distributed Computing, Applications and Technologies Japan 2002 167 172
18. W.-L. Chang, and M. Guo Solving the clique problem and the vertex-cover problem in Adleman-Lipton's Model IASTED International Conference on Networks, Parallel and Distributed Processing, and Applications Japan 2002 431 436
19. W.-L. Chang, and M. Guo Solving NP-complete problem in the Adleman-Lipton Model The Proceedings of 2002 International Conference on Computer and Information Technology Japan 2002 157 162
20. W.-L. Chang, and M. Guo Solving the 3-dimensional matching problem and the set packing problem in Adleman-Lipton's Model IASTED International Conference on Networks, Parallel and Distributed Processing, and Applications Japan 2002 455 460
21. Fu, B., 1997. Volume bounded molecular computation, Ph.D. Thesis, Department of Computer Science, Yale University.
22. R.S. Braich, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, and L.M. Adleman Solution of a satisfiability problem on a gel-based DNA computer Proceedings of the sixth International Conference on DNA Computation in the Springer-Verlag Lecture Notes in Computer Science Series 1999
23. Kalim, M., Restricted genetic alphabet for DNA computing, In: Eric, B., Baum, Landweber, L.F., 1998. DNA Based Computers II: DIMACS Workshop, June 10-12, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI, pp. 243-246.
24. A.R. Cukras, D. Faulhammer, R.J. Lipton, and L.F. Landweber Chess games: a model for RNA-based computation Proceedings of the fourth DIMACS Meeting on DNA Based Computers University of Pennsylvania 1998 27 37
25. W.-L. Chang, and M. Guo Using sticker for solving the dominating-set problem in the Adleman-Lipton Model IEICE Trans. Inf. Syst. E-87D 7 2004 1782 1788
26. J.H. Reif, T.H. LaBean, and Seeman Challenges and applications for self-assembled DNA-nanostructures Proceedings of the Sixth DIMACS Workshop on DNA Based Computers Leiden, Holland 2000
27. T.H. LaBean, E. Winfree, and J.H. Reif Experimental progress in computation by self-assembly of DNA tilings Theor. Comput. Sci. 54 2000 123 140
28. T.H. LaBean, and J.H. Reif Logical computation using algorithmic self-assembly of DNA triple-crossover molecules Nature 407 2001 493 496
29. M.H. Garzon, and R.J. Deaton Biomolecular Computing and Programming IEEE Trans. Evolut. Comput. 3 1999 236 250
30. W.-L. Chang, M. Guo, and M. Ho Solving the set-splitting problem in sticker-based model and the Adleman-Lipton Model The 2003 International Symposium on Parallel and Distributed Processing and Applications Aizu City, Japan, LNCS 2745 2003 185 196