메뉴 건너뛰기




Volumn 85, Issue 2, 2006, Pages 95-98

Scalability of the surface-based DNA algorithm for 3-SAT

Author keywords

3 SAT; DNA computing on surfaces; Satisfiability

Indexed keywords

DNA;

EID: 33745762324     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.biosystems.2005.12.002     Document Type: Article
Times cited : (15)

References (15)
  • 1
    • 0028114541 scopus 로고
    • Molecular computation of solutions to combinatorial problems
    • Adleman L.M. Molecular computation of solutions to combinatorial problems. Science 266 (1994) 1021-1024
    • (1994) Science , vol.266 , pp. 1021-1024
    • Adleman, L.M.1
  • 2
    • 85194569597 scopus 로고    scopus 로고
    • Braich, R.S., Chelyapov, N., Johnson, C., Rothemund, P.W.K, Adleman L., 2002. Solution of a 20-variable 3-SAT problem on a DNA computer. Scienceexpress, March 14.
  • 3
    • 0034652204 scopus 로고    scopus 로고
    • Computation with biomolecules
    • Chen, Junghuei, and Wood D.H. Computation with biomolecules. PNAS 97 4 (2000) 1328-1330
    • (2000) PNAS , vol.97 , Issue.4 , pp. 1328-1330
    • Chen1    Junghuei2    Wood, D.H.3
  • 5
    • 0032517376 scopus 로고    scopus 로고
    • Enzymatic ligation reactions of DNA "words" on surfaces for DNA computing
    • Frutos A.G., Smith L.M., and Corn R.M. Enzymatic ligation reactions of DNA "words" on surfaces for DNA computing. J. Am. Chem. Soc. 120 40 (1998) 10277-10282
    • (1998) J. Am. Chem. Soc. , vol.120 , Issue.40 , pp. 10277-10282
    • Frutos, A.G.1    Smith, L.M.2    Corn, R.M.3
  • 6
    • 0344807615 scopus 로고    scopus 로고
    • Is DNA computing viable for 3-SAT problems?
    • Li D. Is DNA computing viable for 3-SAT problems?. Theor. Comput. Sci. 290 (2003) 2095-2107
    • (2003) Theor. Comput. Sci. , vol.290 , pp. 2095-2107
    • Li, D.1
  • 7
    • 0345688079 scopus 로고    scopus 로고
    • Hairpin formation in DNA computation presents limits for large NP-complete problems
    • Li D., Huang H., Li X., and Li X. Hairpin formation in DNA computation presents limits for large NP-complete problems. Biosystems 72 3 (2003) 203-207
    • (2003) Biosystems , vol.72 , Issue.3 , pp. 203-207
    • Li, D.1    Huang, H.2    Li, X.3    Li, X.4
  • 8
    • 24644521588 scopus 로고    scopus 로고
    • The surface-based approach for DNA computation is unreliable for SAT
    • Li D., Li X., Huang H., and Li X. The surface-based approach for DNA computation is unreliable for SAT. Biosystems 82 1 (2005) 20-25
    • (2005) Biosystems , vol.82 , Issue.1 , pp. 20-25
    • Li, D.1    Li, X.2    Huang, H.3    Li, X.4
  • 9
    • 0029278612 scopus 로고
    • DNA solution of hard computational problems
    • Lipton R.J. DNA solution of hard computational problems. Science 268 (1995) 542-545
    • (1995) Science , vol.268 , pp. 542-545
    • Lipton, R.J.1
  • 10
    • 0031879005 scopus 로고    scopus 로고
    • DNA computing on surfaces: encoding information at the single base level
    • Liu Q., Frutos A.G., Thiel A.J., Corn R.M., and Smith L.M. DNA computing on surfaces: encoding information at the single base level. J. Comput. Biol. 5 2 (1998) 269-278
    • (1998) J. Comput. Biol. , vol.5 , Issue.2 , pp. 269-278
    • Liu, Q.1    Frutos, A.G.2    Thiel, A.J.3    Corn, R.M.4    Smith, L.M.5
  • 12
    • 0034642504 scopus 로고    scopus 로고
    • DNA computing on a chip
    • Ogihara M., and Ray A. DNA computing on a chip. Nature 403 (2000) 143-144
    • (2000) Nature , vol.403 , pp. 143-144
    • Ogihara, M.1    Ray, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.