{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:34:06Z","timestamp":1725456846189},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633709"},{"type":"electronic","value":"9783540695240"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0033219","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:00:47Z","timestamp":1133416847000},"page":"210-220","source":"Crossref","is-referenced-by-count":2,"title":["From DNA recombination to DNA computing via formal languages"],"prefix":"10.1007","author":[{"given":"Gheorghe","family":"P\u0103un","sequence":"first","affiliation":[]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,18]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"226","author":"L. M. Adleman","year":"1994","unstructured":"L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science, 226 (Nov. 1994), 1021\u20131024.","journal-title":"Science"},{"key":"21_CR2","volume-title":"Grammar Systems. A Grammatical Approach to Distribution and Cooperation","author":"E. Csuhaj-Varju","year":"1994","unstructured":"E. Csuhaj-Varju, J. Dassow, J. Kelemen, Gh. P\u0103un, Grammar Systems. A Grammatical Approach to Distribution and Cooperation, Gordon and Breach, London, 1994."},{"issue":"2-3","key":"21_CR3","first-page":"211","volume":"15","author":"E. Csuhaj-Varju","year":"1996","unstructured":"E. Csuhaj-Varju, L. Kari, Gh. P\u00e4un, Test tube distributed systems based on splicing, Computers and AI, 15, 2-3 (1996), 211\u2013232.","journal-title":"Computers and AI"},{"issue":"5","key":"21_CR4","first-page":"419","volume":"15","author":"E. Csuhaj-Varju","year":"1996","unstructured":"E. Csuhaj-Varju, J. Kelemen, Gh. P\u0103un, Grammar systems with WAVE-like communication, Computers and AI, 15, 5 (1996), 419\u2013436.","journal-title":"Computers and AI"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","volume":"31","author":"K. Culik II","year":"1991","unstructured":"K. Culik II, T. Harju, Splicing semigroups of dominoes and DNA, Discrete Appl. Math., 31 (1991), 261\u2013277.","journal-title":"Discrete Appl. Math."},{"issue":"2-3","key":"21_CR6","first-page":"109","volume":"15","author":"J. Dassow","year":"1996","unstructured":"J. Dassow, V. Mitrana, Splicing grammar systems, Computers and AI, 15, 2-3, (1996), 109\u2013122.","journal-title":"Computers and AI"},{"key":"21_CR7","unstructured":"R. Freund, L. Kari, Gh. P\u0103un, DNA computing based on splicing: The existence of universal computers, Technical Report 185-2\/FR-2\/95, TU Wien, 1995."},{"key":"21_CR8","unstructured":"R. Freund, Gh. P\u0103un, G. Rozenberg, Bidirectional sticker systems, submitted, 1996."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/S0092-8240(87)90018-8","volume":"49","author":"T. Head","year":"1987","unstructured":"T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology, 49 (1987), 737\u2013759.","journal-title":"Bull. Math. Biology"},{"key":"21_CR10","volume-title":"Handbook of Formal Languages","author":"T. Head","year":"1996","unstructured":"T. Head, Gh. P\u0103un, D. Pixton, Language theory and molecular genetics. Generative mechanisms suggested by DNA recombination, in Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Springer-Verlag, Berlin, Heidelberg, 1996."},{"key":"21_CR11","unstructured":"L. Kari, Gh. P\u0103un, G. Rozenberg, A. Salomaa, S. Yu, DNA computing, sticker systems, and universality, submitted, 1996."},{"key":"21_CR12","unstructured":"L. Kasi, Gh. P\u0103un, G. Thierrin, S. Yu, Characterizing RE using insertion-deletion systems, submitted, 1996."},{"key":"21_CR13","unstructured":"C. Martin-Vide, Gh. P\u0103un, A. Salomaa, Characterizations of recursively enumerable languages by means of insertion grammars, submitted, 1996."},{"key":"21_CR14","first-page":"183","volume":"57","author":"G. P\u0103un","year":"1995","unstructured":"Gh. P\u0103un, Splicing. A challenge to formal language theorists, Bulletin EATCS, 57 (1995), 183\u2013194.","journal-title":"Bulletin EATCS"},{"issue":"1","key":"21_CR15","first-page":"93","volume":"45","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, On the power of splicing grammar systems, Ann. Univ. Buc., Matem.Inform. Series, 45, 1 (1996), 93\u2013106.","journal-title":"Ann. Univ. Buc., Matem.Inform. Series"},{"issue":"1","key":"21_CR16","first-page":"27","volume":"1","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, Regular extended H systems are computationally universal, J. Aut., Languages, Combinatorics, 1, 1 (1996), 27\u201336.","journal-title":"J. Aut., Languages, Combinatorics"},{"key":"21_CR17","unstructured":"Gh. P\u0103un, Universal DNA computing models based on the splicing operation, Second Annual Meeting on DNA Based Computers, Princeton, 1996, 67\u201386."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0020-0190(96)00097-X","volume":"59","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, Splicing systems with targets are computationally universal, Inform. Processing Letters, 59 (1996), 129\u2013133.","journal-title":"Inform. Processing Letters"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(96)00101-1","volume":"70","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, On the splicing operation, Discrete Applied Math., 70 (1996), 57\u201379.","journal-title":"Discrete Applied Math."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Gh. P\u0103un, Contextual Grammars. From, Natural Languages to Formal Languages and Back, forthcoming (1997).","DOI":"10.1007\/978-94-015-8969-7"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Gh. P\u0103un, G. Rozenberg, Sticker systems, submitted, 1997.","DOI":"10.1007\/978-3-662-03563-4_5"},{"issue":"2","key":"21_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0304-3975(96)00082-5","volume":"168","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, G. Rozenberg, A. Salomaa, Computing by splicing, Theor. Computer Sci., 168, 2 (1996), 321\u2013336.","journal-title":"Theor. Computer Sci."},{"issue":"3","key":"21_CR23","first-page":"607","volume":"43","author":"G. P\u0103un","year":"1996","unstructured":"Gh. P\u0103un, A. Salomaa, DNA computing based on the splicing operation, Mathematica Japonica, 43, 3 (1996), 607\u2013632.","journal-title":"Mathematica Japonica"},{"key":"21_CR24","first-page":"55","volume":"38","author":"G. P\u0103un","year":"1989","unstructured":"Gh. P\u0103un, L. S\u0103ntean (now Kari), Parallel communicating grammar systems: the regular case, Ann. Univ. Buc., Matem.-Inform. Series, 38 (1989), 55\u201363.","journal-title":"Ann. Univ. Buc., Matem.-Inform. Series"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0166-218X(95)00079-7","volume":"69","author":"D. Pixton","year":"1996","unstructured":"D. Pixton, Regularity of splicing languages, Discrete Appl. Math., 69 (1996), 101\u2013124.","journal-title":"Discrete Appl. Math."},{"key":"21_CR26","volume-title":"Jewels of Formal Language Theory","author":"A. Salomaa","year":"1981","unstructured":"A. Salomaa, Jewels of Formal Language Theory, Computer Science Press, Rockwille, Maryland, 1981."},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"W. Smith, A., Schweitzer, DNA computers in vitro and in vivo, manuscript in circulation, March 1995.","DOI":"10.1090\/dimacs\/027\/07"},{"key":"21_CR28","first-page":"319","volume-title":"Control, Cooperation, Combinatorics. New Trends in Formal Languages","author":"C. Zandrou","year":"1997","unstructured":"Cl. Zandrou, Cl Ferretti, G. Mauri, A reduced distributed splicing system for RE languages, in Control, Cooperation, Combinatorics. New Trends in Formal Languages (Gh. P\u0103un, A. Salomaa, eds.), Springer-Verlag, Heidelberg, 1997, 319\u2013329."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0033219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:19:18Z","timestamp":1586593158000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0033219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540633709","9783540695240"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0033219","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}