DNA computing sloves the 3-SAT problem with a small solution space

Current Nanoscience

Volumn 4, Issue 4, 2008, Pages 354-360

  Wang, Xiaolong ^a   Bao, Zhenmin ^a   Hu, Jingjie ^a   Gou, Deming ^b  

^a OCEAN UNIVERSITY OF CHINA   (China)

^b OKLAHOMA STATE UNIVERSITY   (United States)

Author keywords

DNA computing; SAT problem; Space complexity; Time complexity

Indexed keywords

COMPUTER EXPERIMENT; COMPUTING PROCESS; DNA COMPUTING; DNA LIBRARY; DNA MOLECULES; DNA STRANDS; EXPERIMENTAL PROTOCOLS; EXPONENT RATIOS; POSSIBLE SOLUTIONS; SAT PROBLEM; SAT PROBLEMS; SOLUTION SPACE; SPACE COMPLEXITY; STEP-BY-STEP; TEST TUBE; TIME COMPLEXITY;

ALGORITHMS; BIOSENSORS; CALCULATIONS; DNA; GENES; GENETIC PROGRAMMING; INTELLIGENT COMPUTING; NUCLEIC ACIDS;

COMPUTATION THEORY;

ALGORITHM; COMPUTER PREDICTION; DNA LIBRARY; DNA SEQUENCE; DNA STRAND; GENETIC CODE; INFORMATION PROCESSING; INFORMATION STORAGE; MATHEMATICAL COMPUTING; MOLECULAR EVOLUTION; POLYMERASE CHAIN REACTION; PRIORITY JOURNAL; REVIEW;

EID: 65749099968     PISSN: 15734137     EISSN: None     Source Type: Journal    
DOI: 10.2174/157341308786306099     Document Type: Review

References (16)

1. Adleman, L. Molecular computation of solutions to combinatorial problems. Science, 1994, 266, 1021.
2. Lipton, R. Using DNA to solve NP-complete problems. Science, 1995, 268, 542.
3. Yoshida, H.; Suyama, A. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science. Solution to 3-SAT by Breadth-First Search, American Mathematical Society, Providence, 2000, RI54, 9.
4. Li, Y.; Fang, C.; Ouyang, Q. Genetic algorithm in DNA computing: A solution to the maximal clique problem. Chinese Sci. Bull., 2004, 49(9), 967.
5. Liu, W.; Gao, L.; Zhang, Q.; Xu, G.; Zhu, X.; Liu, X.; Xu, J. A random walk DNA algorithm for the 3-SAT problem. Curr. Nanosci., 2005, 1, 85.
6. Wang, X.; Bao, Z.; Hu, J.; Wang, S.; Zhan, A. Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction. Biosystems, 2008, 91(1), 117.
7. Ouyang, Q.; Kaplan, P.D.; Liu S.; Libchaber, A. DNA solution of the maximal clique problem. Science, 1997, 278, 446.
8. Braich, R.S.; Chelyapov, N.; Johnson, C.; Rothermund, P.W.K.; Adleman, L. Solution of a 20-variable 3-SAT problem on a DNA computer. Science, 2002, 296, 499.
9. Liu, Q.; Wang, L.; Frutos, A.G.; Condon, A.E.; Corn, R.M.; Smith, L.M. DNA computing on surfaces. Nature, 2000, 403, 175.
10. Su, X.; Smith, L.M. Demonstration of a universal surface DNA computer. Nucleic Acids Res., 2004, 32(10): 3115.
11. Faulhammer, D.; Cukras, A.R.; Lipton, R.J.; Landweber, L.F. Molecular computation: RNA solutions to chess problems. Proc. Natl. Acad. Sci. USA, 2000, 97, 1385.
12. Ogihara, M.; Ray, A. DNA computing on a chip. Nature, 2000, 403, 143.
13. Sakamoto, K.; Gouzu, H.; Komiya, K.; Kiga, D.; Yokoyama, S.; Yokomori, T.; Hagiya, M. Molecular computation by DNA hairpin formation. Science, 2000, 288, 1223.
14. Benenson, Y.; Paz-Elizur, T.; Adar, R.; Keinan, E.; Livneh, Z.; Shapiro, E. Programmable and autonomous computing machine made of biomolecules. Nature, 2001, 414, 430.
15. Lindhal, T.; Ljungquist, S.; Siegert, W.; Niberg, B.; Sperens, B. DNA N-glycosylases. Properties of uracil-DNA glycosylases from E. coli. J. Biol. Chem., 1977, 252, 3286.
16. Selman B.; Mitchell D.; Levesque H. Generating hard satisfiability problem. Artif. Intell., 1996, 81, 17.