{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:29:26Z","timestamp":1760131766070},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540645702"},{"type":"electronic","value":"9783540693536"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028006","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:02:06Z","timestamp":1132642926000},"page":"35-55","source":"Crossref","is-referenced-by-count":2,"title":["Evolution as a computational engine"],"prefix":"10.1007","author":[{"given":"Rolf","family":"Backofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Clote","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021\u20131024, 1994.","journal-title":"Science"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora, Y. Rabani, and U. Vazirani. Simulating quadratic dynamical systems is PSPACE-complete (preliminary version). In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 459\u2013467, 1994.","DOI":"10.1145\/195058.195231"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"C.H. Bennett","year":"1989","unstructured":"C.H. Bennett. Time\/space trade-offs for reversible computation. SIAM Journal on Computing, 18:766\u2013776, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"306","DOI":"10.2307\/3212444","volume":"12","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal and D. Sankoff. Longest common subsequences of two random sequences. Journal of Applied Probability, 12:306\u2013315, 1975.","journal-title":"Journal of Applied Probability"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"J. Dassow and V. Mitrana. Evolutionary grammars: a grammatical model for genome evolution. In Computer Science and Biology, pages pp. 87\u201392, 1996. Proceedings of the German Conference on Bioinformatics (GCB'96).","DOI":"10.1007\/BFb0033218"},{"key":"3_CR6","unstructured":"L. Ilie and V. Mitrana. Crossing-over on languages: A formal representation of the recombination of genes in a chromosome. Technical Report 16, Turku Centre for Computer Science, June 1996."},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/inco.1996.0091","volume":"131","author":"L. Kari","year":"1996","unstructured":"Lila Kari and Gabriel Thierrin. Contextual insertion\/deletions and computability. Information and Computation, 131(1):47\u201361, 1996.","journal-title":"Information and Computation"},{"key":"3_CR8","unstructured":"L.Kari, G.Paun, G.Thierrin, and S.Yu. At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages by insertion-deletion systems. In Proceedings of the 3\nrd\nDIMACS Workshop on DNA-based Computers, pages 318\u2013333, Philadelphia, June 1997."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/BF01091740","volume":"10","author":"S. Y. Maslov","year":"1978","unstructured":"S. Yu. Maslov. The mutation calculi. Journal of Soviet Mathematics, 10:495\u2013517, 1978.","journal-title":"Journal of Soviet Mathematics"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1468","DOI":"10.1007\/BF01693979","volume":"14","author":"S. Y. Maslov","year":"1980","unstructured":"S. Yu. Maslov. Absorption relation on regular sets. Journal of Soviet Mathematics, 14:1468\u20131475, 1980.","journal-title":"Journal of Soviet Mathematics"},{"key":"3_CR11","volume-title":"Theory of Deductive Systems and its Applications","author":"S. Y. Maslov","year":"1987","unstructured":"S. Yu. Maslov. Theory of Deductive Systems and its Applications. MIT Press (Cambridge), 1987."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"G. Paun and A. Salomaa. From DNA recombination to DNA computing, via formal languages. In Computer Science and Biology, pages pp. 93\u201398, 1996. Proceedings of the German Conference on Bioinformatics (GCB'96).","DOI":"10.1007\/BFb0033219"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"P. Pudl\u00e1k. Complexity theory and genetics. In Proceedings of 9th Annual IEEE Conference on Structure in Complexity Theory, 1994.","DOI":"10.1109\/SCT.1994.315787"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"M. S. Waterman. Introduction to Computational Biology \u2014 Maps, sequences and genomes. Chapman and Hall, 1995.","DOI":"10.1007\/978-1-4899-6846-3"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T05:16:35Z","timestamp":1549343795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645702","9783540693536"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0028006","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}