Skip to main content

Abstract

We address the issue of the computational power of a formal model ([3], [6]) for the guided homologous recombinations that take place during gene rearrangement in ciliates. Results in [7], [5] have shown that a generalization of this model that assumes context-controlled recombinations has universal computational power. Complementing results in [4], [11], [12], [15], we study properties of context-free recombinations and characterize the languages generated by context-free recombination systems. As a corollary, we obtain context-free recombinations which are computationally weak, being able to generate only regular languages. This is one more indicator that, most probably, the presence of direct repeats does not provide all the information needed for accurate splicing during gene rearrangement.

Even if the rope breaks nine times, we must splice it back together a tenth time.

— Tibetan proverb

Research partially supported by Grant R2824AO1 of the Natural Sciences and Engineering Research Council of Canada to L.K. and NSF Grant CCR 97-33101 to J.K.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.; R. Freund; L. Kari & Gh. Păun (1996), DNA computing based on splicing: universality results, in L. Hunter & T. Klein, eds., Proceedings of the 1st Pacific Symposium on Biocomputing: 179–190. World Scientific, Singapore.

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  3. Head, T. (1991), Splicing schemes and DNA, in G. Rozenberg & A. Salomaa, eds., Lindenmayer Systems: 371–383. Springer, Berlin.

    Google Scholar 

  4. Head, T.; Gh. Păun & D. Pixton (1997), Language theory and molecular genetics, in G. Rozenberg & A. Salomaa, eds., Handbook of Formal Languages, II: 295–358. Springer, Berlin.

    Google Scholar 

  5. Kari, L.; J. Kari & L. Landweber (1999), Reversible molecular computation in ciliates, in J. Karhumäki; H. Maurer; Gh. Păun & G. Rozenberg, eds., Jewels are Forever: 353–363. Springer, Berlin.

    Chapter  Google Scholar 

  6. Landweber, L.F. & L. Kari (1998), The evolution of cellular computing: nature’s solution to a computational problem, in Proceedings of the 4th DIMACS Meeting on DNA Based Computers: 3-15, Philadephia. Also in Biosystems.

    Google Scholar 

  7. Landweber, L.F. & L. Kari (1999), Universal molecular computation in ciliates, in L. Landweber & E. Winfree, eds., Evolution as Computation, Springer, Berlin.

    Google Scholar 

  8. Meyer, E. & S. Duharcourt (1996), Epigenetic Programming of Developmental Genome Rearrangements in Ciliates, Cell, 87: 9–12.

    Article  Google Scholar 

  9. Păun, Gh. (1995), On the power of the splicing operation, International Journal of Computer Mathematics, 59: 27–35.

    Article  MATH  Google Scholar 

  10. Pixton, D. (1995), Linear and circular splicing systems, in Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems: 181-188. IEEE Computer Society Press, Los Alamos, Ca.

    Google Scholar 

  11. Pixton, D. (1996), Regularity of splicing languages, Discrete Applied Mathematics, 69.1-2: 99–122.

    Article  MathSciNet  Google Scholar 

  12. Pixton, D., Splicing in abstract families of languages, ms. in preparation.

    Google Scholar 

  13. Prescott, D.M. (1994), The DNA of ciliated protozoa, Microbiological Reviews, 58.2: 233–267.

    Google Scholar 

  14. Salomaa, A. (1973), Formal Languages. Academic Press, New York.

    MATH  Google Scholar 

  15. Siromoney, R.; K.G. Subramanian & V. Rajkumar Dare (1992), Circular DNA and splicing systems, in Parallel Image Analysis: 260–273. Springer, Berlin.

    Chapter  Google Scholar 

  16. Yokomori, T.; S. Kobayashi & C. Ferretti (1997), Circular Splicing Systems and DNA Computability, in Proceedings of the IEEE International Conference on Evolutionary Computation’97: 219-224.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Kari, J., Kari, L. (2001). Context-Free Recombinations. In: Martín-Vide, C., Mitrana, V. (eds) Where Mathematics, Computer Science, Linguistics and Biology Meet. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9634-3_32

Download citation

  • DOI: https://doi.org/10.1007/978-94-015-9634-3_32

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-481-5607-8

  • Online ISBN: 978-94-015-9634-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics