{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T19:29:12Z","timestamp":1773084552307,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540615507","type":"print"},{"value":"9783540705970","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61550-4_138","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:54:53Z","timestamp":1330293293000},"page":"18-36","source":"Crossref","is-referenced-by-count":3,"title":["Models of DNA computation"],"prefix":"10.1007","author":[{"given":"Alan","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martyn","family":"Amos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hodgson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Leonard Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021\u20131024, 1994.","journal-title":"Science"},{"key":"3_CR2","volume-title":"Research Report CS-RR-298","author":"M. Amos","year":"1996","unstructured":"Martyn Amos, Alan Gibbons, and David Hodgson. Error-resistant implementation of DNA computations. Research Report CS-RR-298, Department of Computer Science, University of Warwick, Coventry, UK, January 1996."},{"key":"3_CR3","unstructured":"Eric Bach, Anne Condon, Elton Glaser, and Celena Tanguay. DNA models and algorithms for NP-complete problems. Submitted, March 1996."},{"key":"3_CR4","unstructured":"Eric B. Baum and Dan Boneh. Running dynamic programming algorithms on a DNA computer. Unpublished manuscript, February 1996."},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1007\/BF02084158","volume":"21","author":"C. H. Bennett","year":"1982","unstructured":"C. H. Bennett. The thermodynamics of computation \u2014 a review. International Journal of Theoretical Physics, 21:905\u2013940, 1982.","journal-title":"International Journal of Theoretical Physics"},{"key":"3_CR6","unstructured":"New England Biolabs. Catalog, 1996."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"T.A. Brown. Genetics: A molecular approach. Chapman and Hall, 1993.","DOI":"10.1007\/978-94-011-2312-9"},{"key":"3_CR8","unstructured":"James D. Watson et. al. Recombinant DNA. Scientific American Books, 1992."},{"key":"3_CR9","unstructured":"Richard P. Feynman. There's plenty of room at the bottom. In D. Gilbert, editor, Miniaturization, pages 282\u2013296. Reinhold, 1961."},{"key":"3_CR10","unstructured":"Rudolf Freund, Lila Kari, and Gheorghe Paun. DNA computation based on splicing: The existence of universal computers. Submitted."},{"key":"3_CR11","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"3_CR12","unstructured":"A. M. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1126\/science.7973681","volume":"266","author":"D. K. Gifford","year":"1994","unstructured":"David K. Gifford. On the path to computation with DNA. Science, 266:993\u2013994, 1994.","journal-title":"Science"},{"key":"3_CR14","first-page":"136","volume":"55","author":"J. Hartmanis","year":"1995","unstructured":"Juris Hartmanis. On the weight of computations. Bulletin of the European Association For Theoretical Computer Science, 55:136\u2013138, 1995.","journal-title":"Bulletin of the European Association For Theoretical Computer Science"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"Tom Head. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology, 49:737\u2013759, 1987.","journal-title":"Bulletin of Mathematical Biology"},{"key":"3_CR16","unstructured":"Peter Kaplan, Guillermo Cecchi, and Albert Libchaber. Molecular computation: Adleman's experiment repeated. Technical report, NEC Research Institute, 1995."},{"key":"3_CR17","unstructured":"Richard M. Karp, Claire Kenyon, and Orli Waarts. Error-resilient DNA computation. In 7th ACM-SIAM Symposium on Discrete Algorithms, pages 458\u2013467. SIAM, 1996."},{"key":"3_CR18","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R. J. Lipton","year":"1995","unstructured":"Richard J. Lipton. DNA solution of hard computational problems. Science, 268:542\u2013545, 1995.","journal-title":"Science"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1038\/scientificamerican0490-56","volume":"262","author":"K. B. Mullis","year":"1990","unstructured":"Kary B. Mullis. The unusual origin of the polymerase chain reaction. Scientific American, 262:36\u201343, 1990.","journal-title":"Scientific American"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Kary B. Mullis, Fran\u00e7ois Ferr\u00e9, and Richard A. Gibbs, editors. The polymerase chain reaction. Birkhauser, 1994.","DOI":"10.1007\/978-1-4612-0257-8"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1126\/science.7725093","volume":"268","author":"R. Pool","year":"1995","unstructured":"Robert Pool. A boom in plans for DNA computing. Science. 268:498\u2013499, 1995.","journal-title":"Science"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"John H. Reif. Parallel molecular computation: Models and simulations. In Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Santa Barbara, June 1995.","DOI":"10.1145\/215399.215446"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Paul W. K. Rothemund. A DNA and restriction enzyme implementation of Turing Machines. Unpublished manuscript, 1995.","DOI":"10.1090\/dimacs\/027\/06"},{"key":"3_CR24","unstructured":"J. Williams, A. Ceccarelli, and N. Spurr. Genetic Engineering. \u03b2ios Scientific Publishers, 1993."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61550-4_138.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T10:44:40Z","timestamp":1640947480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61550-4_138"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615507","9783540705970"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-61550-4_138","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}