{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:59Z","timestamp":1725494459740},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405238"},{"type":"electronic","value":"9783540376194"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-37619-4_20","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T18:51:13Z","timestamp":1194375073000},"page":"185-196","source":"Crossref","is-referenced-by-count":3,"title":["Solving the Set-Splitting Problem in Sticker-Based Model and the Lipton-Adelmann Model"],"prefix":"10.1007","author":[{"given":"Weng-Long","family":"Chang","sequence":"first","affiliation":[]},{"given":"Minyi","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Ho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"20_CR1","unstructured":"R. R. Sinden. DNA Structure and Function. Academic Press, 1994."},{"key":"20_CR2","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, Nov. 11, 1994.","journal-title":"Science"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1126\/science.7725098","volume":"268","author":"R. J. Lipton","year":"1995","unstructured":"R. J. Lipton. DNA solution of hard computational problems. Science, 268:542:545, 1995.","journal-title":"Science"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q. Quyang","year":"1997","unstructured":"Q. Quyang, P.D. Kaplan, S. Liu, and A. Libchaber. DNA solution of the maximal clique problem. Science, 278:446\u2013449, 1997.","journal-title":"Science"},{"key":"20_CR5","unstructured":"M. Arita, A. Suyama, and M. Hagiya. A heuristic approach for Hamiltonian path problem with molecules. Proceedings of 2nd Genetic Programming (GP-97), 1997, pp. 457\u2013462."},{"key":"20_CR6","first-page":"93","volume":"48","author":"N. Morimoto","year":"1999","unstructured":"N. Morimoto, M. Arita, and A. Suyama. Solid phase DNA solution to the Hamiltonian path problem. DIMACS (Series in Discrete Mathematics and Theoretical Computer Science), Vol. 48, 1999, pp. 93\u2013206.","journal-title":"DIMACS (Series in Discrete Mathematics and Theoretical Computer Science)"},{"key":"20_CR7","unstructured":"A. Narayanan, and S. Zorbala. DNA algorithms for computing shortest paths. In Genetic Programming 1998: Proceedings of the Third Annual Conference, J. R. Koza et al. (Eds), 1998, pp. 718\u2013724."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1109\/CEC.1999.782531","volume":"2","author":"S.-Y. Shin","year":"1999","unstructured":"S.-Y. Shin, B.-T. Zhang, and S.-S. Jun. Solving traveling salesman problems using molecular programming. Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), vol. 2, pp. 994\u20131000, 1999.","journal-title":"Proceedings of the 1999 Congress on Evolutionary Computation (CEC99)"},{"key":"20_CR9","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms."},{"key":"20_CR10","volume-title":"Computer and intractability","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, and D. S. Johnson. Computer and intractability. Freeman, San Fransico, CA, 1979."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0166-218X(96)00058-3","volume":"71","author":"D. Boneh","year":"1996","unstructured":"D. Boneh, C. Dunworth, R. J. Lipton and J. Sgall. On the computational Power of DNA. In Discrete Applied Mathematics, Special Issue on Computational Molecular Biology, Vol. 71 (1996), pp. 79\u201394.","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"L. M. Adleman. On constructing a molecular computer. DNA Based Computers, Eds. R. Lipton and E. Baum, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society. 1\u201321 (1996)","DOI":"10.1090\/dimacs\/027\/01"},{"key":"20_CR13","unstructured":"M. Amos. \u201cDNA Computation\u201d, Ph.D. Thesis, department of computer science, the University of Warwick, 1997."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"S. Roweis, E. Winfree, R. Burgoyne, N. V. Chelyapov, M. F. Goodman, Paul W.K. Rothemund and L. M. Adleman. \u201cA Sticker Based Model for DNA Computation\u201d. 2nd annual workshop on DNA Computing, Princeton University. Eds. L. Landweber and E. Baum, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society. 1\u201329 (1999).","DOI":"10.1090\/dimacs\/044\/01"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"M.J. Perez-Jimenez and F. Sancho-Caparrini. \u201cSolving Knapsack Problems in a Sticker Based Model\u201d. 7nd annual workshop on DNA Computing, DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 2001.","DOI":"10.1007\/3-540-48017-X_15"},{"key":"20_CR16","isbn-type":"print","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":"G. Paun, G. Rozenberg and A. Salomaa. DNA Computing: New Computing Paradigms. Springer-Verlag, New York, 1998. ISBN: 3-540-64196-3.","ISBN":"http:\/\/id.crossref.org\/isbn\/3540641963"},{"key":"20_CR17","unstructured":"W.-L. Chang and M. Guo. \u201cSolving the Dominating-set Problem in Adleman-Lipton\u2019s Model\u201d. The Third International Conference on Parallel and Distributed Computing, Applications and Technologies, Japan, 2002, pp. 167\u2013172."},{"key":"20_CR18","unstructured":"W.-L. Chang and M. Guo. \u201cSolving the Clique Problem and the Vertex Cover Problem in Adleman-Lipton\u2019s Model\u201d. IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, 2002, pp. 431\u2013436."},{"key":"20_CR19","unstructured":"W.-L. Chang, M. Guo. \u201cSolving NP-Complete Problem in the Adleman-Lipton Model\u201d. The Proceedings of 2002 International Conference on Computer and Information Technology, Japan, 2002, pp. 157\u2013162."},{"key":"20_CR20","unstructured":"W.-L. Chang and M. Guo. \u201cResolving the 3-Dimensional Matching Problem and the Set Packing Problem in Adleman-Lipton\u2019s Model\u201d. IASTED International Conference, Networks, Parallel and Distributed Processing, and Applications, Japan, 2002, pp. 455\u2013460."},{"key":"20_CR21","unstructured":"Bin Fu. \u201cVolume Bounded Molecular Computation\u201d. Ph.D. Thesis, Department of Computer Science, Yale University, 1997."},{"key":"20_CR22","unstructured":"Ravinderjit S. Braich, Clifford Johnson, Paul W.K. Rothemund, Darryl Hwang, Nickolas Chelyapov and Leonard M. Adleman. \u201cSolution of a satisfiability problem on a gel-based DNA computer\u201d. Proceedings of the 6th International Conference on DNA Computation in the Springer-Verlag Lecture Notes in Computer Science series."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Kalim Mir. \u201cA restricted genetic alphabet for DNA computing\u201d. Eric B. Baum and Laura F. Landweber, editors. DNA Based Computers II: DIMACS Workshop, June 10\u201312, 1996, volume 44 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, Providence, RI, 1998, pp. 243\u2013246.","DOI":"10.1090\/dimacs\/044\/19"},{"key":"20_CR24","unstructured":"A. R. Cukras, Dirk Faulhammer, Richard J. Lipton, and Laura F. Landweber. \u201cChess games: A model for RNA-based computation\u201d. In Proceedings of the 4th DIMACS Meeting on DNA Based Computers, held at the University of Pennsylvania, June 16\u201319, 1998, pp. 27\u201337."},{"key":"20_CR25","unstructured":"W.-L. Chang and M. Guo. \u201cUsing Sticker for Solving the Dominating-set Problem in the Adleman-Lipton Model\u201d. IEICE Transaction on Information System, 2003, accepted."},{"key":"20_CR26","unstructured":"W.-L. Chang and M. Guo. \u201cSolving the Set-basis Problem in Sticker-based Model and the Adleman-Lipton Model\u201d. It was submitted to the 2003 International Conference on Parallel Processing (ICPP2003), Kaohsiung, Taiwan, Republic of China."}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37619-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:21:44Z","timestamp":1556936504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37619-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405238","9783540376194"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-37619-4_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}