On the computational power of DNA

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 79-94

  Boneh, Dan ^a   Dunworth, Christopher ^a   Lipton, Richard J ^a   Sgall, Jiří ^b,c  

^a Princeton University   (United States)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003278311     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00058-3     Document Type: Article

References (23)

1. L. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994) 1021-1024
2. L. Adleman, On constructing a molecular computer, Proceedings of the 1st DIMACS Workshop on DNA Computing.
3. M. Amos, A. Gibbons and D. Hodgson, Error-resistant implementation of DNA computations, Unpublished manuscript.
4. E. Bach, A. Condon, E. Glaser and C. Tanguay, DNA models and algorithms for NP-complete problems, Proceedings of the 11th Annual IEEE Conference on Computational Complexity, 1996.
5. D. Beaver, A universal molecular computer, Tech. Report CSE-95-001, Penn State University, (1995).
6. D. Boneh, C. Dunworth and R.J. Lipton, Breaking DES using a molecular computer, Tech. Report CS-TR-489-95, Princeton University (1995). Also in Proceedings of 1st DIMACS Workshop on DNA Computing.
7. D. Boneh, C. Dunworth and R.J. Lipton, Breaking DES using a molecular computer, Tech. Report CS-TR-489-95, Princeton University (1995). Also in Proceedings of 1st DIMACS Workshop on DNA Computing.
8. D. Boneh, C. Dunworth, R. J. Lipton and J. Sgall, On the computational power of DNA, Tech. Report CS-TR-499-95, Princeton University (1995).
9. D. Boneh and R.J. Lipton, Making DNA computers error resistant, Tech. Report CS-TR-491-95, Princeton University (1995).
10. D. Boneh, R.J. Lipton and J. Sgall, Error resistant and uniform DNA computers, in preparation.
11. M. Jerrum, L. Valiant and U. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoret. Comput Sci. 43 (1986) 169-188.
12. R. Kannan, Markov chains and polynomial time algorithms, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (IEEE, New York, 1994) 656-671.
13. R. Karp, C. Kenyon and O. Waarts, Error-resilient DNA computations, Proceedings of SODA (1996) 458-467.
14. R.J. Lipton, Using DNA to solve NP-complete problems, Science 542-545 (1995) 268.
15. C. Papadimitriou, private communications.
16. J. Reif, Parallel molecular computation, Proceedings of 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'95) (1995) 213-223.
17. J. Robson, Algorithms for maximum independent sets. J. Algorithms 7, (1986) 425-440.
18. D. Rooß and K.W. Wagner, On the power of bio-computers, Tech. Report, University of Würzburg (1995).
19. Rothemund, A DNA and restriction enzyme implementation of Turing machines. Available at http://www.ugcs.caltech.edu/ pwkr/oett.html.
20. W. Smith and A. Schweitzer, DNA computers in vitro and vivo, Tech. Report, NEC, (1995).
21. L. Stockmeyer, On approximating algorithms for #P. SIAM J. Comput., 14, (1985) 849-861.
22. R. Tarjan and A. Trojanowsky, Finding a maximum independent set, SIAM J. Comput. 6 (1977) 537-546.
23. E. Winfree, On the computational power of DNA annealing and ligation. Available at http://dope.caltech.edu/winfree/DNA.html.