Skip to main content

Length-Separating Test Tube Systems

  • Conference paper
Book cover DNA Computing (DNA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4287))

Included in the following conference series:

  • 740 Accesses

Abstract

In this article we propose a formalization of protocols simulating the separation of molecules by gel electrophoresis. In our model, we introduce a new concept, namely, filtering by length – a direct formalization of the gel electrophoresis action. We also define a distributed computational model based on this action and on the splicing operation, called length-separating splicing test tube systems. We prove that these constructs, even with restricted size parameters, can simulate the Turing machines. We also discuss different natural restrictions and generalizations of the model which may be used to find efficient ways to realize DNA transformations in the laboratory.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Csuhaj-Varjú, E., Kari, L., Păun, G.: Test tube distributed systems based on splicing. Computers and AI 15(2–3), 211–232 (1996)

    MATH  Google Scholar 

  2. Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology 49(6), 737–759 (1987)

    MATH  MathSciNet  Google Scholar 

  3. Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  4. Margenstern, M., Rogozhin, Y.: A universal time-varying distributed H system of degree 2. Biosystems 52, 73–80 (1999)

    Article  Google Scholar 

  5. Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  6. Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 3. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  7. Verlan, S.: Communicating Distributed H Systems with Alternating Filters. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 367–384. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Verlan, S.: Head Systems and Applications to Bio-Informatics. PhD thesis, University of Metz, France (2004)

    Google Scholar 

  9. Verlan, S.: A boundary result on enhanced time-varying distributed H systems with parallel computations. Theoretical Computer Science 344(2-3), 226–242 (2005)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Csuhaj-Varjú, E., Verlan, S. (2006). Length-Separating Test Tube Systems. In: Mao, C., Yokomori, T. (eds) DNA Computing. DNA 2006. Lecture Notes in Computer Science, vol 4287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11925903_5

Download citation

  • DOI: https://doi.org/10.1007/11925903_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49024-1

  • Online ISBN: 978-3-540-68423-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics