Natural Computing

, Volume 7, Issue 2, pp 167–181 | Cite as

On length-separating test tube systems

  • Erzsébet Csuhaj-Varjú
  • Sergey VerlanEmail author


In this article we introduce a new variant of test tube systems based on splicing where the communication of the words among the test tubes is based on filtering by their lengths. The model, called length-separating test tube systems, is motivated by the gel electrophoresis laboratory technique. We prove that these constructs, even with restricted size parameters, simulate the Turing machines. We also discuss some natural restrictions and generalizations of the model, which may be used to find efficient ways to realize DNA transformations in the laboratory.


Gel electrophoresis Length separation Splicing Test tube systems Universality 



This publication was supported by the Hungarian Foundation for Research and Technological Innovation (project no. TéT F-19/04) and the EGIDE in France (project no. Balaton 09000TC, year 2005) in the frame of the Hungarian-French Intergovernmental Scientific and Technological Cooperation.


  1. Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 226:1021–1024CrossRefGoogle Scholar
  2. Csuhaj-Varjú E, Kari L, Păun G (1996) Test tube distributed systems based on splicing. Comput Artif Intell 15(2–3):211–232zbMATHGoogle Scholar
  3. Guarnieri F, Fliss M, Bacroft C (1996) Making DNA add. Science 273(12):220–223CrossRefGoogle Scholar
  4. Head T (1987) Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull Math Biol 49(6):737–759MathSciNetzbMATHGoogle Scholar
  5. Hopcroft J, Motwani R, Ullman J (2001) Introduction to automata theory, languages, and computation, 2nd edn. Addison-Wesley, Reading, MassGoogle Scholar
  6. Khodor Y, Khodor J, Knight TF Jr (2002) Experimental confirmation of the basic principles of length-only discrimination. In: Jonoska N, Seeman NC (eds) DNA7. Lecture notes in computer science, vol 2340. Springer-Verlag, Berlin, pp 223–230Google Scholar
  7. Margenstern M, Rogozhin Y (1999) A universal time-varying distributed H System of degree 2. Biosystems 52:73–80CrossRefGoogle Scholar
  8. Păun G, Rozenberg G, Salomaa A (1998) DNA computing: new computing paradigms. Springer Verlag, BerlinzbMATHGoogle Scholar
  9. Rozenberg G, Salomaa A (1997) Handbook of formal languages, vols I–III. Springer Verlag, BerlinzbMATHGoogle Scholar
  10. Verlan S (2004a) Communicating distributed H systems with alternating filters. In: Jonoska N, Paun G, Rozenberg G (eds) Aspects of molecular computing. Essays Dedicated to Tom Head on the occasion of his 70th birthday. Lecture notes in computer science, vol 2950, pp 367–384. Springer Verlag, BerlinGoogle Scholar
  11. Verlan S (2004b) Head systems and applications to bio-informatics. PhD thesis, University of Metz, FranceGoogle Scholar
  12. Verlan S (2005) A boundary result on enhanced time-varying distributed H systems with parallel computations. Theor Comput Sci 344(2–3):226–242CrossRefMathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2007

Authors and Affiliations

  1. 1.Computer and Automation Research InstituteHungarian Academy of SciencesBudapestHungary
  2. 2.Department of Algorithms and Their Applications, Faculty of InformaticsEötvös Loránd UniversityBudapestHungary
  3. 3.Laboratoire d’Algorithmique, Complexité et Logique, Département InformatiqueUniversité Paris 12CreteilFrance

Personalised recommendations