Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model

BioSystems

Volumn 72, Issue 3, 2003, Pages 263-275

  Chang, Weng Long ^a   Guo, Minyi ^b  

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

^b UNIVERSITY OF AIZU   (Japan)

Author keywords

Biological computing; DNA based computing; Molecular computing; The NP complete problem

Indexed keywords

DNA;

MOLECULAR ANALYSIS;

ALGORITHM; ARTICLE; CALCULATION; DNA DETERMINATION; MOLECULAR MODEL; SIMULATION;

EID: 0344393603     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0303-2647(03)00149-7     Document Type: Article

References (28)

1. Adleman L. Molecular computation of solutions to combinatorial problems. Science. 266:1994;1021-1024.
2. Adleman, L.M., 1996. On constructing a molecular computer. DNA based computers. In: Lipton, R., Baum, E. (Eds.), DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 1-21.
3. Amos, M., 1997. DNA Computation, Ph.D. Thesis, Department of Computer Science, The University of Warwick.
4. Arita, M., Suyama, A., Hagiya, M., 1997. A heuristic approach for Hamiltonian path problem with molecules. In: Proceedings of Second Genetic Programming (GP-97). pp. 457-462.
5. Bach, E., Condon, A., Glaser, E., Tanguay, C., 1996. DNA models and algorithms for NP-complete problems. In: Proceedings of the Eleventh Annual Conference on Structure in Complexity Theory. pp. 290-299.
6. Boneh, D., Dunworth, C., Lipton, R.J., Sgall, J., 1996. On the computational power of DNA. In: Discrete Applied Mathematics. Special Issue on Computational Molecular Biology, vol. 71. pp. 79-94.
7. Braich, R.S., Johnson, C., Rothemund, P.W.K., Hwang, D., Chelyapov, N., Adleman, L.M., Solution of a satisfiability problem on a gel-based DNA computer. In: Proceedings of the Sixth International Conference on DNA Computation in the Springer-Verlag Lecture Notes in Computer Science series.
8. Chang, W.-L., Guo, M., 2002. Solving the Dominating-set Problem in Adleman-Lipton's Model. In: Proceedings of the Third International Conference on Parallel and Distributed Computing, Applications and Technologies, Japan.
9. Chang, W.-L., Guo, M., 2002. Solving the Clique Problem and the Vertex Cover Problem in Adleman-Lipton's Model. In: Proceedings of the IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan.
10. Chang, W.-L., Guo, M., 2002. Resolving the 3-dimensional matching problem and the set packing problem in Adleman-Lipton's Model. In: Proceedings of the IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan.
11. Chang, W.-L., Chu, C.-P., Huang, S.-C., 2002. DNA solution of the independent-set problem. In: Proceedings of the Eighth Workshop on High Performance Computing, Taiwan, pp. 120-126.
12. Chang, W.-L., Guo, M., 2003. Using Sticker for Solving the Dominating-set Problem in the Adleman-Lipton Model. IEICE Transaction on Information and System. In press.
13. Cormen, T.H., Leiserson, C.E., Rivest, R.L. Introduction to Algorithms.
14. Fu, B., 1997. Volume Bounded Molecular Computation, Ph.D. Thesis, Department of Computer Science, Yale University.
15. Garzon M.H., Deaton R.J. Biomolecular computing and programming. IEEE Trans. Evolution. Comput. 3:1999;236-250.
16. Garey, M.R., Johnson, D.S., 1979. Computer and Intractability. Freeman, San Fransico, CA.
17. LaBean T.H., Winfree E., Reif J.H. Experimental progress in computation by self-assembly of DNA tilings. Theoret. Computer Sci. 54:2000;123-140.
18. LaBean, M.C., Reif, T.H., Seeman, J.H. Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407, 493-496.
19. Lipton R.J. DNA solution of hard computational problems. Science. 268:1995;542-545.
20. Morimoto, N., Arita, M., Suyama, A., 1999. Solid phase DNA solution to the Hamiltonian path problem. DIMACS (Series in Discrete Mathematics and Theoretical Computer Science), vol. 48. pp. 93-206.
21. Narayanan, A., Zorbala, S., 1998. DNA algorithms for computing shortest paths. In: Koza, J.R. et al. (Eds.), Genetic Programming. Proceedings of the Third Annual Conference. pp. 718-724.
22. Paun, G., Rozenberg, G., Salomaa, A., 1998. DNA Computing: New Computing Paradigms. Springer, New York. ISBN: 3-540-64196-3.
23. 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.
24. Quyang Q., Kaplan P.D., Liu S., Libchaber A. DNA solution of the maximal clique problem. Science. 278:1997;446-449.
25. Reif, J.H., LaBean, T.H., Seeman, 2000. Challenges and Applications for Self-Assembled DNA-Nanostructures. In: Proceedings of the Sixth DIMACS Workshop on DNA Based Computers, Leiden, Holland, June 2000.
26. Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N.V., Goodman, M.F., Rothemund, P.W.K., Lipton, L.M., 1999. A Sticker Based Model for DNA Computation. In: Landweber, L., Baum, E. (Eds.), DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Proceedings of the Second Annual Workshop on DNA Computing, Princeton University. American Mathematical Society, pp. 1-29.
27. Shin, S.-Y., Zhang, B.-T., Jun. S.-S., 1999. Solving traveling salesman problems using molecular programming. In: Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), vol. 2. pp. 994-1000.
28. Sinden, R.R., 1994. DNA Structure and Function. Academic Press, New York.