Skip to main content
Springer Nature Link
Log in

Finite-State Molecular Computing

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2003)

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

Included in the following conference series:

  • 318 Accesses

Abstract

In this paper we explore the molecular computation model based on a splicing system and implemented in vitro by Shapiro. This paper presents two implementations, one implementing an FSA with two states, and the other one with three states, using enzymes BseMII and BseXI, respectively, which are different from only the one — FokI — used by Shapiro, et al. for their two-state FSA. The model of three-state, two-input symbol machine supports 1.835.001 syntactically distinct programs in comparison with 765 programs in Shapiro’s approach.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. 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 

  2. 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

    MathSciNet  Google Scholar 

  3. Unold, O., Troć, M.: Restriction Enzyme Computation, 7th International Work-Conference on Artificial and Natural Neural Networks, IWANN 2003, Lecture Notes in Computer Science (2003) (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Engineering Cybernetics, Wroclaw University of Technology, Wyb. Wyspianskiego 27, 50-370, Wroclaw, Poland

    Olgierd Unold & Maciej Troć

  2. Institute of Forensic Medicine, Medical University, Mikulicza-Radeckiego 4, 50-368, Wroclaw, Poland

    Tadeusz Dobosz & Alicja Trusewicz

Authors
  1. Olgierd Unold
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Troć
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tadeusz Dobosz
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alicja Trusewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99163, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Unold, O., Troć, M., Dobosz, T., Trusewicz, A. (2003). Finite-State Molecular Computing. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-45089-0_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40561-0

  • Online ISBN: 978-3-540-45089-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation