Hairpin formation in DNA computation presents limits for large NP-complete problems

BioSystems

Volumn 72, Issue 3, 2003, Pages 203-207

  Li, Dafa ^a   Huang, Hongtao ^b   Li, Xinxin ^c   Li, Xiangrong ^d  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Wayne State University   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

3 SAT problem; DNA computing; DNA hairpin; DNA strand; SAT problem

Indexed keywords

DNA; OLIGONUCLEOTIDE;

DNA;

ARTICLE; CALCULATION; DNA DETERMINATION; DNA STRAND; DNA STRUCTURE; PROBABILITY; RANDOMIZATION;

EID: 0345688079     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0303-2647(03)00145-X     Document Type: Article

References (8)

1. Adleman L.M., Molecular computation of solutions to combinatorial problems. Science. 266:1994;1021-1024.
2. Cantor, C.R., Schimmel, P.R., 1980. Biophysical Chemistry Part III: The Behavior of Biological Macromolecules. Freeman, San Francisco.
3. Frutos A.G., Liu Q., Thiel A.J., Sanner A.M.W., Condon A.E., Smith L.M., Corn R.M., Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Res. 25(23):1997;4748-4757.
4. Li D., Is DNA computing viable for 3-SAT problems? Theor. Comput. Sci. 290:2003;2095-2107.
5. Lipton R.J., DNA solution of hard computational problems. Science. 268:1995;542-545.
6. Liu Q., Wang L., Frutos A.G., Condon A.E., Corn R.M., Smith L.M., DNA computing on surfaces. Nature. 403:2000;175-179.
7. Ogihara M., Ray A., DNA computing on a chip. Nature. 403:2000;43-144.
8. Sakamoto K., Gouzu H., Komiya K., Kiga D., Yokoyama S., Yokomori T., Hagiya M., Molecular computation by DNA hairpin formation. Science. 288:2000;1223-1226.