Solving the set-splitting problem in sticker-based model and the Lipton-Adelmann model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2745, Issue , 2003, Pages 185-196

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

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

^b UNIVERSITY OF AIZU   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DNA; NUCLEIC ACIDS; POLYNOMIALS;

ADLEMAN-LIPTON MODELS; HAMILTONIAN PATH PROBLEMS; NP COMPLETE; SATISFIABILITY PROBLEMS; SET SPLITTING; SOLUTION SPACE;

PROBLEM SOLVING;

EID: 35248856564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37619-4_20     Document Type: Article

References (26)

1. R. R. Sinden. DNA Structure and Function. Academic Press, 1994.
2. L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021-1024, Nov. 11, 1994.
3. R. J. Lipton. DNA solution of hard computational problems. Science, 268:542:545, 1995.
4. Q. Quyang, P.D. Kaplan, S. Liu, and A. Libchaber. DNA solution of the maximal clique problem. Science, 278:446-449, 1997.
5. M. Arita, A. Suyama, and M. Hagiya. A heuristic approach for Hamiltonian path problem with molecules. Proceedings of 2nd Genetic Programming (GP-97), 1997, pp. 457-462.
6. N. Morimoto, M. Arita, and A. Suyama. Solid phase DNA solution to the Hamiltonian path problem. DIMACS (Series in Discrete Mathematics and Theoretical Computer Science), Vol. 48, 1999, pp. 93-206.
7. A. Narayanan, and S. Zorbala. DNA algorithms for computing shortest paths. In Genetic Programming 1998: Proceedings of the Third Annual Conference, J. R. Koza et al. (Eds), 1998, pp. 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, pp. 994-1000, 1999.
9. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms.
10. M. R. Garey, and D. S. Johnson. Computer and intractability. Freeman, San Fransico, CA, 1979.
11. D. Boneh, C. Dunworth, R. J. Lipton and J. Sgall. On the computational Power of DNA. In Discrete Applied Mathematics, Special Issue on Computational Molecular Biology, Vol. 71 (1996), pp. 79-94.
12. L. M. Adleman. On constructing a molecular computer. DNA Based Computers, Eds. R. Lipton and E. Baum, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society. 1-21 (1996)
13. M. Amos. "DNA Computation", Ph.D. Thesis, department of computer science, the University of Warwick, 1997.
14. S. Roweis, E. Winfree, R. Burgoyne, N. V. Chelyapov, M. F. Goodman, Paul W.K. Rothemund and L. M. Adleman. "A Sticker Based Model for DNA Computation". 2nd annual workshop on DNA Computing, Princeton University. Eds. L. Landweber and E. Baum, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society. 1-29 (1999).
15. M.J. Perez-Jimenez and F. Sancho-Caparrini. "Solving Knapsack Problems in a Sticker Based Model". 7nd annual workshop on DNA Computing, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 2001.
16. G. Paun, G. Rozenberg and A. Salomaa. DNA Computing: New Computing Paradigms. Springer-Verlag, New York, 1998. ISBN: 3-540-64196-3.
17. W.-L. Chang and M. Guo. "Solving the Dominating-set Problem in Adleman-Lipton's Model". The Third International Conference on Parallel and Distributed Computing, Applications and Technologies, Japan, 2002, pp. 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, Networks, Parallel and Distributed Processing, and Applications, Japan, 2002, pp. 431-436.
19. W.-L. Chang, M. Guo. "Solving NP-Complete Problem in the Adleman-Lipton Model". The Proceedings of 2002 International Conference on Computer and Information Technology, Japan, 2002, pp. 157-162.
20. W.-L. Chang and M. Guo. " Resolving the 3-Dimensional Matching Problem and the Set Packing Problem in Adleman-Lipton's Model". IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, 2002, pp. 455-460.
21. Bin Fu. "Volume Bounded Molecular Computation". Ph.D. Thesis, Department of Computer Science, Yale University, 1997.
22. Ravinderjit S. Braich, Clifford Johnson, Paul W.K. Rothemund, Darryl Hwang, Nickolas Chelyapov and Leonard M. Adleman. "Solution of a satisfiability problem on a gel-based DNA computer". Proceedings of the 6th International Conference on DNA Computation in the Springer-Verlag Lecture Notes in Computer Science series.
23. Kalim Mir. "A restricted genetic alphabet for DNA computing". Eric B. Baum and Laura F. Landweber, editors. DNA Based Computers II: DIMACS Workshop, June 10-12, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI, 1998, pp. 243-246.
24. A. R. Cukras, Dirk Faulhammer, Richard J. Lipton, and Laura F. Landweber. "Chess games: A model for RNA-based computation". In Proceedings of the 4th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16-19, 1998, pp. 27-37.
25. W.-L. Chang and M. Guo. "Using Sticker for Solving the Dominating-set Problem in the Adleman-Lipton Model". IEICE Transaction on Information System, 2003, accepted.
26. W.-L. Chang and M. Guo. "Solving the Set-basis Problem in Sticker-based Model and the Adleman-Lipton Model". It was submitted to the 2003 International Conference on Parallel Processing (ICPP2003), Kaohsiung, Taiwan, Republic of China.