Solving satisfiability problems using a novel microarray-based DNA computer

BioSystems

Volumn 90, Issue 1, 2007, Pages 242-252

  Lin, Che Hsin ^a   Cheng, Hsiao Ping ^a   Yang, Chang Biau ^a   Yang, Chia Ning ^b  

^a NATIONAL SUN YAT SEN UNIVERSITY   (Taiwan)

^b I SHOU UNIVERSITY   (Taiwan)

Author keywords

DNA array; DNA computing; SAT problem; Sticker model

Indexed keywords

ARRAY; COMPUTER; DNA; GENETIC ALGORITHM;

ALGORITHM; ARTICLE; COMPUTER; DNA MICROARRAY; DNA SEQUENCE; MATHEMATICAL COMPUTING; TECHNOLOGY;

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

References (21)

1. Adleman L. Molecular computation of solutions to combinatorial problems. Science 266 5187 (1994) 1021-1024
2. Braich R.S., Chelyapov N., Johnson C., Rothemund P.W.K., and Adleman L. Solution of a 20-variable 3-SAT problem on a DNA computer. Science 296 5567 (2002) 499-502
3. Britland S., Perez-Arnaud E., Clark P., McGinn B., Connolly P., and Moores G. Micropatterning proteins and synthetic peptides on solid supports: a novel application for microelectronics fabrication technology. Biotechnol. Progr. 8 2 (1992) 155-160
4. Chen, K., Ramachandran, V., 2001. A space-efficient randomized DNA algorithm for k-SAT. Condon.
5. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms (2001), The MIT Press, Boston
6. Diaz S., Esteban J.L., and Ogihara M. A DNA-Based Random Walk Method for Solving k-SAT (2001), Springer-Verlag, Berlin
7. Graham C.R., Leslie D., and Squirrell D.J. Gene probe assays on a fibre-optic evanescent wave biosensor. Biosens. Bioelectron. 7 7 (1992) 487-493
8. Lipton R.J. DNA solution of hard computational problems. Science 268 (1995) 542-545
9. Liu Q.H., Wang L.M., Frutos A.G., Condon A.E., Corn R.M., and Smith L.M. DNA computing on surfaces. Nature 403 6766 (2000) 175-179
10. Liu W.B., Zhang F.Y., and Xu J. A DNA algorithm for the graph coloring problem. J. Chem. Inform. Comput. Sci. 42 5 (2002) 1176-1178
11. Ouyang Q., Kaplan P.D., Liu S.M., and Libchaber A. DNA solution of the maximal clique problem. Science 278 5337 (1997) 446-449
12. Paun G., and Rozenberg G. Sticker systems. Theor. Comput. Sci. 204 1/2 (1998) 183-203
13. Pirrung M.C., Connors R.V., Odenbaugh A.L., Montague-Smith M.P., Walcott N.G., and Tollett J.J. The arrayed primer extension method for DNA microchip analysis. molecular computation of satisfaction problems. J. Am. Chem. Soc. 122 9 (2000) 1873-1882
14. Rozenberg G., and Spaink H. DNA computing by blocking. Theor. Comput. Sci. 292 3 (2003) 653-665
15. Sakamoto K., Gouzu H., Komiya K., Kiga D., Yokoyama S., Yokomori T., and Hagiya M. Molecular computation by DNA hairpin formation. Science 288 5469 (2000) 1223-1226
16. Schmidt K.A., Henkel C.V., Rozenberg G., and Spaink H.P. DNA computing using single-molecule hybridization detection. Nucleic Acids Res. 32 17 (2004) 4962-4968
17. Su X.P., and Smith L.M. Demonstration of a universal surface DNA computer. Nucleic Acids Res. 32 10 (2004) 3115-3123
18. Wang L.M., Liu Q.H., Corn R.M., Condon A.E., and Smith L.M. Multiple word DNA computing on surfaces. J. Am. Chem. Soc. 122 31 (2000) 7435-7440
19. Yang C.N., Chao C.H., Cheng S.P., and Lin C.H. A MEMS based DNA computer for solving SAT problems. Proceedings of the 1st IEEE International Conference of Nano/Micro Engineered and Molecular Systems. Zhuhai (2006)
20. Yang C.N., and Yang C.B. A DNA solution of SAT problem by a modified sticker model. Biosystems 81 1 (2005) 1-9
21. Yoshida H., and Suyama A. Solution to 3-SAT by Breadth First Search (1999), American Mathematical Society, Providence