Author:
Youn Lee Ji,Shin Soo-Yong,June Augh Sirk,Hyun Park Tai,Zhang Byoung-Tak
Publisher
Springer Berlin Heidelberg
Reference18 articles.
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.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献