Solving intractable problems with DNA computing

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 154-168

  Beigel, R ^a   Fu, B ^a  

^a Lehigh University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL COMPLEXITY; DNA;

COMPLEXITY THEORY; DNA-COMPUTING;

PROBLEM SOLVING;

EID: 84890788779     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694601     Document Type: Conference Paper

References (49)

1. L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021-1024, Nov. 1994.
2. L. Adleman. On constructing a molecular computer. In Proceedings of the 1st DI-MA CS Workshop on DNA Pased Computers (1995), pages 1-21. American Mathematical Society, 1996. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 27.
3. E. Bach, A. Condon, E. Glaser, and C. Tanguay. DNA models and algorithms for NP-complete problems. In Proceedings of the 11th Annual Conference on Structure in Complexity Theory, pages 290-299, 1996.
4. E. Baum. Building an associative memory vastly larger than the brain. Technical report, NEC, 1996.
5. E. T. Bax. Inclusinon and exclusion algorithm for the hamiltonian path problem. Information Processing Letters, 47:203207, 1993.
6. D. Beaver. Molecular computation. Technical report, Penn State University, 1995.
7. D. Beaver. A universal molecular computer. In Proceedings of the 1st DIMACS Workshop on DNA Based Computers (1995). American Mathematical Society, 1996. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 27.
8. R. Beige1 and B. Fu. Molecular computing, bounded nondeterminism, and efficient recursion. In Proceedings of the 24th International Colloquium on Automata, Languages, and Programming, pages 816-826, 1997. LNCS 1256.
9. R. Beige1 and J. Goldsmith. Downward separation fails catastrophically for limited nondeterminism classes. In Proceedings of the 9th Annual Conference on Structure in Complexity Theory, pages 1344138, 1994.
10. D. Boneh, C. Dunworth, and R. J. Lipton. Breaking DES using a molecular computer. In Proceedings of the 1st DIM A CS Workshop on DNA Based Computers (1995). American Mathematical Society, 1996. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 27.
11. D. Boneh, C. Dunworth, R. J. Lipton, and J. Sgall. On the computational power of DNA. Discrete Applied Math., 71:79-94, 1996.
12. D. Boneh and R. Lipton. Making DNA computer error resistent. In Proceedings of Second Annual DIMACS Workshop on DNA Computation, 1996.
13. J. F. Buss and J. Goldsmith. Nondeter-minism within P. S1COMP, 22:560-572, 1993.
14. J. D. C. Alvarez and J.Toran. Complexity classes with complete problems between P and NP-complete. In Foundations of Computation Theory, pages 13-24. Springer-Verlag, 1989. LNCS 380.
15. W. Cai, A. E. Condon, R. M. Corn, E. Glaser, Z. Fei, T. Frutos, Z. Guo, M. G. Lagally, Q. Liu, L. M. Smith, and A. Thiel. The power of surface-based DNA computation. Manuscript, 1996.
16. J. Diaz and J. Toran. Classes of bounded nondetermimsm. MST, 23:21-32, 1990.
17. W. Feller. An Introduction to Probability Theory and Its Application, volume 1. John Wiley and Sons, 1957.
18. B. Fu. Volume Bounded Molecular Computation. PhD thesis, Yale University, Dept. of Computer Science, New Haven, CT, 1997.
19. B. Fu and R. Beigel. A comparison of resource-bounded molecular computation models. In Proceedings of the 5th Israel Symposium on Theory of Computing and Systems, pages 6-11, 1997.
20. B. Fu and R. Beigel. Molecular approximation algorithm for np-optimization problems. In Proceedings of Third Annual DI-MACS Workshop on DNA Computation, pages 93-101, June 1997.
21. B. Fu, R. Beigel, and F. Zhou. An 0(n2(log2 n)2") volume molecular algorithm for Hamiltonian path. Manuscript, 1997.
22. J. Goldsmith, M. Levy, and M. Mundhenk. Limited nondeterminism. SIGACT News, pages 20-29, June 1996.
23. L. Hemachandra and S. Jha. Defying upward and downward separation. Inf. & Comp., 121:1-13, 1995.
24. L. Kari. DNA computing: Arrival of biological mathematics. The Mathematical Intelligencer, 19(2):9-22, 1997.
25. R. Karp, C. Kenyon, and 0. Warts. Error-resilient DNA computations. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458467, 1996.
26. C. M. R. Kintala and P. C. Fischer. Refining nondeterminism in relativized polynomial-time bounded computations. SICOMP, 9(l):46-53, Feb. 1980.
27. R. Lipton. Using DNA to solve NP-complete problems. Science, 268:542-545, Apr. 1995.
28. A. Meyer and M. Paterson. With what frequency are apparently intractable problems difficult? Technical Report MIT/LCS/TM-126, M. I. T., 1979.
29. B. Monien and E. Speckenmeyer. Solving satisfiability in less than 2-steps. Discrete Applied Math., 10:287-295, 1985.
30. M. Ogihara. Breadth first search 3SAT algorithms for DNA computers. Technical Report 629, University of Rochester, July 1996.
31. M. Ogihara and A. Ray. Simulating boolean circuits on DNA computers. Proceedings of First International Conference on Computational Molecular Biology, 326-331, ACM Press, 1997.
32. M. Ogihara, A. Ray, and K. Smith. Computing - a shape of computation to come. SIGACT News, 28(3):2-11, 1997.
33. C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the V-C dimension. In Proceedings of the 8th Annual Conference on Structure in Complexity Theory, pages 1218, 1993.
34. N. Pisanti. A survey on DNA computing. Technical report, University Di Pisa, 1997.
35. J. Reif. Parallel molecular computation. In Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 213-223, 1995.
36. J. Reif. Paradigms for biomolecular computation. In Unconventional Models of Computation, pages 72-93. Springer, 1998.
37. D. Roos and K. Wagner. On the power of bio-computers. Technical report, University of Wurzburg, Feb. 1995. ftp://haegar.informatik.uni-wuerzburg.de/pub/TRs/ro-wa95.ps.gz.
38. D. Roos and K. Wagner. On the power of dna-computing. Information and Computation, 131:95-109, 1996.
39. P. Rothemund. A DNA and restriction enzyme implementation of Turing machines. In Proceedings of the 1st DIMACS Workshop on DNA Pased Computers (1995), pages 755119. American Mathematical Society, 1996. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 27.
40. S. Roweis, E. Winfree, R. Burgoyne, N. V. Chelyapov, M. F.Goodman, P. W. Rothe-mund, and L. M. Adleman. A sticker based model for DNA computation. In Proceedings of the Second Annual Meeting on DNA Based Computers, 1996.
41. J. Sambrook, E. Fritsch, and T. Maniatis. Molecular Cloning. Cold Spring Harbor, NY, 1989.
42. L. Sanchis. Constructing language instances based on partial information. International Jour. Found. Comp. Sci., 5(2):209-229, 1994.
43. C. P. Schnorr. Optimal algorithms for self-reducible problems. In Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming, pages 3222337, 1976.
44. A. L. Selman. Natural self-reducible sets. SICOMP, 17:989-996, 1988.
45. J. Setubal and J. Meidanis. Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.
46. W. Smith and A. Schweitzer. DNA computers in vitro and vivo. Technical report, NEC, 1995.
47. S. Toda. PP is as hard as the polynomial-time hierarchy. SICOMP, 20(5):865-877, 1991.
48. J. Watson, M. Gilman, J. Witkowski, and M. Zoller. Recombinant DNA (2nd edition). Scientific American Books, W.H.Freeman and Co., 1992.
49. J. Watson, N. Hoplins, J. Roberts, et al. Molecular Biology of the Gene. Benjamin/Cummmings, Menlo Park, CA, 1987.