Temperature gradient-based DNA computing for graph problems with weighted edges

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

Volumn 2568, Issue , 2003, Pages 73-84

  Lee, Ji Youn ^a   Shin, Soo Yong ^b   Augh, Sirk June ^c   Park, Tai Hyun ^a   Zhang, Byoung Tak ^b,c  

^a Seoul National University   (South Korea)

^b Sch Mat Sci Eng   (South Korea)

^c Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21144436461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (18)

1. L. M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021-1024, 1994.
2. R. S. Braich, N. Chelyapov, C. Johnson, P. W. K. Rothemund, and L. Adleman. Solution of a 20-varaible 3-SAT problem on a DNA computer. Science, 296:499-502, 2002.
3. J. Chen, E. Antipov, B. Lemieux, W. Cedeño, and D. H. Wood. In vitro selection for a MAX 1s DNA genetic algorithm. In Proceedings 5th International Workshop on DNA-Based Computers, pages 23-46, 2000.
4. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and company, 1979.
5. J. SantaLucia Jr. A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. Proc. Natl. Acad. Sci. USA, 95:1460-1465, 1998.
6. D. Kim, S.-Y. Shin, I.-H. Lee, and B.-T. Zhang. NACST/Seq: A sequence design system with multiobjective optimization. In Preliminary Proceedings of 8th International Meeting on DNA Based Computer, pages 241-251, 2002.
7. Q. Liu, L. Wang, A. G. Frutos, A. E. Condon, R. M. Corn, and L. M. Smith. DNA compouting on surface. Nature, 403:175-179, 2000.
8. A. Narayanan and S. Zorbalas. DNA algorithms for computing shortest paths. In Proceedings of Genetic Programming 1998, pages 718-723, 1998.
9. Q. Ouyang, P. D. Kaplan, S. Liu, and A. Libchaber. DNA solution of the maximal clique problem. Science, 278:446-449, 1997.
10. R. Owczarzy, P. M. Vallone, F. J. Gallo, T. M. Paner, M. J. Lane, and A. S. Benight. Predicting sequence-dependent melting stability of short duplex DNA oligomers. Bioploymers, 44:217-239, 1998.
11. G. G. Owenson, M. Amos, D. A. Hodgson, and A. Gibbsons. DNA-based logic. Soft Computing, 5(2):102-105, 2001.
12. J. H. Reif, T. H. LaBean, M. Pirrug, V. S. Rana, B. Guo, C. Kingsford, and G. S. Wickham. Experimental construction of a very large scale DNA database with associatice search capability. In The 7th International Workshop on DNA-Based Computers, pages 241-250.
13. S.-Y. Shin, D. Kim, I.-H. lee, and B.-T. Zhang. Multiobjective evolutionary algorithms to design error-preventing DNA sequences. Technical Report BI-02-003, Seoul National University, School of Computer Science and Engineering, Seoul National University, Seoul, Korea, March 2002.
14. S.-Y. Shin, D.-M. Kim, I.-H. Lee, and B.-T. Zhang. Evolutionary sequence generation for reliable DNA computing. In Proceedings of Congress on Evolutionary Computation 2002, pages 79-84, 2002.
15. S.-Y. Shin, B.-T. Zhang, and S.-S. Jun. Solving traveling salesman problems using molecular programming. In Proceedings of Congerss on Evolutionary Computation 1999. pages 994-1000, 1999.
16. J. G. Wetmur. DNA probes: applications of the principles of nucleic acid hybridization. Crit. Rev. Biochem. Mol. Biol., 26:227-259, 1991.
17. E. Winfree, F. Lin, L. A. Wenzler, and N. C. Seeman. Design and self-assembly of two-dimensional DNA crystals. Nature, 394(6693):539-545, 1998.
18. M. Yamamura, Y. Hiroto, and T. Matoba. Solutions of shortest path problems by concentration control. In Proceedings of 7th International Workshop on DNA-Based Computers, pages 231-240, 2001.