{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:31:46Z","timestamp":1750307506186,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T00:00:00Z","timestamp":1247011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,8]]},"DOI":"10.1145\/1570256.1570275","type":"proceedings-article","created":{"date-parts":[[2009,7,21]],"date-time":"2009-07-21T13:32:17Z","timestamp":1248183137000},"page":"2053-2058","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A data-based coding of candidate strings in the closest string problem"],"prefix":"10.1145","author":[{"given":"Bryant A.","family":"Julstrom","sequence":"first","affiliation":[{"name":"St. Cloud State University, St. Cloud, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02679443"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00079-0"},{"key":"e_1_3_2_1_3_1","first-page":"326","volume-title":"Proceedings of the Fourth Brazilian Symposium on Mathematical and Computational Biology","author":"Gomes F.C.","year":"2005","unstructured":"F.C. Gomes , C.N. Meneses , P.M. Pardalos , and G.V.R. Viana . Parallel algorithm for the closest string problem. In R. Mondaini, editor , Proceedings of the Fourth Brazilian Symposium on Mathematical and Computational Biology , volume II , pages 326 -- 332 , 2005 . F.C. Gomes, C.N. Meneses, P.M. Pardalos, and G.V.R. Viana. Parallel algorithm for the closest string problem. In R. Mondaini, editor, Proceedings of the Fourth Brazilian Symposium on Mathematical and Computational Biology, volume II, pages 326--332, 2005."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45678-3_38"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00057-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506150"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11527503_70"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICBBE.2008.171"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/937976.938122"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1040.0090"},{"key":"e_1_3_2_1_11_1","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2178-2","volume-title":"Coding and Information Theory","author":"Roman S.","year":"1992","unstructured":"S. Roman . Coding and Information Theory , volume 134 of Graduate Texts in Mathematics . Springer , Berlin\/ Heidelberg , 1992 . S. Roman. Coding and Information Theory, volume 134 of Graduate Texts in Mathematics. Springer, Berlin\/Heidelberg, 1992."},{"key":"e_1_3_2_1_12_1","first-page":"2","volume-title":"Proceedings of the Third International Conference on Genetic Algorithms","author":"Syswerda G.","year":"1989","unstructured":"G. Syswerda . Uniform crossover in genetic algorithms. In J.D. Schaffer, editor , Proceedings of the Third International Conference on Genetic Algorithms , pages 2 -- 9 , San Mateo, CA , 1989 . Morgan Kaufmann Publishers. G. Syswerda. Uniform crossover in genetic algorithms. In J.D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 2--9, San Mateo, CA, 1989. Morgan Kaufmann Publishers."}],"event":{"name":"GECCO09: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Montreal Qu\u00e9bec Canada","acronym":"GECCO09"},"container-title":["Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1570256.1570275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1570256.1570275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:53Z","timestamp":1750249073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1570256.1570275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,8]]},"references-count":12,"alternative-id":["10.1145\/1570256.1570275","10.1145\/1570256"],"URL":"https:\/\/doi.org\/10.1145\/1570256.1570275","relation":{},"subject":[],"published":{"date-parts":[[2009,7,8]]},"assertion":[{"value":"2009-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}