{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:52:12Z","timestamp":1725558732009},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540203599"},{"type":"electronic","value":"9783540397076"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39707-6_17","type":"book-chapter","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T15:34:42Z","timestamp":1277825682000},"page":"222-233","source":"Crossref","is-referenced-by-count":0,"title":["Is Cook\u2019s Theorem Correct for DNA-Based Computing?"],"prefix":"10.1007","author":[{"given":"Weng-Long","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minyi","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesse","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"DNA Structure and Function","author":"R.R. Sinden","year":"1994","unstructured":"Sinden, R.R.: DNA Structure and Function. Academic Press, London (1994)"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: Molecular computation of solutions to combinatorial problems. Science\u00a0266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"17_CR3","doi-asserted-by":"crossref","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, 542\u2013545 (1995); Narayanan, A., Zorbala, S.: DNA algorithms for computing shortest paths. In: Koza, J.R., et al. (eds.) Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 718\u2013724 (1998)","journal-title":"Science"},{"key":"17_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms"},{"key":"17_CR5","volume-title":"Computer and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and intractability. Freeman, San Fransico (1979)"},{"key":"17_CR6","first-page":"79","volume":"71","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Dunworth, C., Lipton, R.J., Sgall, J.: On the computational Power of DNA. In Discrete Applied Mathematics. Special Issue on Computational Molecular Biology\u00a071, 79\u201394 (1996)","journal-title":"Special Issue on Computational Molecular Biology"},{"key":"17_CR7","first-page":"1","volume-title":"DIMACS: series in Discrete Mathematics and Theoretical Computer Science","author":"L.M. Adleman","year":"1996","unstructured":"Adleman, L.M.: On constructing a molecular computer. DNA Based Computers. In: Lipton, R., Baum, E. (eds.) DIMACS: series in Discrete Mathematics and Theoretical Computer Science, pp. 1\u201321. American Mathematical Society, Providence (1996)"},{"key":"17_CR8","series-title":"DIMACS: series in Discrete Mathematics and Theoretical Computer Science","first-page":"1","volume-title":"2nd annual workshop on DNA Computing, Princeton University","author":"S. Roweis","year":"1999","unstructured":"Roweis, S., Winfree, E., Burgoyne, R., Chelyapov, N.V., Goodman, M.F., Rothemund, P.W.K., Adleman, L.M.: Sticker Based Model for DNA Computation. In: Landweber, L., Baum, E. (eds.) 2nd annual workshop on DNA Computing, Princeton University. DIMACS: series in Discrete Mathematics and Theoretical Computer Science, pp. 1\u201329. American Mathematical Society, Providence (1999)"},{"key":"17_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03563-4","volume-title":"DNA Computing: New Computing Paradigms","author":"G. Paun","year":"1998","unstructured":"Paun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, New York (1998) ISBN: 3-540-64196-3"},{"key":"17_CR10","unstructured":"Chang, W.-L., Guo, M.: Solving the Dominating-set Problem in Adleman- Lipton\u2019s Model. In: The Third International Conference on Parallel and Distributed Computing, Applications and Technologies, Japan, pp. 167\u2013172 (2002)"},{"key":"17_CR11","unstructured":"Chang, W.-L., Guo, M.: Solving the Clique Problem and the Vertex Cover Problem in Adleman-Lipton\u2019s Model. In: IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, pp. 431-436 (2002)"},{"key":"17_CR12","unstructured":"Chang, W.-L., Guo, M.: Solving NP-Complete Problem in the Adleman-Lipton Model. In: The Proceedings of, International Conference on Computer and Information Technology, Japan, pp. 157-162 (2002)"},{"key":"17_CR13","unstructured":"Chang, W.-L., Guo, M.: solving the 3-Dimensional Matching Problem and the Set Packing Problem in Adleman-Lipton\u2019s Mode. In: IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, pp. 455-460 (2002)"},{"key":"17_CR14","unstructured":"Braich, R.S., Johnson, C., Rothemund, P.W.K., Hwang, D., Chelyapov, N., Adleman, L.M.: Solution of a satisfiability problem on a gel-based DNA computer. In: Proceedings of the 6th International Conference on DNA Computation. LNCS, Springer, Heidelberg"},{"key":"17_CR15","unstructured":"Cukras, R., Faulhammer, D., Lipton, R.J., Landweber, L.F.: Chess games: A model for RNA-based computation. In: Proceedings of the 4th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16-19, pp. 27\u201337 (1998)"},{"key":"17_CR16","first-page":"123","volume":"54","author":"T.H. LaBean","year":"2000","unstructured":"LaBean, T.H., Winfree, E., Reif, J.H.: Experimental Progress in Computation by Self-Assembly of DNA Tilings. Theoretical Computer Science\u00a054, 123\u2013140 (2000)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39707-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:27:55Z","timestamp":1558279675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39707-6_17"}},"subtitle":["Towards Solving NP-complete Problems on a DNA-Based Supercomputer Model"],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540203599","9783540397076"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39707-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}