{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T08:01:04Z","timestamp":1759564864697},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540005315"},{"type":"electronic","value":"9783540364405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36440-4_21","type":"book-chapter","created":{"date-parts":[[2007,8,7]],"date-time":"2007-08-07T02:11:33Z","timestamp":1186452693000},"page":"242-251","source":"Crossref","is-referenced-by-count":10,"title":["NACST\/Seq: A Sequence Design System with Multiobjective Optimization"],"prefix":"10.1007","author":[{"given":"Dongmin","family":"Kim","sequence":"first","affiliation":[]},{"given":"Shin","family":"Soo-Yong","sequence":"additional","affiliation":[]},{"given":"Lee","family":"In-Hee","sequence":"additional","affiliation":[]},{"given":"Zhang","family":"Byoung-Tak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,16]]},"reference":[{"unstructured":"R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, and S. E. Stevens Jr., \u201cGood encodings for DNA-based solutions to combinatorial problems,\u201d in Proceedings of the Second Annual Meeting on DNA Based Computers, 1996.","key":"21_CR1"},{"unstructured":"R. Deaton, R. C. Murphy, M. Garzon, D. R. Franceschetti, and S. E. Stevens Jr., \u201cGenetic search of reliable encodings for DNA based computation,\u201d Late-Breaking papers at the First Genetic Programming Conference, pp. 9\u201315, 1996.","key":"21_CR2"},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1103\/PhysRevLett.80.417","volume":"80","author":"R. Deaton","year":"1998","unstructured":"R. Deaton, M. Garzon, J. A. Rose, D. R. Franceschetti, R. C. Murphy, and S. E. Stevens Jr., \u201cReliability and efficiency of a DNA-based computation,\u201d Physical Review Letters, vol. 80, no. 2, pp. 417\u2013420, 1998.","journal-title":"Physical Review Letters"},{"unstructured":"M. Garzon, P. Neathery, R. Deaton, R. C. Murphy, D. R. Franceschetti, and S.E. Stevens Jr., \u201cA new metric for DNA computing,\u201d in Proceedings of Genetic Programming 1997., The MIT Press. pp. 472\u2013478, 1997.","key":"21_CR4"},{"doi-asserted-by":"crossref","unstructured":"A. Marathe, A. E. Condon, and R. M. Corn, \u201cOn combinatorial DNA word design,\u201d in Proceedings of 5th DIMACS Workshop on DNA Based Computers, pp. 75\u201389, 1999.","key":"21_CR5","DOI":"10.1090\/dimacs\/054\/07"},{"unstructured":"A. G. Frutos, A. J. Thiel, A. E. Condon, L. M. Smith, and R. M. Corn, \u201cDNA computing at surfaces: 4ba se mismatch word design,\u201d in Proceedings of 3rd DIMACS Workshop on DNA Based Computers, pp. 238, 1997.","key":"21_CR6"},{"doi-asserted-by":"crossref","unstructured":"A. J. Hartemink, D. K. Gifford, and J. Khodor, \u201cAutomated constraint-based nucleotide sequence selection for DNA computation,\u201d in Proceedings of 4th DIMACS Workshop on DNA Based Computers, pp. 227\u2013235, 1998.","key":"21_CR7","DOI":"10.1016\/S0303-2647(99)00050-7"},{"unstructured":"U. Feldkamp, S. Sagha., and H. Rauhe, \u201cDNASequenceGenerator \u2014 A program for the construction of DNA sequences,\u201d in Preliminary Proceedings of 7th international Workshop on DNA-Based Computers, pp. 179\u2013188, 2001.","key":"21_CR8"},{"unstructured":"M. Arita, A. Nishikawa, M. Hagiya, K. Komiya, H. Gouzu, and K. Sakamoto, \u201cImproving sequence design for DNA computing,\u201d in Proceedings of Genetic and Evolutionary Computation Conference 2000, pp. 875\u2013882, 2000.","key":"21_CR9"},{"unstructured":"F. Tanaka, M. Nakatsugawa, M. Yamamoto, T. Shiba, and A. Ohuchi, \u201cDeveloping support system for sequence design in DNA computing,\u201d in Preliminary Proceedings of 7th international Workshop on DNA-Based Computers, pp. 340\u2013349, 2001.","key":"21_CR10"},{"unstructured":"S.-Y. Shin, D. Kim, I.-H. Lee, and B.-T. Zhang, \u201cEvolutionary sequence generation for reliable DNA computing,\u201d Congress on Evolutionary Computation 2002,, 2002. (Accepted)","key":"21_CR11"},{"unstructured":"A. J. Ruben, S. J. Freeland, and L. Landweber, \u201cPUNCH: an evolutionary algorithm for optimizing bit set selection,\u201d in Preliminary Proceedings of 7th International Workshop on DNA-Based Computers, pp. 260\u2013270, 2001.","key":"21_CR12"},{"doi-asserted-by":"crossref","unstructured":"R. Deaton, R. C. Murphy, J. A. Rose, M. Garzon, D. R. Franceschetti, and S. E. Stevens Jr., \u201cA DNA Based Implementation of an Evolutionary Search for Good Encodings for DNA Computation,\u201d in Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pp. 267\u2013272, 1997.","key":"21_CR13","DOI":"10.1109\/ICEC.1997.592311"},{"doi-asserted-by":"crossref","unstructured":"B.-T. Zhang and S.-Y. Shin, \u201cCode optimization for DNA computing of maximal cliques,\u201d in Advances in Soft Computing-Engineering Design and Manufacturing., Springer., 1999.","key":"21_CR14","DOI":"10.1007\/978-1-4471-0819-1_44"},{"issue":"2","key":"21_CR15","first-page":"221","volume":"3","author":"N. Srinivas","year":"1995","unstructured":"N. Srinivas, \u201cMultiobjective optimization using nondominated sorting in genetic algorithms,\u201d Evolutionary Computation, vol. 3, no. 2, pp. 221\u2013248, 1995.","journal-title":"Evolutionary Computation"},{"unstructured":"S.-Y. Shin, D. Kim, I.-H. Lee, and B.-T. Zhang, \u201cMultiobjective evolutionary algorithms to design error-preventing DNA sequences,\u201d Parallel Problem Solving from Nature VII, 2002. (Submitted)","key":"21_CR16"},{"key":"21_CR17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1090\/dimacs\/048\/05","volume":"48","author":"M. Hagiya","year":"1999","unstructured":"M. Hagiya, M. Arita, D. Kiga, K. Sakamoto, and S. Yokoyama, \u201cTowards parallel evaluation and learning of Boolean \u03bc-formulas with molecules,\u201d DNA Based Computers III, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 48, pp. 57\u201372, 1999.","journal-title":"DNA Based Computers III, DIMACS Series in Discrete Mathematics and Theoretical Computer Science"}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:55:55Z","timestamp":1556740555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36440-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005315","9783540364405"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36440-4_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}