Skip to main content
SpringerLink
Log in

DNA Computing by Splicing and by Insertion–Deletion

  • Reference work entry
Handbook of Natural Computing

  • 9840 Accesses

Abstract

This chapter is devoted to two of the most developed theoretical computing models inspired by DNA biochemistry, computing by splicing (a formal operation with strings that models the recombination of DNA molecules under the influence of restriction enzymes and ligase) and by insertion–deletion. Only basic ideas and results are presented, as well as a comprehensive – although not complete – list of titles where further information can be found.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 999.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,199.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

References

  • Bonizzoni P, Mauri G (2005) Regular splicing languages and subclasses. Theor Comput Sci 340:349–363

    Article  MathSciNet  MATH  Google Scholar 

  • Bonizzoni P, Mauri G (2006) A decision procedure for reflexive regular splicing languages. In: Proceedings of the developments in language theory ’06, Santa Barbara, Lecture notes in computer science, vol. 4036. Springer, Berlin, pp 315–326

    Google Scholar 

  • Bonizzoni P, De Felice C, Mauri G, Zizza R (2003) Regular languages generated by reflexive finite splicing systems. In: Proceedings of the developments in language theory ’03, Szeged, Hungary, Lecture notes in computer science, vol. 2710. Springer, Berlin, pp 134–145

    Google Scholar 

  • Bonizzoni P, De Felice C, Mauri G (2005a) Recombinant DNA, gene splicing as generative devices of formal languages. In: Proceedings of the Computability in Europe ’05, Amsterdam, The Netherlands, Lecture notes in computer science, vol. 3536. Springer, Berlin, pp 65–67

    Google Scholar 

  • Bonizzoni P, De Felice C, Zizza R (2005b) The structure of reflexive regular splicing languages via Schützenberger constants. Theor Comput Sci 334:71–98

    Article  MATH  Google Scholar 

  • Cavaliere M, Jonoska N, Leupold P (2006) Computing by observing DNA splicing. Technical Report 11/2006, Microsoft Center for Computational Biology, Trento

    Google Scholar 

  • Ceterchi R, Subramanian KG (2003) Simple circular splicing systems. Romanian J Inform Sci Technol 6:121–134

    Google Scholar 

  • Csuhaj-Varju E, Dassow J, Kelemen J, Păun Gh (1994) Grammar systems. A grammatical approach to distribution and cooperation. Gordon & Breach, London

    MATH  Google Scholar 

  • Culik II K, Harju T (1991) Splicing semigroups of dominoes and DNA. Discrete Appl Math 31:261–277

    Article  MathSciNet  MATH  Google Scholar 

  • Dassen R, Hoogebooom HJ, van Vugt N (2001) A characterization of non-iterated splicing with regular rules. In: Martin-Vide C, Mitrana V (eds) Where mathematics, computer science, linguistics and biology meet. Kluwer, Dordrecht, pp 319–327

    Google Scholar 

  • Dassow J, Păun Gh (1989) Regulated rewriting in formal language theory. Springer, Berlin

    Book  Google Scholar 

  • Dassow J, Vaszil G (2004) Multiset splicing systems. BioSystems 74:1–7

    Article  Google Scholar 

  • De Felice C, Fici G, Zizza R (2007) Marked systems and circular splicing. In: Proceedings of the Fundamentals of Computation theory, Budapest, Hungary, Lecture notes in computer science, vol. 4639. Springer, Berlin, pp 238–249

    Google Scholar 

  • Frisco P (2004) Theory of molecular computing. Splicing and membrane systems. Ph.D. thesis, Leiden University, The Netherlands

    Google Scholar 

  • Galiukschov BS (1981) Semicontextual grammars (in Russian). Mat logica i mat ling, Tallinn Univ 38–50

    Google Scholar 

  • Goode E, Pixton D (2001) Semi-simple splicing systems. In: Martin-Vide C, Mitrana V (eds) Where mathematics, computer science, linguistics and biology meet. Kluwer, Dordrecht, pp 343–352

    Google Scholar 

  • Goode E, Pixton D (2007) Recognizing splicing languages: syntactic monoids and simultaneous pumping. Discrete Appl Math 155:989–1006

    Article  MathSciNet  MATH  Google Scholar 

  • Harju T, Margenstern M (2005) Splicing systems for universal Turing machines. In: Proceedings of the DNA Computing ’04, Milano, Italy, Lecture notes in computer science, vol. 3384. Springer, Berlin, pp 149–158

    Google Scholar 

  • Harrison M (1978) Introduction to formal language theory. Addison-Wesley, Reading, MA

    MATH  Google Scholar 

  • Head T (1987) Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull Math Biol 49:737–759

    MathSciNet  MATH  Google Scholar 

  • Head T, Păun Gh, Pixton D (1997) Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol. 2. Springer, Berlin, pp 295–360

    Google Scholar 

  • Hemalatha S (2007) A study on rewriting P systems, splicing grammar systems and picture array languages. Ph.D. thesis, Anna University, Chennai, India

    Google Scholar 

  • Jonoska N, Păun Gh, Rozenberg G (eds) (2004) Aspects of molecular computing. Essays dedicated to Tom Head on the occasion of his 70th birthday, Lecture notes in computer science, vol. 2950. Springer, Berlin

    Google Scholar 

  • Kari L (1991) On insertion and deletion in formal languages. Ph.D. thesis, University of Turku

    Google Scholar 

  • Kari L, Sosik P (2008) On the weight of universal insertion grammars. Theor Comput Sci 396:264–270

    Article  MathSciNet  MATH  Google Scholar 

  • Krassovitskiy A, Rogozhin Y, Verlan S (2007) Further results on insertion-deletion systems with one-sided contexts. Proceedings of the LATA 2007, Tarragona, Spain, Technical Rep. RGML, 36/2008, pp 347–358

    Google Scholar 

  • Krassovitskiy A, Rogozhin Y, Verlan S (2008) One-sided insertion and deletion: traditional and P systems case. In: Csuhaj-Varju et al. (eds) International workshop on computing with biomolecules. Vienna, Austria, pp 51–63

    Google Scholar 

  • Loos R (2006) An alternative definition of splicing. Theor Comput Sci 358:75–87

    Article  MathSciNet  MATH  Google Scholar 

  • Loos R, Ogihara M (2007) Complexity theory of splicing systems. Theor Comput Sci 386:132–150

    Article  MathSciNet  MATH  Google Scholar 

  • Loos R, Malcher A, Wotschke D (2008) Descriptional complexity of splicing systems. Int J Found Comput Sci 19:813–826

    Article  MathSciNet  MATH  Google Scholar 

  • Manca V (2000) Splicing normalization and regularity. In: Calude CS, Păun Gh (eds) Finite versus infinite. Contributions to an eternal dilemma, Springer, Berlin, pp 199–215

    Chapter  Google Scholar 

  • Marcus S (1969) Contextual grammars. Rev Roum Math Pures Appl 14:1525–1534

    MATH  Google Scholar 

  • Margenstern M, Rogozhin Y, Verlan S (2002) Time-varying distributed H systems of degree 2 can carry out parallel computations. In: Proceedings of the DNA computing ’02, Sapporo, Japan, Lecture notes in computer science, vol. 2568. Springer, Berlin, pp 326–336

    Google Scholar 

  • Margenstern M, Rogozhin Y, Verlan S (2004) Time-varying distributed H systems with parallel computations: the problem is solved. In: Proceedings of the DNA Computing ’04, Madison, Wisconsin, Lecture notes in computer science, vol. 2943. Springer, Berlin, pp 48–53

    Google Scholar 

  • Margenstern M, Păun Gh, Rogozhin Y, Verlan S (2005) Context-free insertion-deletion systems. Theor Comput Sci 330:339–348

    Article  MATH  Google Scholar 

  • Mateescu A, Păun Gh, Rozenberg G, Salomaa A (1998) Simple splicing systems. Discrete Appl Math 84:145–163

    Article  MathSciNet  MATH  Google Scholar 

  • Matveevici A, Rogozhin Y, Verlan S (2007) Insertion-deletion systems with one-sided contexts. In: Proceedings of the machines, computations, and universality ’07, Orleans, France, LNCS 4664, Springer, 2007, 205–217

    Google Scholar 

  • Păun Gh (1996a) On the splicing operation. Discrete Appl Math 70:57–79

    Article  MathSciNet  MATH  Google Scholar 

  • Păun Gh (1996b) Regular extended H systems are computationally universal. J Auto Lang Comb 1:27–36

    MATH  Google Scholar 

  • Păun Gh (1997) Marcus contextual grammars. Kluwer, Boston, MA

    MATH  Google Scholar 

  • Păun A (2003) Unconventional models of computation: DNA and membrane computing. Ph.D. thesis, University of Western Ontario, Canada

    Google Scholar 

  • Păun Gh, Rozenberg G, Salomaa A (1996) Computing by splicing. Theor Comput Sci 168:321–336

    Article  MATH  Google Scholar 

  • Păun Gh, Rozenberg G, Salomaa A (1998) DNA computing. New computing paradigms. Springer, Berlin

    MATH  Google Scholar 

  • Păun Gh, Pérez-Jiménez MJ, Yokomori T (2008) Representations and characterizations of languages in Chomsky hierarchy by means of insertion-deletion systems. Int J Found Comput Sci 19:859–871

    Article  MATH  Google Scholar 

  • Păun Gh, Rozenberg G, Salomaa A (eds) (2009) Handbook of membrane computing. Oxford University Press, Oxford, UK

    Google Scholar 

  • Penttonen M (1974) One-sided and two-sided contexts in phrase structure grammars. Inform Control 25:371–392

    Article  MathSciNet  MATH  Google Scholar 

  • Pixton D (1996) Regularity of splicing languages. Discrete Appl Math 69:101–124

    Article  MathSciNet  MATH  Google Scholar 

  • Pixton D (2000) Splicing in abstract families of languages. Theor Comput Sci 234:135–166

    Article  MathSciNet  MATH  Google Scholar 

  • Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, 3 vol. Springer, Berlin

    MATH  Google Scholar 

  • Salomaa A (1973) Formal languages. Academic, New York

    MATH  Google Scholar 

  • Tanaka A, Yokomori T (2003) On the computational power of insertion-deletion systems. In: Proceedings of the DNA Computing ’02, Sapporo, Japan, Lecture notes in computer science, vol. 2568. Springer, Berlin, pp 269–280

    Google Scholar 

  • Thomas DG, Begam MH, David NG (2007) Hexagonal array splicing systems. Ramanujan Math Soc Lect Notes Ser 3:197–207

    MathSciNet  Google Scholar 

  • Verlan S (2007) On minimal context-free insertion-deletion systems. J Auto Lang Comb 12:317–328

    MathSciNet  MATH  Google Scholar 

  • Verlan S, Zizza R (2003) 1-splicing vs. 2-splicing: separating results. In: Harju T, Karhumaki J (eds) Proceedings of the WORDS’03, TUCS General Publisher, 27, pp 320–331

    Google Scholar 

  • Zizza R (2002) On the power of classes of splicing systems. Ph.D. thesis, University of Milano-Bicocca

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics of the Romanian Academy, Bucharest, Romania

    Gheorghe Păun

  2. Department of Computer Science and Artificial Intelligence, University of Seville, Seville, Spain

    Gheorghe Păun

Authors
  1. Gheorghe Păun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIACS, Leiden University, Leiden, The Netherlands

    Grzegorz Rozenberg

  2. Computer Science Department, University of Colorado, Boulder, USA

    Grzegorz Rozenberg

  3. LIACS, Leiden University, Leiden, The Netherlands

    Thomas Bäck

  4. LIACS, Leiden University, Leiden, The Netherlands

    Joost N. Kok

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this entry

Cite this entry

Păun, G. (2012). DNA Computing by Splicing and by Insertion–Deletion. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds) Handbook of Natural Computing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92910-9_35

Download citation

Publish with us

Policies and ethics

Search

Navigation