The surface-based approach for DNA computation is unreliable for SAT

BioSystems

Volumn 82, Issue 1, 2005, Pages 20-25

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

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c The Department of Civil and Environmental Engineering   (United States)

^d Wayne State University   (United States)

Author keywords

3 SAT; DNA computing on surfaces; Satisfiability

Indexed keywords

DNA;

COMPUTER SIMULATION;

ALGORITHM; ARTICLE; DNA DETERMINATION; DNA STRAND; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; RELIABILITY;

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

References (7)

1. L.M. Adleman Molecular computation of solutions to combinatorial problems Science 266 1994 1021 1024
2. R.S. Braich, N. Chelyapov, C. Johnson, P.W.K. Rothemund, and L. Adleman Scienceexpress 2002 (14 March)
3. D. Li Is DNA computing viable for 3-SAT problems? Theor. Comput. Sci. 290 2003 2095 2107
4. D. Li, H. Huang, X. Li, and X. Li Hairpin formation in DNA computation presents limits for large NP-complete problems Biosystems 72 3 2003 203 207
5. R.J. Lipton DNA solution of hard computational problems Science 268 1995 542 545
6. Q. Liu, Li. Wang, A.G. Frutos, A.E. Condon, R.M. Corn, and L.M. Smith DNA computing on surfaces Nature 403 2000 175 179
7. K. Sakamoto, H. Gouzu, K. Komiya, D. Kiga, S. Yokoyama, T. Yokomori, and M. Hagiya Molecular computation by DNA hairpin formation Science 288 2000 1223 1226