{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:16Z","timestamp":1750307416693,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T00:00:00Z","timestamp":1278460800000},"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":[[2010,7,7]]},"DOI":"10.1145\/1830483.1830529","type":"proceedings-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T22:03:17Z","timestamp":1278885797000},"page":"249-256","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient stochastic local search algorithm for solving the shortest common supersequence problem"],"prefix":"10.1145","author":[{"given":"Ji\u0159\u00ed","family":"Kubal\u00edk","sequence":"first","affiliation":[{"name":"CTU Prague, Prague, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"36","article-title":"A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem. In C. Cotta and J. van Hemert (Eds.): EvoCOP 2007","volume":"4446","author":"Blum C.","year":"2007","journal-title":"LNCS"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01545528"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11494669_7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499305_9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90016-Q"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2006.883266"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979223842X"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11729976_14"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569944"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-642-04921-7_19","volume-title":"Adaptive and Natural Computing Algorithms.","author":"Kubalik J.","year":"2009"},{"key":"e_1_3_2_1_11_1","unstructured":"Kubalik J.: Solving the Shortest Common Supersequence Problem Using Iterative Optimization with Evolved Hypermutations. Accepted for presentation at 20th European Meetings on Cybernetics and Systems Research (EMCSR) University of Vienna Vienna April 6--9 2010.  Kubalik J.: Solving the Shortest Common Supersequence Problem Using Iterative Optimization with Evolved Hypermutations. Accepted for presentation at 20th European Meetings on Cybernetics and Systems Research (EMCSR) University of Vienna Vienna April 6--9 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2022.001.0001"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00078-3"},{"key":"e_1_3_2_1_15_1","first-page":"194","article-title":"Shotgun Sequence Assembly","volume":"60","author":"Pop M.","year":"2004","journal-title":"Advances in Computers"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01075212"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1994.1.337"}],"event":{"name":"GECCO '10: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Portland Oregon USA","acronym":"GECCO '10"},"container-title":["Proceedings of the 12th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830529","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1830483.1830529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:38Z","timestamp":1750246778000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1830483.1830529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,7]]},"references-count":17,"alternative-id":["10.1145\/1830483.1830529","10.1145\/1830483"],"URL":"https:\/\/doi.org\/10.1145\/1830483.1830529","relation":{},"subject":[],"published":{"date-parts":[[2010,7,7]]},"assertion":[{"value":"2010-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}