Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms

Theoretical Computer Science

Volumn 287, Issue 1, 2002, Pages 59-71

  Hagiya, Masami ^a   Rose, John A ^a   Komiya, Ken ^a   Sakamoto, Kensaku ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DNA; MOLECULAR BIOLOGY; PROBABILITY; PROBLEM SOLVING;

MOLECULAR COMPUTATION;

COMPUTATIONAL COMPLEXITY;

EID: 0037174188     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00095-6     Document Type: Article

References (24)

1. Molecular computation of solutions to combinatorial problems
2. A universal molecular computer
3. Kinetics of conformational fluctuations in DNA hairpin-loops
4. A space-efficient randomized DNA algorithm for k-SAT
5. Reliability and efficiency of a DNA-based computation
6. A DNA-based random walk method for solving k-SAT
7. Towards parallel evaluation and learning of Boolean μ-formulas with molecules
8. Error-resilient DNA computations
9. Active transport in biological computing
10. Parallel molecular computation
11. On the power of DNA-computing
12. The fidelity of annealing-ligation: A theoretical analysis
13. A statistical mechanical treatment of error in the annealing biostep of DNA computation
14. The fidelity of the tag-antitag system
15. An equilibrium analysis of the efficiency of an autonomous molecular computer
16. A DNA-based in vitro genetic program
17. Solving Computational learning problems of Boolean formulae on DNA computers
18. Molecular computation by DNA hairpin formation
19. State transitions by molecules
20. A probabilistic algorithm for k-SAT and constraint satisfaction problems
21. Simulations of computing by self-assembly