{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:42:21Z","timestamp":1725475341333},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490241"},{"type":"electronic","value":"9783540684237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11925903_12","type":"book-chapter","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T16:03:04Z","timestamp":1166025784000},"page":"157-171","source":"Crossref","is-referenced-by-count":7,"title":["DNA Sequence Design by Dynamic Neighborhood Searches"],"prefix":"10.1007","author":[{"given":"Suguru","family":"Kawashimo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masafumi","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"226","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: Molecular Computation of Solutions to Combinatorial problems. Science\u00a0226, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"12_CR2","unstructured":"Arita, M., Nishikawa, A., Hagiya, M., Komiya, K., Gouzu, H., Sakamoto, K.: Improving Sequence Design for DNA Computing. In: Proc. 5th Genetic and Evolutionary Computation Conference (GECCO 2000), pp. 875\u2013882 (2000)"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF03037360","volume":"20","author":"M. Arita","year":"2002","unstructured":"Arita, M., Kobayashi, S.: DNA Sequence Design Using Templates. New Generation Computing\u00a020(3), 263\u2013273 (2002)","journal-title":"New Generation Computing"},{"key":"12_CR4","unstructured":"Asahiro, Y.: Simple Greedy Methods for DNA Word Design. In: Proc. 9th World Multi-Conference on Systemics, Cybernetics and Informatics, vol.\u00a0III, pp. 186\u2013191 (2005)"},{"issue":"1-3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2004.11.004","volume":"334","author":"P. Gaborit","year":"2005","unstructured":"Gaborit, P., King, O.D.: Linear Constructions for DNA Codes. Theoretical Computer Science\u00a0334(1-3), 99\u2013113 (2005)","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problem. Discrete Applied Mathematics\u00a065, 223\u2013253 (1996)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"12_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s11047-004-4007-y","volume":"4","author":"A. Kameda","year":"2005","unstructured":"Kameda, A., Yamamoto, M., Uejima, H., Hagiya, M., Sakamoto, K., Ohuchi, A.: Hairpin-based State Machine and Conformational Addressing: Design and Experiment. Natural Computing\u00a04(2), 103\u2013126 (2005)","journal-title":"Natural Computing"},{"key":"12_CR8","unstructured":"Kashiwamura, S., Kameda, A., Yamamoto, M., Ouchi, A.: Two-Step Search for DNA Sequence Design. In: Proc. the 2003 International Technical Conference on Circuits\/Systems, Computers and Communications (ITC-CSCC 2003), pp. 1889\u20131892 (2003)"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An Effective Heuristic Procedure for Partitioning Graphs. Bell System Technical J.\u00a049, 291\u2013307 (1970)","journal-title":"Bell System Technical J."},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-36440-4_18","volume-title":"DNA Computing","author":"S. Kobayashi","year":"2003","unstructured":"Kobayashi, S., Kondo, T., Arita, M.: On Template Method for DNA Sequence Design. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol.\u00a02568, pp. 205\u2013214. Springer, Heidelberg (2003)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operation Research\u00a021, 498\u2013516 (1973)","journal-title":"Operation Research"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1089\/10665270152530818","volume":"8","author":"A. Marathe","year":"2001","unstructured":"Marathe, A., Condon, A., Corn, R.: On Combinatorial DNA Word Design. Journal of Computational Biology\u00a08(3), 201\u2013220 (2001)","journal-title":"Journal of Computational Biology"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-36440-4_20","volume-title":"DNA Computing","author":"D. Tulpan","year":"2003","unstructured":"Tulpan, D., Hoos, H., Condon, A.: Stochastic Local Search Algorithms for DNA Word Design. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol.\u00a02568, pp. 229\u2013241. Springer, Heidelberg (2003)"},{"key":"12_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-44886-1_31","volume-title":"Advances in Artificial Intelligence","author":"H.H. Hoos","year":"2003","unstructured":"Hoos, H.H., Tulpan, D.C.: Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design. In: Xiang, Y., Chaib-draa, B. (eds.) Canadian AI 2003. LNCS (LNAI), vol.\u00a02671, pp. 418\u2013433. Springer, Heidelberg (2003)"},{"issue":"15","key":"12_CR15","doi-asserted-by":"publisher","first-page":"4951","DOI":"10.1093\/nar\/gki773","volume":"33","author":"D. Tulpan","year":"2005","unstructured":"Tulpan, D., Andronescu, M., Chang, S., Shortreed, M., Condon, A., Hoos, H., Smith, L.: Thermodynamically based DNA strand design. Nucleic Acids Res.\u00a033(15), 4951\u20134964 (2005)","journal-title":"Nucleic Acids Res."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E. Winfree","year":"1998","unstructured":"Winfree, E., Liu, F., Wenzler, L., Seeman, N.: Design and Self-assembly of DNA Crystals. Nature\u00a0394, 539\u2013544 (1998)","journal-title":"Nature"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Yagiura, M., Yamaguchi, T., Ibaraki, T.: A Variable Depth Search Algorithm for the Generalized Assignment Problem. Meta-Heuristics: Advances and trends in Local Search Paradigms for Optimization, 459\u2013471 (1999)","DOI":"10.1007\/978-1-4615-5775-3_31"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.1030.0036","volume":"16","author":"M. Yagiura","year":"2004","unstructured":"Yagiura, M., Ibaraki, T., Glover, F.: An Ejection Chains Approach for the Generalized Assignment Problem. INFORMS Journal on Computing\u00a016(2), 133\u2013151 (2004)","journal-title":"INFORMS Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11925903_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:46:15Z","timestamp":1619509575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11925903_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490241","9783540684237"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11925903_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}