Advertisement

Splicing to the Limit

  • Elizabeth Goode
  • Dennis Pixton
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2950)

Abstract

We consider the result of a wet splicing procedure after the reaction has run to its completion, or limit, and we try to describe the molecules that will be present at this final stage. In language theoretic terms the splicing procedure is modeled as an H system, and the molecules that we want to consider correspond to a subset of the splicing language which we call the limit language. We give a number of examples, including one based on differential equations, and we propose a definition for the limit language. With this definition we prove that a language is regular if and only if it is the limit language of a reflexive and symmetric splicing system.

Keywords

Molecular Type Limit Language Regular Language Site Class Discrete Apply Mathematic 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Culik II, K., Harju, T.: Splicing Semigroups of Dominoes and DNA. Discrete Applied Mathematics 31, 261–277 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Freund, R., Csuhaj-Varjú, E., Wachtler, F.: Test Tube Systems with Cutting/Recombination Operations. In: Pacific Symposium on Biocomputing (1997), http://WWW-SMI.Stanford.EDU/people/altman/psb97/index.html
  3. 3.
    Goode, E., Pixton, D.: Recognizing Splicing Languages: Syntactic Monoids and Simultaneous Pumping (Submitted 2003)Google Scholar
  4. 4.
    Head, T., Păun, G., Pixton, D.: Generative Mechanisms Suggested by DNA Recombination. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 7, vol. 2, pp. 295–360. Springer, Berlin (1997)Google Scholar
  5. 5.
    Head, T.: Formal Language Theory and DNA: an Analysis of the Generative Capacity of Specific Recombinant Behaviors. Bulletin of Mathematical Biology 49, 737–759 (1987), http://math.binghamton.edu/tom/index.html zbMATHMathSciNetGoogle Scholar
  6. 6.
    Head, T.: Splicing Languages Generated with One Sided Context. In: Păun, G. (ed.) Computing with Bio-Molecules. Theory and Experiments, pp. 158–181. Springer, Heidelberg (1998)Google Scholar
  7. 7.
    Laun, E., Reddy, K.J.: Wet Splicing Systems. In: Wood, D.H. (ed.) Proceedings of the 3rd DIMACS Workshop on DNA Based Computers, held at the University of Pennsylvania, June 23–25, pp. 115–126 (1997)Google Scholar
  8. 8.
    Pixton, D.: Splicing in Abstract Families of Languages. Theoretical Computer Science 234, 135–166 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Pixton, D.: Regularity of Splicing Languages. Discrete Applied Mathematics 69, 101–124 (1996)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Elizabeth Goode
    • 1
  • Dennis Pixton
    • 2
  1. 1.Mathematics DepartmentTowson UniversityTowsonUSA
  2. 2.Department of Mathematical SciencesBinghamton UniversityBinghamtonUSA

Personalised recommendations