Using DNA to solve the Bounded Post Correspondence Problem

Theoretical Computer Science

Volumn 231, Issue 2, 2000, Pages 193-203

  Kari, Lila ^a   Gloor, Greg ^a   Yu, Sheng ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

DNA computing: Biomolecular computing; NP complete problem; Post correspondence problem

Indexed keywords

EID: 0347685887     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00100-0     Document Type: Article

References (56)

1. L. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994) 1021-1024.
2. L. Adleman, On constructing a molecular computer, 1st DIMACS Workshop on DNA Based Computers, Princeton, 1995, DIMACS Series, Vol. 27, AMS Press, 1996, pp. 1-21.
3. M. Amos, A. Gibbons, D. Hodgson, Error-resistant implementation of DNA computation, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 151-161.
4. M. Arita, M. Hagiya, A. Suyama, Joining and rotating data with molecules, Proc. 1997 IEEE Internat. Conf. on Evolutionary Computation, IN, pp. 243-248.
5. M. Arita, A. Suyama, M. Hagiya, A heuristic approach for Hamiltonian Path Problem with molecules, Genetic Programming 1997: Proc. 2nd Ann. Conf. (GP-97), Morgan Kaufmann, Los Altos, CA, in press.
6. E. Baum, Building an associative memory vastly larger than the brain, Science 268 (1995) 583-585.
7. E. Baum, D. Boneh, Running dynamic programming algorithms on a DNA computer, 2nd DIMACS Workshop on DNA Based Computers, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 77-85.
8. D. Beaver, Computing with DNA, J. Comput. Biol. 2 (1) (1995) 1-8.
9. D. Beaver, A universal molecular computer, 1st DIMACS Workshop on DNA Based Computers, Princeton, 1995, DIMACS Series, Vol. 27, 1996, AMS Press, pp. 29-36.
10. D. Boneh, C. Dunworth, R. Lipton, Breaking DES using a molecular computer, 1st DIMACS Workshop on DNA Based Computers, Princeton, 1995, DIMACS Series, Vol. 27, 1996, AMS Press, pp. 37-65.
11. D. Boneh, R. Lipton, C. Dunworth, J. Sgall, On the computational power of DNA, Discrete Appl. Math. 71 (1996) 79-94.
12. R. Constable, H. Hunt, S. Sahni, On the computational complexity of scheme equivalence, Report No. 74-201, Dept. of Computer Science, Cornell University, Ithaca, NY, 1974.
13. E. Csuhaj-Varju, R. Freund, L. Kari, G. Paun, DNA computing based on splicing: universality results. Proceedings of 1st Annual Pacific Symposium on Biocomputing, Hawaii, 1996, L. Hunter, T. Klein, eds., World Scientific Publ., Singapore, 1996, 179-190.
14. R. Deaton, R. Murphy, J. Rose, M. Garzon, D. Franceschetti, S. Stevens, A DNA based implementation of an evolutionary search for good encodings for DNA computation, Proc. 1997 IEEE Int. Conf. on Evolutionary Computation, Indianapolis, pp. 267-271.
15. C.W. Dieffenbach, G.S. Dveksler (Eds.), PCR Primer: A Laboratory Manual, Cold Spring Harbor Laboratory Press, Cold Spring Harbor, New York, 1995, pp. 581-621.
16. R. Freund, L. Kari, G. Paun, DNA computing based on splicing: the existence of universal computers. Theory of Computing Systems 32 (1999) 69-112.
17. M. Garey, D. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
18. D.K. Gifford, On the path to computation with DNA, Science 266 (1994) 993-994.
19. F. Guarnieri, M. Fliss, C. Bancroft, Making DNA add, Science 273 (1996) 220-223.
20. M. Hagiya, M. Arita, Towards parallel evaluation and learning of Boolean μ-formulas with molecules, 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, 1997, pp. 105-114.
21. T. Head, Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors, Bull. Math. Biol. 49 (1987) 737-759.
22. T. Head, G. Paun, D. Pixton, Language theory and genetics. Generative mechanisms suggested by DNA recombination, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 2, Springer, Berlin, 1996, pp. 295-360.
23. J. Hopcroft, J. Ulmann, Formal Languages and their Relation to Automata, Addison-Wesley, Reading, MA, 1969.
24. N. Jonoska, S. Karl, A molecular computation of the road coloring problem, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 87-96.
25. N. Jonoska, S. Karl, Ligation experiments in computing with DNA, Proc. 1997 IEEE Internat. Conf. on Evolutionary Computation, IN, pp. 261-266.
26. P. Kaplan, G. Cecchi, A. Libchaber, Molecular computation: Adleman's experiment repeated, Technical Report, NEC Research Institute, 1995.
27. P. Kaplan, G. Cecchi, A Libchaber, DNA-based molecular computation: template-template interactions in PCR, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 97-104.
28. L. Kari, DNA computing: arrival of biological mathematics, Math. Intell. 19 (2) (1997) 9-22.
29. L. Kari, From Micro-Soft to Bio-Soft: computing with DNA, Proc. BCEC'97 (Bio-Computing and Emergent Computation) Skovde, Sweden, World Scientific, Singapore, pp. 146-164.
30. L. Kari, G. Thierrin, Contextual insertions/deletions and computability, Inform. Comput. 131 (1) (1996) 47-61.
31. L. Kari, G. Paun, G. Thierrin, S. Yu, At the crossroads of DNA computing and formal languages: characterizing recursively enumerable languages using insertion/deletion systems, 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, 1997, DIMACS Series, Vol. 48, 1999, AMS Press, pp. 329-346.
32. J. Kendrew et al. (Eds.), The Encyclopedia of Molecular Biology, Blackwell Science, Oxford, 1994.
33. S. Kobayashi, T. Yokomori, G. Sampei, K. Mizobuchi, DNA implementation of simple Horn clause computation, Proc. IEEE Internat. Conf. on Evolutionary Computation, IN, 1997, pp. 213-217.
34. T. Leete, M. Schwartz, R. Williams, D. Wood, J. Salem, H. Rubin, Massively parallel DNA computation: expansion of symbolic determinants, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 45-58.
35. R. Lipton, DNA solution of hard computational problems, Science 268 (1995) 542-545.
36. Q. Liu, Z. Guo, A. Condon, R. Corn, M. Lagally, L. Smith, A surface-based approach to DNA computation, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 123-132.
37. Maniatis et al., Molecular Cloning: A Laboratory Manual, Cold Spring Harbor Press, New York, 1982.
38. J. Oliver, Computation with DNA: matrix multiplication, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44. 1999, AMS Press, pp. 113-122.
39. G. Paun, On the power of the splicing operation, Internat. J. Comput. Math. 59 (1995) 27-35.
40. G. Paun, A. Salomaa, DNA computing based on the splicing operation, Math. Japonica 43 (3) (1996) 607-632.
41. J. Reif, Parallel molecular computation: models and simulations, Proc. 7th Ann. ACM Symp. on Parallel Algorithms and Architectures (SPAA'95) Santa Barbara, CA, July 1995, pp. 213-223.
42. J. Reif, Paradigms for Biomolecular Computation, First International Conference on Unconventional Models of Computation, Auckland, New Zealand, January 1998. Published in Unconventional Models of Computation, edited by C.S. Calude, J. Casti, and M.J. Dinneen, Springer Publishers, January 1998, pp. 72-93, 161.
43. J. Reif, Paradigms for Biomolecular Computation, First International Conference on Unconventional Models of Computation, Auckland, New Zealand, January 1998. Published in Unconventional Models of Computation, edited by C.S. Calude, J. Casti, and M.J. Dinneen, Springer Publishers, January 1998, pp. 72-93, 161.
44. P. Rothemund, A DNA and restriction enzyme implementation of Turing machines, 1st DIMACS Workshop on DNA Based Computers, Princeton, 1995, DIMACS Series, Vol. 27, 1996, AMS Press, pp. 75-119.
45. S. Roweis, E. Winfree, R. Burgoyne, N. Chelyapov, M. Goodman, P. Rothemund, L. Adleman, A Sticker based model for DNA computation, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 1-29.
46. H. Rubin, Looking for the DNA killer app, Nature 3 (1996) 656-658.
47. A. Salomaa, Formal Languages, Academic Press, New York, 1973.
48. Sambrook et al., Molecular Cloning: A Laboratory Manual, 2nd ed., 1989.
49. N. Seeman et al., The perils of polynucleotides: The experimental gap between the design and assembly of unusual DNA structures, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 215-233.
50. W. Smith, DNA computers in vitro and in vivo, 1st DIMACS Workshop on DNA Based Computers, Princeton, 1995, DIMACS Series, Vol. 27, 1996, AMS Press, pp. 121-185.
51. T. Yokomori, S. Kobayashi, DNA-EC: a model of DNA computing based on equality checking, 3rd DIMACS Workshop on DNA Based Computers, Philadelphia, 1997, DIMACS Series, Vol. 48, 1999, AMS Press, pp. 347-360.
52. T. Yokomori, S. Kobayashi, C. Ferretti, On the power of circular splicing systems and DNA computability, Proc. 1997 IEEE Internat. Conf. on Evolutionary Computation, IN, pp. 219-224.
53. R. Williams, D. Wood, Exascale computer algebra problems interconnect with molecular reactions and complexity theory, 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, pp. 260-268.
54. E. Winfree, Complexity of restricted and unrestricted models of molecular computation, 1st DIMACS Workshop on DNA Based Computers, Princeton, 1995, DIMACS Series, Vol. 27, 1996, AMS Press, pp. 187-198.
55. E. Winfree, On the computational power of DNA annealing and ligation, 1st DIMACS Workshop on DNA Based Computers, Princeton, 1995, DIMACS Series, Vol. 27, 1996, AMS Press, pp. 199-221.
56. E. Winfree, X. Yang, N. Seeman, Universal computation via self-assembly of DNA: some theory and experiments. 2nd DIMACS Workshop on DNA Based Computers, Princeton, 1996, DIMACS Series, Vol. 44, 1999, AMS Press, pp. 191-213.