Skip to main content

Restriction Enzyme Computation

  • Conference paper
  • First Online:
  • 1006 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2686))

Abstract

In this paper we explore the molecular computation model based on a splicing system. A simulator of the programmable, two-input symbol finite automaton is described. The molecular finite state machine is implemented with three enzymes of the class IIS restriction enzymes: Fokl, BseMII, and BseXI.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, L.M.: Molecular Computation of Solutions to Combinatorial Problems, Science 266 (1994) 1021–1024

    Article  Google Scholar 

  2. Benenson, Y., Paz-Elitzur, T., Adar, R., Keinan, E., Livneh, Z., and Shapiro, E.: Programmable Computing Machine Made of Biomolecules, Nature 414 (2001) 430–434

    Article  Google Scholar 

  3. Freund, R., Kari, L., Paun, G.: DNA Computing Based on Splicing; the Existence of Universal Computers, Theory Comput. Syst. (1999) 32, 69–112

    Article  MATH  MathSciNet  Google Scholar 

  4. Hagiya, M.: From Molecular Computing to Molecular Programming, DNA Com puting, 6th International Workshop on DNA-Based Computers, DNA 2000, In: Condon, A., Rozenberg, G. (eds.): Lecture Notes in Computer Science, Vol.2054 (2001)89–102

    Chapter  Google Scholar 

  5. Head, T.: Formal Language Theory and DNA: an Analysis of the Generative Capacity of Specific Recombinant Behaviors., Bull. Math. Biol. 49 (1987) 6, 737–759

    MATH  MathSciNet  Google Scholar 

  6. Hopcroft, J.E., Ullman, J.F.: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading MA (1979)

    MATH  Google Scholar 

  7. Lipton, R.J.: DNA Solution of Hard Computational Problem, Science 268 (1995) 542–545

    Article  Google Scholar 

  8. Mateescu, A., Paun, G., Rozenberg, G., and Salomaa, A.: Simple Splicing Sys tems, Discrete Appl. Math. (1998) 84, 145–163

    Article  MATH  MathSciNet  Google Scholar 

  9. Pixton, R.: Splicing in abstract families of languages, in SNAC Working Mate rial, TUCS General Publ. (1997) 6, 513–540

    Google Scholar 

  10. Rothemund, P.W.K.: A DNA and Restriction Enzyme Implementation of Turing Machines, In: Lipton. R.J., and Baum, E.B. (eds.): DNA Based Computers, American Mathematical Society, Providence, RI (1996) 1–22

    Google Scholar 

  11. Streyer, L.: Biochemistry, Freeman & Co. (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Unold, O., Troć, M. (2003). Restriction Enzyme Computation. In: Mira, J., Álvarez, J.R. (eds) Computational Methods in Neural Modeling. IWANN 2003. Lecture Notes in Computer Science, vol 2686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44868-3_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-44868-3_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40210-7

  • Online ISBN: 978-3-540-44868-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics