{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:48Z","timestamp":1760202528317},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341611"},{"type":"electronic","value":"9783540341659"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753681_3","type":"book-chapter","created":{"date-parts":[[2006,7,28]],"date-time":"2006-07-28T02:31:54Z","timestamp":1154053914000},"page":"27-37","source":"Crossref","is-referenced-by-count":15,"title":["On Computational Properties of Template-Guided DNA Recombination"],"prefix":"10.1007","author":[{"given":"Mark","family":"Daley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"McQuillan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Head, T.: Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology\u00a049 (1987)","DOI":"10.1016\/S0092-8240(87)90018-8"},{"key":"3_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing : New computing paradigms","author":"G. P\u0103un","year":"1998","unstructured":"P\u0103un, G., Rozenberg, G., Salomaa, A.: DNA Computing: New computing paradigms. Springer, Berlin (1998)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1038\/35042057","volume":"1","author":"D. Prescott","year":"2000","unstructured":"Prescott, D.: Genome gymnastics: Unique modes of DNA evolution and processing in ciliates. Nature Reviews Genetics\u00a01, 191\u2013198 (2000)","journal-title":"Nature Reviews Genetics"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Kari, L., Landweber, L.: Computational power of gene rearrangement. In: Winfree, E., Gifford, D. (eds.) DNA5. DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a054, pp. 207\u2013216. American Mathematical Society (2000)","DOI":"10.1090\/dimacs\/054\/17"},{"key":"3_CR5","first-page":"3","volume-title":"DNA4, BioSystems","author":"L. Landweber","year":"1999","unstructured":"Landweber, L., Kari, L.: The evolution of cellular computing: Nature\u2019s solution to a computational problem. In: Kari, L., Rubin, H., Wood, D. (eds.) DNA4, BioSystems, vol.\u00a052, pp. 3\u201313. Elsevier, Amsterdam (1999)"},{"key":"3_CR6","first-page":"45","volume-title":"Evolution as Computation","author":"A. Ehrenfeucht","year":"2001","unstructured":"Ehrenfeucht, A., Prescott, D., Rozenberg, G.: Computational aspects of gene (un)scrambling in ciliates. In: Landweber, L., Winfree, E. (eds.) Evolution as Computation, pp. 45\u201386. Springer, Heidelberg (2001)"},{"key":"3_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-06371-2","volume-title":"Computation in Living Cells, Gene Assembly in Ciliates","author":"A. Ehrenfeucht","year":"2004","unstructured":"Ehrenfeucht, A., Harju, T., Petre, I., Prescott, D., Rozenberg, G.: Computation in Living Cells, Gene Assembly in Ciliates. Springer, Berlin (2004)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1078\/0932-4739-00807","volume":"37","author":"A. Ehrenfeucht","year":"2001","unstructured":"Ehrenfeucht, A., Prescott, D., Rozenberg, G.: Molecular operations for DNA processing in hypotrichous ciliates. European Journal of Protistology\u00a037, 241\u2013260 (2001)","journal-title":"European Journal of Protistology"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0022-5193(03)00037-7","volume":"222","author":"D. Prescott","year":"2003","unstructured":"Prescott, D., Ehrenfeucht, A., Rozenberg, G.: Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates. Journal of Theoretical Biology\u00a0222, 323\u2013330 (2003)","journal-title":"Journal of Theoretical Biology"},{"key":"3_CR10","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. B.B. Teubner, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"3_CR12","volume-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"S. Ginsburg","year":"1975","unstructured":"Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland Publishing Company, Amsterdam (1975)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.tcs.2004.06.028","volume":"330","author":"M. Daley","year":"2005","unstructured":"Daley, M., McQuillan, I.: Template-guided DNA recombination. Theoretical Computer Science\u00a0330, 237\u2013250 (2005)","journal-title":"Theoretical Computer Science"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Daley, M., McQuillan, I.: Useful templates and template-guided DNA recombination. Theory of Computing Systems (to appear)","DOI":"10.1007\/s00224-005-1206-6"},{"key":"3_CR15","unstructured":"Doak, T.: Personal communication"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"3298","DOI":"10.1073\/pnas.97.7.3298","volume":"97","author":"L. Landweber","year":"2000","unstructured":"Landweber, L., Kuo, T., Curtis, E.: Evolution and assembly of an extremely scrambled gene. PNAS\u00a097, 3298\u20133303 (2000)","journal-title":"PNAS"},{"key":"3_CR17","first-page":"27","volume":"1","author":"G. P\u0103un","year":"1996","unstructured":"P\u0103un, G.: Regular extended H systems are computationally universal. Journal of Automata, Languages and Combinatorics\u00a01, 27\u201336 (1996)","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753681_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T05:17:33Z","timestamp":1555737453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753681_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341611","9783540341659"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11753681_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}