{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:21Z","timestamp":1750307301478,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,12]],"date-time":"2011-07-12T00:00:00Z","timestamp":1310428800000},"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":[[2011,7,12]]},"DOI":"10.1145\/2001576.2001620","type":"proceedings-article","created":{"date-parts":[[2011,7,15]],"date-time":"2011-07-15T12:25:09Z","timestamp":1310732709000},"page":"315-322","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Evolutionary-based iterative local search algorithm for the shortest common supersequence problem"],"prefix":"10.1145","author":[{"given":"Jiri","family":"Kubalik","sequence":"first","affiliation":[{"name":"Czech Technical University, Prague, Czech Rep"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,7,12]]},"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\/1830483.1830529"},{"key":"e_1_3_2_1_10_1","unstructured":"Ning K. and Leong H. W.: Towards a better solution to the shortest common supersequence problem: the decomposition and reduction algorithm. BMC Bioinformatics 2006 7(Suppl 4): S12 doi: 10.1186\/1471--2105--7-S4-S12 2006.  Ning K. and Leong H. W.: Towards a better solution to the shortest common supersequence problem: the decomposition and reduction algorithm. BMC Bioinformatics 2006 7(Suppl 4):S12 doi: 10.1186\/1471--2105--7-S4-S12 2006."},{"key":"e_1_3_2_1_11_1","unstructured":"Ning K. Ng H.K. Leong H.W.: Analysis of the Relationships among Longest Common Subsequences Shortest Common Supersequences and Patterns and its application on Pattern Discovery in Biological Sequences. CoRR abs\/0903.2310: (2009).  Ning K. Ng H.K. Leong H.W.: Analysis of the Relationships among Longest Common Subsequences Shortest Common Supersequences and Patterns and its application on Pattern Discovery in Biological Sequences. CoRR abs\/0903.2310: (2009)."},{"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","first-page":"i156","volume-title":"Bioinformatics","volume":"19","author":"Rahmann S."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01075212"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1994.1.337"}],"event":{"name":"GECCO '11: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Dublin Ireland","acronym":"GECCO '11"},"container-title":["Proceedings of the 13th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001576.2001620","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2001576.2001620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:54Z","timestamp":1750244394000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2001576.2001620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,12]]},"references-count":18,"alternative-id":["10.1145\/2001576.2001620","10.1145\/2001576"],"URL":"https:\/\/doi.org\/10.1145\/2001576.2001620","relation":{},"subject":[],"published":{"date-parts":[[2011,7,12]]},"assertion":[{"value":"2011-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}