{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:00Z","timestamp":1725535980198},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030949"},{"type":"electronic","value":"9783642030956"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03095-6_40","type":"book-chapter","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T17:40:55Z","timestamp":1248975655000},"page":"416-427","source":"Crossref","is-referenced-by-count":1,"title":["Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem"],"prefix":"10.1007","author":[{"given":"Sientang","family":"Tsai","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","unstructured":"Feynman, R.P.: In miniaturization. In: Gilbert, D.H. (ed.), pp. 282\u2013296. Reinhold Publishing Corporation, New York (1961)"},{"key":"40_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":"40_CR3","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, 542\u2013545 (1995)","journal-title":"Science"},{"key":"40_CR4","series-title":"DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society","first-page":"1","volume-title":"2nd annual workshop on DNA Computing","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.: A sticker based model for DNA computation. In: Landweber, L., Baum, E. (eds.) 2nd annual workshop on DNA Computing. DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 1\u201329. Princeton University, Princeton (1999)"},{"issue":"1","key":"40_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.biosystems.2004.10.003","volume":"80","author":"M. Guo","year":"2005","unstructured":"Guo, M., Chang, W.L., Ho, M., Lu, J., Cao, J.: Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing. Biosystems\u00a080(1), 71\u201382 (2005)","journal-title":"Biosystems"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q. Quyang","year":"1997","unstructured":"Quyang, Q., Kaplan, P.D., Liu, S., Libchaber, A.: DNA solution of the maximal clique problem. Science\u00a0278, 446\u2013449 (1997)","journal-title":"Science"},{"key":"40_CR7","unstructured":"Amos, M.: \u201cDNA Computation\u201d, Ph.D. Thesis, department of computer science, the University of Warwick (1997)"},{"issue":"5","key":"40_CR8","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.future.2003.10.010","volume":"20","author":"W.L. Chang","year":"2004","unstructured":"Chang, W.L., Guo, M., Ho, M.: Towards solution of the set-splitting problem on gel-based DNA computing. Future Generation Computer Systems\u00a020(5), 875\u2013885 (2004)","journal-title":"Future Generation Computer Systems"},{"issue":"3","key":"40_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0303-2647(03)00149-7","volume":"72","author":"W.L. Chang","year":"2003","unstructured":"Chang, W.L., Guo, M.: Solving the Set-cover Problem and the Problem of Exact Cover by 3-Sets in the Adleman-Lipton\u2019s Model. BioSystems\u00a072(3), 263\u2013275 (2003)","journal-title":"BioSystems"},{"issue":"9&10","key":"40_CR10","first-page":"1109","volume":"30","author":"W.L. Chang","year":"2004","unstructured":"Chang, W.L., Ho, M., Guo, M.: Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing. Parallel Computing\u00a030(9&10), 1109\u20131125 (2004)","journal-title":"Parallel Computing"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.biosystems.2005.06.009","volume":"82","author":"D. Xiao","year":"2005","unstructured":"Xiao, D., Li, W., Zhang, Z., He, L.: Solving the maximum cut problems in the Adleman\u2013Lipton model. BioSystems\u00a082, 203\u2013207 (2005)","journal-title":"BioSystems"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.biosystems.2005.09.005","volume":"83","author":"C.W. Yeh","year":"2006","unstructured":"Yeh, C.W., Chu, C.P., Wu, K.R.: Molecular solutions to the binary integer programming problem based on DNA computation. Biosystems\u00a083(1), 56\u201366 (2006)","journal-title":"Biosystems"},{"key":"40_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Dunworth, C., Lipton, R.J.: Breaking DES using a molecular computer. In: Proceedings of the 1st DIMACS Workshop on DNA Based Computers 1995. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 27, pp. 37\u201366 (1996)","DOI":"10.1090\/dimacs\/027\/04"},{"key":"40_CR14","series-title":"DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society","first-page":"31","volume-title":"The 2nd annual workshop on DNA Computing","author":"L. Adleman","year":"1999","unstructured":"Adleman, L., Rothemund, P.W.K., Roweis, S., Winfree, E.: On applying molecular computation to the Data Encryption Standard. In: The 2nd annual workshop on DNA Computing. DIMACS: series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 31\u201344. Princeton University, Princeton (1999)"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1126\/science.273.5272.220","volume":"273","author":"F. Guarnieri","year":"1996","unstructured":"Guarnieri, F., Fliss, M., Bancroft, C.: Making DNA add. Science\u00a0273, 220\u2013223 (1996)","journal-title":"Science"},{"key":"40_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.biosystems.2004.11.009","volume":"80","author":"M. Ho","year":"2005","unstructured":"Ho, M.: Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem. BioSystems\u00a080, 233\u2013250 (2005)","journal-title":"BioSystems"},{"issue":"2","key":"40_CR17","first-page":"33","volume":"6","author":"H. Ahrabian","year":"2004","unstructured":"Ahrabian, H., Nowzari-Dalini, A.: DNA simulation of nand Boolean circuits. Advanced Modeling and Optimization\u00a06(2), 33\u201341 (2004)","journal-title":"Advanced Modeling and Optimization"},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.biosystems.2005.04.004","volume":"81","author":"A. Schuster","year":"2005","unstructured":"Schuster, A.: DNA databases. BioSystems\u00a081, 234\u2013246 (2005)","journal-title":"BioSystems"},{"issue":"1","key":"40_CR19","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TNB.2007.909012","volume":"6","author":"W.L. Chang","year":"2007","unstructured":"Chang, W.L.: Fast Parallel DNA-based Algorithms for Molecular Computation: the Set Partition Problem. IEEE Transactions on Nanobioscience\u00a06(1), 346\u2013353 (2007)","journal-title":"IEEE Transactions on Nanobioscience"},{"key":"40_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-44992-2_3","volume-title":"DNA Computing","author":"R.S. Braich","year":"2001","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: Condon, A., Rozenberg, G. (eds.) DNA 2000. LNCS, vol.\u00a02054, pp. 27\u201342. Springer, Heidelberg (2001)"},{"issue":"5567","key":"40_CR21","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1126\/science.1069528","volume":"296","author":"L.M. Adleman","year":"2002","unstructured":"Adleman, L.M., Braich, R.S., Johnson, C., Rothemund, P.W.K., Hwang, D., Chelyapov, N.: Solution of a 20-Variable 3-SAT Problem on a DNA Computer. Science\u00a0296(5567), 499\u2013502 (2002)","journal-title":"Science"},{"key":"40_CR22","unstructured":"Watson, J., Gilman, M., Witkowski, J., Zoller, M.: Recombinant DNA, 2nd edn. Scientific American Books, W. H. Freeman and Co. (1992)"},{"key":"40_CR23","volume-title":"Molecular Biology of the Gene","author":"J. Watson","year":"1987","unstructured":"Watson, J., Hoplins, N., Roberts, J., et al.: Molecular Biology of the Gene. Benjamin\/Cummings, Menlo Park (1987)"},{"key":"40_CR24","unstructured":"Blackburn, G.M., Gait, M.J.: Nucleic Acids in Chemistry and Biology. IRL Press (1990)"},{"key":"40_CR25","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780199632800.001.0001","volume-title":"Oligonucleotides and Anologues","author":"F. Eckstein","year":"1991","unstructured":"Eckstein, F.: Oligonucleotides and Anologues. Oxford University Press, Oxford (1991)"},{"key":"40_CR26","volume-title":"Theoretical and Experimental DNA Computation","author":"M. Amos","year":"2005","unstructured":"Amos, M.: Theoretical and Experimental DNA Computation. Springer, Heidelberg (2005)"},{"key":"40_CR27","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)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03095-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,15]],"date-time":"2024-03-15T15:59:46Z","timestamp":1710518386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03095-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030949","9783642030956"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03095-6_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}