{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:24:16Z","timestamp":1725575056858},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200543"},{"type":"electronic","value":"9783540394259"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39425-9_34","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T10:06:54Z","timestamp":1295086014000},"page":"274-280","source":"Crossref","is-referenced-by-count":0,"title":["An Effective Molecular Algorithm for Solving the Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Wen","family":"Yu","sequence":"first","affiliation":[]},{"given":"Weimin","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"11","key":"34_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combination problems. science\u00a0266(11), 1021\u20131023 (1994)","journal-title":"science"},{"issue":"28","key":"34_CR2","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R.J. Lipton","year":"1995","unstructured":"Lipton, R.J.: DNA solution of hard computational problems. Science\u00a0268(28), 542\u2013545 (1995)","journal-title":"Science"},{"key":"34_CR3","unstructured":"Roweis, S., et al.: A sticker based model of DNA computation. In: Proceedings of the Second Annual Meeting on DNA-based computers (1996)"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Bach, E., et al.: DNA model and algorithms for NP-complete problem. In: Proceedings of the 11th Annual Conference on Structure in Complexity Theory, pp. 290\u2013299 (1996)","DOI":"10.1109\/CCC.1996.507691"},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1089\/cmb.1998.5.255","volume":"5","author":"L.M. Smith","year":"1998","unstructured":"Smith, L.M., et al.: A surface-based approach to DNA computation. Journal of computational biology\u00a05(2), 255\u2013267 (1998)","journal-title":"Journal of computational biology"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q. Ouyang","year":"1997","unstructured":"Ouyang, Q., et al.: DNA solution of the maximal clique problem. Science\u00a0278, 446\u2013449 (1997)","journal-title":"Science"},{"issue":"13","key":"34_CR7","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1038\/35003155","volume":"403","author":"Q. Liu","year":"2000","unstructured":"Liu, Q., et al.: DNA computing on surfaces. Natural\u00a0403(13), 175\u2013178 (2000)","journal-title":"Natural"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1126\/science.288.5469.1223","volume":"288","author":"K. Sakamoto","year":"2000","unstructured":"Sakamoto, K., et al.: Molecular computation by DNA hairpin formation. Science\u00a0288, 1223\u20131226 (2000)","journal-title":"Science"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1073\/pnas.97.4.1385","volume":"97","author":"D. Faulhammer","year":"2000","unstructured":"Faulhammer, D., Cukras, A.R., Lipton, R.J., Landweber, L.F.: Proc. Natl. Acad. Sci. U.S.A.\u00a097, 1385 (2000)","journal-title":"U.S.A."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1006\/inco.1996.0094","volume":"131","author":"D. Roos","year":"1996","unstructured":"Roos, D., Wagner, K.: On the power of bio-computers. Information and Comoutation\u00a0131, 95\u2013109 (1996)","journal-title":"Information and Comoutation"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0303-2647(99)00033-7","volume":"52","author":"M.H. Garzon","year":"1999","unstructured":"Garzon, M.H., et al.: The bounded complexity of DNA computing. BioSystem\u00a052, 63\u201372 (1999)","journal-title":"BioSystem"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Braich, R.S., et al.: Solution of a 20-Variable 3-SAT Problem on a DNA Computer Science, vol.\u00a0296, pp. 499\u2013502 (2002)","DOI":"10.1126\/science.1069528"},{"key":"34_CR13","unstructured":"The used notebook computer is a Intel Pentium III (TOSHIBA 1300), 1.0 GHz-M, 384 MB (RAM), 30G HD, installed Microsoft\u00ae window\u00ae XP Home Edition. MBTLAB 6.0 is used"}],"container-title":["Lecture Notes in Computer Science","Advanced Parallel Processing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39425-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:10:08Z","timestamp":1559931008000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39425-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200543","9783540394259"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39425-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}