{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:19:27Z","timestamp":1778249967347,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540239314","type":"print"},{"value":"9783540304999","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30499-9_30","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T09:41:13Z","timestamp":1277890873000},"page":"205-211","source":"Crossref","is-referenced-by-count":3,"title":["Closest Substring Problem \u2013 Results from an Evolutionary Algorithm"],"prefix":"10.1007","author":[{"given":"Holger","family":"Mauch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1109\/CSB.2003.1227407","volume-title":"Proceedings of the 2003 IEEE Bioinformatics Conference (CSB 2003)","author":"H. Mauch","year":"2003","unstructured":"Mauch, H., Melzer, M.J., Hu, J.S.: Genetic algorithm approach for the closest string problem. In: Proceedings of the 2003 IEEE Bioinformatics Conference (CSB 2003), Stanford, California, August 11\u201314, 2003, pp. 560\u2013561. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory of Computing Systems\u00a030, 113\u2013119 (1997)","journal-title":"Theory of Computing Systems"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45123-4_11","volume-title":"Combinatorial Pattern Matching","author":"L. G\u0105sieniec","year":"2000","unstructured":"G\u0105sieniec, L., Jansson, J., Lingas, A.: Approximation algorithms for hamming clustering problems. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 108\u2013118. Springer, Heidelberg (2000)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45678-3_38","volume-title":"Algorithms and Computation","author":"J. Gramm","year":"2001","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Exact solutions for CLOSEST STRING and related problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 441\u2013453. Springer, Heidelberg (2001)"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J.K. Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation\u00a0185, 41\u201355 (2003)","journal-title":"Information and Computation"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the closest string and substring problems. Journal of the ACM\u00a049, 157\u2013171 (2002)","journal-title":"Journal of the ACM"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z. (eds.): Evolutionary Computation 1 \u2013 Basic Algorithms and Operators. Institute of Physics Publishing, Bristol, UK (2000)","DOI":"10.1201\/9781420034349"},{"key":"30_CR8","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D. Goldberg","year":"1989","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"30_CR9","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)"},{"key":"30_CR10","unstructured":"Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming - An Introduction: On the Automatic Evolution of Computer Programs and its Applications. Morgan Kaufmann Publishers, Inc., San Francisco (1998)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Gen, M., Cheng, R.: Genetic Algorithms and Engineering Design. John Wiley and Sons, Inc., New York (1996)","DOI":"10.1002\/9780470172254"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Ono, I., Yamamura, M., Kobayashi, S.: A genetic algorithm for job-shop scheduling problems using job-based order crossover. In: Proceedings of IEEE International Conference on Evolutionary Computation (ICEC 1996), pp. 547\u2013552 (1996)","DOI":"10.1109\/ICEC.1996.542658"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-24855-2_51","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"J. Tavares","year":"2004","unstructured":"Tavares, J., Pereira, F.B., Costa, E.: Evolving golomb rulers. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol.\u00a03103, pp. 416\u2013417. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30499-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:08:22Z","timestamp":1778249302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30499-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239314","9783540304999"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30499-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}