Molecular solutions for the subset-sum problem on DNA-based supercomputing

BioSystems

Volumn 73, Issue 2, 2004, Pages 117-130

  Chang, Weng Long ^a   Ho, Michael ^a   Guo, Minyi ^b  

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

^b UNIVERSITY OF AIZU   (Japan)

Author keywords

Biological parallel computing; DNA based supercomputing; Molecular based supercomputing; NP complete problem

Indexed keywords

DNA;

DNA;

ALGORITHM; ARTICLE; MATHEMATICAL COMPUTING; MOLECULAR BIOLOGY; MOLECULAR MODEL;

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

References (32)

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 11th 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., Leonard, M., 2003. Adleman. 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., 2002a. Solving the dominating-set problem in Adleman-Lipton's model. In: The Third International Conference on Parallel and Distributed Computing, Applications and Technologies, Japan, pp. 167-172.
9. Chang, W.-L., Guo, M., 2002b. Solving the clique problem and the vertex cover problem in Adleman-Lipton's model. In: IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, pp. 431-436.
10. Chang, W.-L., Guo, M., 2002c. Solving NP-complete problem in the Adleman-Lipton model. In: The Proceedings of 2002 International Conference on Computer and Information Technology, Japan, pp. 157-162.
11. Chang, W.-L., Guo, M., 2002d. Resolving the 3-dimensional matching problem and the set-packing problem in Adleman-Lipton's model. In: IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, pp. 455-460.
12. Chang W.-L., Guo M. Solving the Set-cover Problem and the Problem of Exact Cover by 3-sets in the Adleman-Lipton model. BioSystems. 72:2003;263-275.
13. Chang, W.-L., Guo, M., Ho, M., 2003. Solving the Set-splitting Problem in Sticker-based Model and the Adleman-Lipton Model. In: The 2003 International Symposium on Parallel and Distributed Processing and Applications, LNCS 2745, Aizu City, Japan, July 2003.
14. Cook, S.A., 1971. The complexity of theorem-proving procedures. In: Proceedings of Third Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 151-158.
15. Cormen, T.H., Leiserson, C.E., Rivest, R.L., 2003. Introduction to Algorithms.
16. Fu, B., 1997. Volume Bounded Molecular Computation. Ph.D. Thesis, Department of Computer Science, Yale University.
17. Garey, M.R., Johnson, D.S., 1979. Computer and Intractability. Freeman, San Fransico, CA.
18. Garzon M.H., Deaton R.J. Biomolecular computing and programming. IEEE Trans. Evol. Comput. 3:1999;236-250.
19. Karp, R.M., 1972. Reducibility among combinatorial problems. In: Complexity of Computer Computation. Plenum Press, New York, pp. 85-103.
20. LaBean T.H., Winfree E., Reif J.H. Experimental progress in computation by self-assembly of DNA tilings. Ther. Comput. Sci. 54:2000;123-140.
21. LaBean M.C., Reif T.H., Seeman J.H. Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature. 407:2003;493-496.
22. Lipton R.J. DNA solution of hard computational problems. Science. 268:1995;542-545.
23. Mir, K., 1998. A restricted genetic alphabet for DNA computing. In: Baum, E.B., Landweber, L.F. (Eds.), DNA Based Computers II: DIMACS Workshop, June 10-12, 1996, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol. 44, Providence, RI, pp. 243-246.
24. Morimoto N., Arita M., Suyama A. Solid phase DNA solution to the Hamiltonian path problem. DIMACS (Ser. Discrete Math. Ther. Comput. Sci.). 48:1999;93-206.
25. 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.
26. Paun, G., Rozenberg, G., Salomaa, A., 1998. DNA Computing: New Computing Paradigms. Springer-Verlag, New York, ISBN: 3-540-64196-3.
27. Perez-Jimenez, M.J., Sancho-Caparrini, F., 2001. Solving knapsack problems in a sticker based model. In: Seventh Annual Workshop on DNA Computing. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society.
28. Quyang Q., Kaplan P.D., Liu S., Libchaber A. DNA solution of the maximal clique problem. Science. 278:1997;446-449.
29. 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 (meeting at Leiden, Holland, June).
30. Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N.V., Goodman, M.F., Rothemund, P.W.K., Adleman, L.M., 1999. A sticker based model for dna computation. In: Landweber, L., Baum, E. (Eds.), Second Annual Workshop on DNA Computing, Princeton University. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, pp. 1-29.
31. Shin S.-Y., Zhang B.-T., Jun S.-S. Solving traveling salesman problems using molecular programming. Proc. Cong. Evol. Comput. (CEC99). 2:1999;994-1000.
32. Sinden, R.R., 1994. DNA Structure and Function. Academic Press.