Programmed Mutagenesis Is a Universal Model of Computation

  • Julia Khodor
  • David K. Gifford
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2340)

Abstract

Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that programmed mutagenesis is theoretically universal by showing how Minsky’s 4-symbol 7-state Universal Turing Machine [11] can be implemented using a programmed mutagenesis system. Each step of the Universal Turing Machine is implemented by four cycles of programmed mutagenesis, and progress is guaranteed by the use of alternate sense strands for each rewriting cycle. The full version of the proof will appear in the special issue of TOCS.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adleman, L. M., 1994, Molecular Computation of Solutions to Combinatorial Problems, Science, 266,5187, 1021–1024CrossRefGoogle Scholar
  2. 2.
    Beaver, D., 1995, Molecular Computing, Department of Computer Science and Engineering Technical Report, Penn State University.Google Scholar
  3. 3.
    Ausubel, I., Frederick, M. (eds.), 1997 Current Protocols in Molecular Biology, Section 8.5 (John Wiley & Sons, Inc.)Google Scholar
  4. 4.
    Hagiya, M., Arita,, M., Kiga, D., Sakomoto, K., and Yokoyama, S., 1999, Towards parallel evaluation and learning of Boolean mu-formulas with molecules, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 48, 57–72.Google Scholar
  5. 5.
    Head, T., 1987, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bulletin of Mathematical Biology, 49, 737–759.MATHMathSciNetGoogle Scholar
  6. 6.
    Kari, L., Thierin, G., 1996, Contextual Insertions/Deletions and Computability, Information and Computation 131, 47–61.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Khodor, J., Gifford, D. K., 1997 Design and Implementation of Computational Systems Based on Programmed Mutagenesis, Proceedings of 3rd DIMACS workshop on DNA-based computers.Google Scholar
  8. 8.
    Komiya, K., Sakamoto, K., Gouzu, H., Yokoyama, S., Arita, M., Nishilkawa, A., and Hagiya, M., 2000, Successive state transitions with IO interface by molecules, Proceedings of 6th DIMACS workshop on DNA-based computers.Google Scholar
  9. 9.
    Lipton, R., 1995, DNA solution to computational problems, Science, 268,5210, 542–545.CrossRefGoogle Scholar
  10. 10.
    Mao, C., LaBean, T.H., Reif, J.H., Seeman, N.C., 2000 Logical computation using algorithmic self-assembly of DNA triple-crossover molecules, Nature 407, 493–496.CrossRefGoogle Scholar
  11. 11.
    Minsky, M.L., 1967, Computation: Finite and Infinite Machines (Prentice-Hall, Inc.).Google Scholar
  12. 12.
    Paun, Gh., Rozenberg, G., Salomaa, A., 1998, DNA Computing (Springer-Verlag).Google Scholar
  13. 13.
    Sakomoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., and Hagiya, M., 2000, Molecular computation by DNA hairpin formation, Science, 288, 1223–1226.CrossRefGoogle Scholar
  14. 14.
    Turing, A.M., 1936, On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, Series 2, 42, 230–265.MATHCrossRefGoogle Scholar
  15. 15.
    Tyagi, S., Kramer, F.R., 1996, Molecular Beacons: Probes that Flouresce upon Hybridization, Nature Biotechnology 14, 303–308.CrossRefGoogle Scholar
  16. 16.
    Winfree, E., 1995, On the computational power of DNA annealing and ligation, DNA Based Computers: DIMACS Workshop, 27, 199–221.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Julia Khodor
    • 1
  • David K. Gifford
    • 1
  1. 1.Laboratory for Computer ScienceMassachusetts Institute of TechnologyUSA

Personalised recommendations