Length-Separating Test Tube Systems

  • Erzsébet Csuhaj-Varjú
  • Sergey Verlan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4287)


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.


Test Tube Turing Machine Regular Language Communication Graph Communication Step 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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)MATHGoogle Scholar
  2. 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)MATHMathSciNetGoogle Scholar
  3. 3.
    Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)MATHGoogle Scholar
  4. 4.
    Margenstern, M., Rogozhin, Y.: A universal time-varying distributed H system of degree 2. Biosystems 52, 73–80 (1999)CrossRefGoogle Scholar
  5. 5.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)MATHGoogle Scholar
  6. 6.
    Rozenberg, G., Salomaa, A.: Handbook of Formal Languages, vol. 3. Springer, Heidelberg (1997)MATHGoogle Scholar
  7. 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)CrossRefGoogle Scholar
  8. 8.
    Verlan, S.: Head Systems and Applications to Bio-Informatics. PhD thesis, University of Metz, France (2004)Google Scholar
  9. 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)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Erzsébet Csuhaj-Varjú
    • 1
    • 2
  • Sergey Verlan
    • 3
  1. 1.Computer and Automation Research InstituteHungarian Academy of SciencesBudapest, Kende u. 13-17
  2. 2.Department of Algorithms and Their Applications, Faculty of InformaticsEötvös Loránd UniversityBudapest
  3. 3.LACL, Département InformatiqueUniversité Paris 12CréteilFrance

Personalised recommendations