{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:33:38Z","timestamp":1725492818363},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540420767"},{"type":"electronic","value":"9783540449928"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44992-2_14","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:35:31Z","timestamp":1192890931000},"page":"209-220","source":"Crossref","is-referenced-by-count":7,"title":["A DNA-based random walk method for solving k-SAT"],"prefix":"10.1007","author":[{"given":"Sergio","family":"D\u00edaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Luis","family":"Esteban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsunori","family":"Ogihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,25]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","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":"14_CR2","first-page":"290","volume-title":"Proceedings of 11th Conference on Computational Complexity","author":"E. Bach","year":"1996","unstructured":"E. Bach, A. Condon, E. Glaser, and C. Tanguay. DNA models and algorithms for NP-complete problems. In Proceedings of 11th Conference on Computational Complexity, pages 290\u2013299. IEEE Computer Society Press, Los Alamitos, CA, 1996."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"W. Cai, A. Condon, R. Corn, E. Glaser, Z. Fei, T. Frutos, Z. Guo, M. Lagally, Q. Liu, L. Smith, and A. Thiel. The power of surface-based DNA computation. In Proceedings of 1st International Conference on Computational Molecular Biology, pages 67\u201374. ACM Press, 1997.","DOI":"10.1145\/267521.267530"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R. Lipton","year":"1995","unstructured":"R. Lipton. DNA solutions of hard computational problems. Science, 268:542\u2013545, 1995.","journal-title":"Science"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/35001232","volume":"403","author":"Q. Liu","year":"2000","unstructured":"Q. Liu, L. Wang, A. G. Frutos, R. M. Corn, and L. M. Smith. DNA computing on surfaces. Nature, 403:175\u2013178, 2000. January, 13.","journal-title":"Nature"},{"key":"14_CR6","volume-title":"Technical Report TR 629","author":"M. Ogihara","year":"1996","unstructured":"M. Ogihara. Breadth first search 3SAT algorithms for DNA computers. Technical Report TR 629, Department of Computer Science, University of Rochester, Rochester, NY, July 1996."},{"key":"14_CR7","unstructured":"M. Ogihara and A. Ray. DNA-based parallel computation by counting. In H. Rubin and D. H. Wood, editors, DNA Based Computers III, pages 255\u2013264, 1997."},{"issue":"2","key":"14_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/568547.568557","volume":"30","author":"M. Ogihara","year":"1999","unstructured":"M. Ogihara and A. Ray. Biomolecular computing\u2014 recent theoretical and experimental advances. SIGACT News, 30(2):22\u201330, 1999.","journal-title":"SIGACT News"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/262301.262302","volume":"28","author":"M. Ogihara","year":"1997","unstructured":"M. Ogihara, A. Ray, and K. Smith. Biomolecular computing\u2014 a shape of computation to come. SIGACT News, 28(3):2\u201311, 1997.","journal-title":"SIGACT News"},{"issue":"1","key":"14_CR10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the Association for Computing Machinery, 12(1):23\u201341, January 1965.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"3925","DOI":"10.1093\/nar\/25.19.3925","volume":"25","author":"B. B. Rosenbaum","year":"1997","unstructured":"B. B. Rosenbaum, F. Oaks, S. Menchen, and B. Johnson. Improved single-stranded DNA sizing accuracy in capillary electrophoresis. Nucleic Acids Research, 25:3925\u20133929, 1997.","journal-title":"Nucleic Acids Research"},{"key":"14_CR12","first-page":"410","volume-title":"Proceedings of 40th Symposium on Foundations of Computer Science","author":"U. Sch\u00f6ning","year":"1999","unstructured":"U. Sch\u00f6ning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In Proceedings of 40th Symposium on Foundations of Computer Science, pages 410\u2013414. IEEE Computer Society Press, Los Alamitos, CA, 1999."},{"key":"14_CR13","volume-title":"Molecular Cloning: a Laboratory Manual","author":"J. Sambrook","year":"1989","unstructured":"J. Sambrook, E. F. Fritsch, and T. Maniatis. Molecular Cloning: a Laboratory Manual. Cold Spring Harbor Press, NY, 2nd edition, 1989.","edition":"2nd edition"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44992-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:03:02Z","timestamp":1556920982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44992-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540420767","9783540449928"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44992-2_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}