{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:57:01Z","timestamp":1777417021247,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540005315","type":"print"},{"value":"9783540364405","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36440-4_7","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T02:11:33Z","timestamp":1186452693000},"page":"73-84","source":"Crossref","is-referenced-by-count":10,"title":["Temperature Gradient-Based DNA Computing for Graph Problems with Weighted Edges"],"prefix":"10.1007","author":[{"given":"Ji","family":"Youn Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soo-Yong","family":"Shin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sirk","family":"June Augh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tai","family":"Hyun Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byoung-Tak","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,16]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. M. Adleman","year":"1994","unstructured":"L. M. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021\u20131024, 1994.","journal-title":"Science"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1126\/science.1069528","volume":"296","author":"R. S. Braich","year":"2002","unstructured":"R. S. Braich, N. Chelyapov, C. Johnson, P. W. K. Rothemund, and L. Adleman. Solution of a 20-varaible 3-SAT problem on a DNA computer. Science, 296:499\u2013502, 2002.","journal-title":"Science"},{"key":"7_CR3","unstructured":"J. Chen, E. Antipov, B. Lemieux, W. Cede\u00f1o, and D. H. Wood. In vitro selection for a MAX 1s DNA genetic algorithm. In Proceedings 5th International Workshop on DNA-Based Computers, pages 23\u201346, 2000."},{"key":"7_CR4","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and company, 1979."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1073\/pnas.95.4.1460","volume":"95","author":"J. SantaLucia","year":"1998","unstructured":"J. SantaLucia Jr. A unified view of polymer, dumbbell, and oligonucleotide DNA nearest-neighbor thermodynamics. Proc. Natl. Acad. Sci. USA, 95:1460\u20131465, 1998.","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"D. Kim, S.-Y. Shin, I.-H. Lee, and B.-T. Zhang. NACST\/Seq: A sequence design system with multiobjective optimization. In Preliminary Proceedings of 8th International Meeting on DNA Based Computer, pages 241\u2013251, 2002.","DOI":"10.1007\/3-540-36440-4_21"},{"key":"7_CR7","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, A. E. Condon, R. M. Corn, and L. M. Smith. DNA compouting on surface. Nature, 403:175\u2013179, 2000.","journal-title":"Nature"},{"key":"7_CR8","unstructured":"A. Narayanan and S. Zorbalas. DNA algorithms for computing shortest paths. In Proceedings of Genetic Programming 1998, pages 718\u2013723, 1998."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1126\/science.278.5337.446","volume":"278","author":"Q. Ouyang","year":"1997","unstructured":"Q. Ouyang, P. D. Kaplan, S. Liu, and A. Libchaber. DNA solution of the maximal clique problem. Science, 278:446\u2013449, 1997.","journal-title":"Science"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/(SICI)1097-0282(1997)44:3<217::AID-BIP3>3.0.CO;2-Y","volume":"44","author":"R. Owczarzy","year":"1998","unstructured":"R. Owczarzy, P. M. Vallone, F. J. Gallo, T. M. Paner, M. J. Lane, and A. S. Benight. Predicting sequence-dependent melting stability of short duplex DNA oligomers. Bioploymers, 44:217\u2013239, 1998.","journal-title":"Bioploymers"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s005000000073","volume":"5","author":"G. G. Owenson","year":"2001","unstructured":"G. G. Owenson, M. Amos, D. A. Hodgson, and A. Gibbsons. DNA-based logic. Soft Computing, 5(2):102\u2013105, 2001.","journal-title":"Soft Computing"},{"key":"7_CR12","unstructured":"J. H. Reif, T. H. LaBean, M. Pirrug, V. S. Rana, B. Guo, C. Kingsford, and G. S. Wickham. Experimental construction of a very large scale DNA database with associatice search capability. In The 7th International Workshop on DNA-Based Computers, pages 241\u2013250."},{"key":"7_CR13","unstructured":"S.-Y. Shin, D. Kim, I.-H. lee, and B.-T. Zhang. Multiobjective evolutionary algorithms to design error-preventing DNA sequences. Technical Report BI-02-003, Seoul National University, School of Computer Science and Engineering, Seoul National University, Seoul, Korea, March 2002."},{"key":"7_CR14","unstructured":"S.-Y. Shin, D.-M. Kim, I.-H. Lee, and B.-T. Zhang. Evolutionary sequence generation for reliable DNA computing. In Proceedings of Congress on Evolutionary Computation 2002, pages 79\u201384, 2002."},{"key":"7_CR15","unstructured":"S.-Y. Shin, B.-T. Zhang, and S.-S. Jun. Solving traveling salesman problems using molecular programming. In Proceedings of Congerss on Evolutionary Computation 1999, pages 994\u20131000, 1999."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.3109\/10409239109114069","volume":"26","author":"J. G. Wetmur","year":"1991","unstructured":"J. G. Wetmur. DNA probes: applications of the principles of nucleic acid hybridization. Crit. Rev. Biochem. Mol. Biol., 26:227\u2013259, 1991.","journal-title":"Crit. Rev. Biochem. Mol. Biol."},{"issue":"6693","key":"7_CR17","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E. Winfree","year":"1998","unstructured":"E. Winfree, F. Lin, L. A. Wenzler, and N. C. Seeman. Design and self-assembly of two-dimensional DNA crystals. Nature, 394(6693):539\u2013545, 1998.","journal-title":"Nature"},{"key":"7_CR18","unstructured":"M. Yamamura, Y. Hiroto, and T. Matoba. Solutions of shortest path problems by concentration control. In Proceedings of 7th International Workshop on DNABased Computers, pages 231\u2013240, 2001."}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36440-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:55:29Z","timestamp":1556740529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36440-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005315","9783540364405"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-36440-4_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}