{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T09:48:49Z","timestamp":1791971329776,"version":"4.3.4"},"publisher-location":"Berlin, Heidelberg","reference-count":55,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540929093","type":"print"},{"value":"9783540929109","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-540-92910-9_35","type":"book-chapter","created":{"date-parts":[[2012,8,25]],"date-time":"2012-08-25T10:54:06Z","timestamp":1345892046000},"page":"1185-1202","source":"Crossref","is-referenced-by-count":0,"title":["DNA Computing by Splicing and by Insertion\u2013Deletion"],"prefix":"10.1007","author":[{"given":"Gheorghe","family":"P\u0103un","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"35_CR00354","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.tcs.2005.03.035","volume":"340","author":"P Bonizzoni","year":"2005","unstructured":"Bonizzoni P, Mauri G (2005) Regular splicing languages and subclasses. Theor Comput Sci 340:349\u2013363","journal-title":"Theor Comput Sci"},{"key":"35_CR00355","doi-asserted-by":"crossref","unstructured":"Bonizzoni P, Mauri G (2006) A decision procedure for reflexive regular splicing languages. In: Proceedings of the developments in language theory \u201906, Santa Barbara, Lecture notes in computer science, vol. 4036. Springer, Berlin, pp 315\u2013326","DOI":"10.1007\/11779148_29"},{"key":"35_CR00352","doi-asserted-by":"crossref","unstructured":"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 \u201903, Szeged, Hungary, Lecture notes in computer science, vol. 2710. Springer, Berlin, pp 134\u2013145","DOI":"10.1007\/3-540-45007-6_10"},{"key":"35_CR00351","doi-asserted-by":"crossref","unstructured":"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 \u201905, Amsterdam, The Netherlands, Lecture notes in computer science, vol. 3536. Springer, Berlin, pp 65\u201367","DOI":"10.1007\/11494645_8"},{"key":"35_CR00353","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2004.12.033","volume":"334","author":"P Bonizzoni","year":"2005","unstructured":"Bonizzoni P, De Felice C, Zizza R (2005b) The structure of reflexive regular splicing languages via Sch\u00fctzenberger constants. Theor Comput Sci 334:71\u201398","journal-title":"Theor Comput Sci"},{"key":"35_CR00356","doi-asserted-by":"crossref","unstructured":"Cavaliere M, Jonoska N, Leupold P (2006) Computing by observing DNA splicing. Technical Report 11\/2006, Microsoft Center for Computational Biology, Trento","DOI":"10.1007\/11753681_2"},{"key":"35_CR00357","first-page":"121","volume":"6","author":"R Ceterchi","year":"2003","unstructured":"Ceterchi R, Subramanian KG (2003) Simple circular splicing systems. Romanian J Inform Sci Technol 6:121\u2013134","journal-title":"Romanian J Inform Sci Technol"},{"key":"35_CR00358","volume-title":"Grammar systems. A grammatical approach to distribution and cooperation","author":"E Csuhaj-Varju","year":"1994","unstructured":"Csuhaj-Varju E, Dassow J, Kelemen J, P\u0103un Gh (1994) Grammar systems. A grammatical approach to distribution and cooperation. Gordon & Breach, London"},{"key":"35_CR00359","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","volume":"31","author":"K Culik II","year":"1991","unstructured":"Culik II K, Harju T (1991) Splicing semigroups of dominoes and DNA. Discrete Appl Math 31:261\u2013277","journal-title":"Discrete Appl Math"},{"key":"35_CR003510","doi-asserted-by":"crossref","unstructured":"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\u2013327","DOI":"10.1007\/978-94-015-9634-3_28"},{"key":"35_CR003511","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated rewriting in formal language theory","author":"J Dassow","year":"1989","unstructured":"Dassow J, P\u0103un Gh (1989) Regulated rewriting in formal language theory. Springer, Berlin"},{"key":"35_CR003512","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.biosystems.2003.12.005","volume":"74","author":"J Dassow","year":"2004","unstructured":"Dassow J, Vaszil G (2004) Multiset splicing systems. BioSystems 74:1\u20137","journal-title":"BioSystems"},{"key":"35_CR003513","doi-asserted-by":"crossref","unstructured":"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\u2013249","DOI":"10.1007\/978-3-540-74240-1_21"},{"key":"35_CR003514","volume-title":"Theory of molecular computing. Splicing and membrane systems","year":"2004","unstructured":"Frisco P (2004) Theory of molecular computing. Splicing and membrane systems. Ph.D. thesis, Leiden University, The Netherlands"},{"key":"35_CR003515","unstructured":"Galiukschov BS (1981) Semicontextual grammars (in Russian). Mat logica i mat ling, Tallinn Univ 38\u201350"},{"key":"35_CR003516","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-94-015-9634-3_30","volume-title":"Where mathematics, computer science, linguistics and biology meet","author":"E Goode","year":"2001","unstructured":"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\u2013352"},{"key":"35_CR003517","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1016\/j.dam.2006.10.006","volume":"155","author":"E Goode","year":"2007","unstructured":"Goode E, Pixton D (2007) Recognizing splicing languages: syntactic monoids and simultaneous pumping. Discrete Appl Math 155:989\u20131006","journal-title":"Discrete Appl Math"},{"key":"35_CR003518","doi-asserted-by":"crossref","unstructured":"Harju T, Margenstern M (2005) Splicing systems for universal Turing machines. In: Proceedings of the DNA Computing \u201904, Milano, Italy, Lecture notes in computer science, vol. 3384. Springer, Berlin, pp 149\u2013158","DOI":"10.1007\/11493785_13"},{"key":"35_CR003519","volume-title":"Introduction to formal language theory","author":"M Harrison","year":"1978","unstructured":"Harrison M (1978) Introduction to formal language theory. Addison-Wesley, Reading, MA"},{"key":"35_CR003520","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/S0092-8240(87)90018-8","volume":"49","author":"T Head","year":"1987","unstructured":"Head T (1987) Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull Math Biol 49:737\u2013759","journal-title":"Bull Math Biol"},{"key":"35_CR003521","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-3-662-07675-0_7","volume-title":"Handbook of formal languages","author":"T Head","year":"1997","unstructured":"Head T, P\u0103un 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\u2013360"},{"key":"35_CR003522","volume-title":"A study on rewriting P systems, splicing grammar systems and picture array languages","author":"s Hemalatha","year":"2007","unstructured":"Hemalatha S (2007) A study on rewriting P systems, splicing grammar systems and picture array languages. Ph.D. thesis, Anna University, Chennai, India"},{"key":"35_CR003523","volume-title":"Aspects of molecular computing. Essays dedicated to Tom Head on the occasion of his 70th birthday, Lecture nots in computer science","year":"2004","unstructured":"Jonoska N, P\u0103un 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"},{"key":"35_CR003524","unstructured":"Kari L (1991) On insertion and deletion in formal languages. Ph.D. thesis, University of Turku"},{"key":"35_CR003525","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.tcs.2008.01.037","volume":"396","author":"L Kari","year":"2008","unstructured":"Kari L, Sosik P (2008) On the weight of universal insertion grammars. Theor Comput Sci 396:264\u2013270","journal-title":"Theor Comput Sci"},{"key":"35_CR003526","unstructured":"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\u2013358"},{"key":"35_CR003527","unstructured":"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\u201363"},{"key":"35_CR003528","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2006.03.002","volume":"358","author":"R Loos","year":"2006","unstructured":"Loos R (2006) An alternative definition of splicing. Theor Comput Sci 358:75\u201387","journal-title":"Theor Comput Sci"},{"key":"35_CR003530","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.tcs.2007.06.010","volume":"386","author":"R Loos","year":"2007","unstructured":"Loos R, Ogihara M (2007) Complexity theory of splicing systems. Theor Comput Sci 386:132\u2013150","journal-title":"Theor Comput Sci"},{"key":"35_CR003529","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1142\/S0129054108005978","volume":"19","author":"R Loos","year":"2008","unstructured":"Loos R, Malcher A, Wotschke D (2008) Descriptional complexity of splicing systems. Int J Found Comput Sci 19:813\u2013826","journal-title":"Int J Found Comput Sci"},{"key":"35_CR003531","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-1-4471-0751-4_13","volume-title":"Finite versus infinite","author":"V Manca","year":"2000","unstructured":"Manca V (2000) Splicing normalization and regularity. In: Calude CS, P\u0103un Gh (eds) Finite versus infinite. Contributions to an eternal dilemma, Springer, Berlin, pp 199\u2013215"},{"key":"35_CR003532","first-page":"1525","volume":"14","author":"S Marcus","year":"1969","unstructured":"Marcus S (1969) Contextual grammars. Rev Roum Math Pures Appl 14:1525\u20131534","journal-title":"Rev Roum Math Pures Appl"},{"key":"35_CR003534","doi-asserted-by":"crossref","unstructured":"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 \u201902, Sapporo, Japan, Lecture notes in computer science, vol. 2568. Springer, Berlin, pp 326\u2013336","DOI":"10.1007\/3-540-36440-4_29"},{"key":"35_CR003535","doi-asserted-by":"crossref","unstructured":"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 \u201904, Madison, Wisconsin, Lecture notes in computer science, vol. 2943. Springer, Berlin, pp 48\u201353","DOI":"10.1007\/978-3-540-24628-2_6"},{"key":"35_CR003533","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.tcs.2004.06.031","volume":"330","author":"M Margenstern","year":"2005","unstructured":"Margenstern M, P\u0103un Gh, Rogozhin Y, Verlan S (2005) Context-free insertion-deletion systems. Theor Comput Sci 330:339\u2013348","journal-title":"Theor Comput Sci"},{"key":"35_CR003536","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0166-218X(98)00002-X","volume":"84","author":"A Mateescu","year":"1998","unstructured":"Mateescu A, P\u0103un Gh, Rozenberg G, Salomaa A (1998) Simple splicing systems. Discrete Appl Math 84:145\u2013163","journal-title":"Discrete Appl Math"},{"key":"35_CR003537","doi-asserted-by":"crossref","unstructured":"Matveevici A, Rogozhin Y, Verlan S (2007) Insertion-deletion systems with one-sided contexts. In: Proceedings of the machines, computations, and universality \u201907, Orleans, France, LNCS 4664, Springer, 2007, 205\u2013217","DOI":"10.1007\/978-3-540-74593-8_18"},{"key":"35_CR003539","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(96)00101-1","volume":"70","author":"Gh P\u0103un","year":"1996","unstructured":"P\u0103un Gh (1996a) On the splicing operation. Discrete Appl Math 70:57\u201379","journal-title":"Discrete Appl Math"},{"key":"35_CR003540","first-page":"27","volume":"1","author":"Gh P\u0103un","year":"1996","unstructured":"P\u0103un Gh (1996b) Regular extended H systems are computationally universal. J Auto Lang Comb 1:27\u201336","journal-title":"J Auto Lang Comb"},{"key":"35_CR003541","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-8969-7","volume-title":"Marcus contextual grammars","author":"Gh P\u0103un","year":"1997","unstructured":"P\u0103un Gh (1997) Marcus contextual grammars. Kluwer, Boston, MA"},{"key":"35_CR003538","volume-title":"Unconventional models of computation: DNA and membrane computing","author":"A P\u0103un","year":"2003","unstructured":"P\u0103un A (2003) Unconventional models of computation: DNA and membrane computing. Ph.D. thesis, University of Western Ontario, Canada"},{"key":"35_CR003543","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0304-3975(96)00082-5","volume":"168","author":"Gh P\u0103un","year":"1996","unstructured":"P\u0103un Gh, Rozenberg G, Salomaa A (1996) Computing by splicing. Theor Comput Sci 168:321\u2013336","journal-title":"Theor Comput Sci"},{"key":"35_CR003544","volume-title":"DNA computing. New computing paradigms","author":"Gh P\u0103un","year":"1998","unstructured":"P\u0103un Gh, Rozenberg G, Salomaa A (1998) DNA computing. New computing paradigms. Springer, Berlin"},{"key":"35_CR003542","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1142\/S0129054108006005","volume":"19","author":"Gh P\u0103un","year":"2008","unstructured":"P\u0103un Gh, P\u00e9rez-Jim\u00e9nez 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\u2013871","journal-title":"Int J Found Comput Sci"},{"key":"35_CR003545","volume-title":"Handbook of membrane computing","year":"2009","unstructured":"P\u0103un Gh, Rozenberg G, Salomaa A (eds) (2009) Handbook of membrane computing. Oxford University Press, Oxford, UK"},{"key":"35_CR003546","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0019-9958(74)91049-3","volume":"25","author":"M Penttonen","year":"1974","unstructured":"Penttonen M (1974) One-sided and two-sided contexts in phrase structure grammars. Inform Control 25:371\u2013392","journal-title":"Inform Control"},{"key":"35_CR003547","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0166-218X(95)00079-7","volume":"69","author":"D Pixton","year":"1996","unstructured":"Pixton D (1996) Regularity of splicing languages. Discrete Appl Math 69:101\u2013124","journal-title":"Discrete Appl Math"},{"key":"35_CR003548","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00046-2","volume":"234","author":"D Pixton","year":"2000","unstructured":"Pixton D (2000) Splicing in abstract families of languages. Theor Comput Sci 234:135\u2013166","journal-title":"Theor Comput Sci"},{"key":"35_CR003549","volume-title":"Handbook of formal languages","year":"1997","unstructured":"Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, 3 vol. Springer, Berlin"},{"key":"35_CR003550","volume-title":"Formal Languages","author":"A Salomaa","year":"1973","unstructured":"Salomaa A (1973) Formal languages. Academic, New York"},{"key":"35_CR003551","doi-asserted-by":"crossref","unstructured":"Tanaka A, Yokomori T (2003) On the computational power of insertion-deletion systems. In: Proceedings of the DNA Computing \u201902, Sapporo, Japan, Lecture notes in computer science, vol. 2568. Springer, Berlin, pp 269\u2013280","DOI":"10.1007\/3-540-36440-4_24"},{"key":"35_CR003552","first-page":"197","volume":"3","author":"DG Thomas","year":"2007","unstructured":"Thomas DG, Begam MH, David NG (2007) Hexagonal array splicing systems. Ramanujan Math Soc Lect Notes Ser 3:197\u2013207","journal-title":"Ramanujan Math Soc Lect Notes Ser"},{"key":"35_CR003553","first-page":"317","volume":"12","author":"S Verlan","year":"2007","unstructured":"Verlan S (2007) On minimal context-free insertion-deletion systems. J Auto Lang Comb 12:317\u2013328","journal-title":"J Auto Lang Comb"},{"key":"35_CR003554","unstructured":"Verlan S, Zizza R (2003) 1-splicing vs. 2-splicing: separating results. In: Harju T, Karhumaki J (eds) Proceedings of the WORDS\u201903, TUCS General Publisher, 27, pp 320\u2013331"},{"key":"35_CR003555","unstructured":"Zizza R (2002) On the power of classes of splicing systems. Ph.D. thesis, University of Milano-Bicocca"}],"container-title":["Handbook of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92910-9_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,14]],"date-time":"2026-10-14T09:00:16Z","timestamp":1791968416000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-92910-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783540929093","9783540929109"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92910-9_35","relation":{},"subject":[],"published":{"date-parts":[[2012]]}}}