{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:43Z","timestamp":1759638223927,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319116822"},{"type":"electronic","value":"9783319116839"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11683-9_7","type":"book-chapter","created":{"date-parts":[[2014,10,24]],"date-time":"2014-10-24T19:24:53Z","timestamp":1414178693000},"page":"79-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Beam-ACO for the Repetition-Free Longest Common Subsequence Problem"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria J.","family":"Blesa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Borja","family":"Calvo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1016\/j.dam.2009.04.023","volume":"158","author":"SS Adi","year":"2010","unstructured":"Adi, S.S., Braga, M.D.V., Fernandes, C.G., Ferreira, C.E., Martinez, F.V., Sagot, M.F., Stefanes, M.A., Tjandraatmadja, C., Wakabayashi, Y.: Repetition-free longest common subsquence. Disc. Appl. Math. 158, 1315\u20131324 (2010)","journal-title":"Disc. Appl. Math."},{"key":"7_CR2","volume-title":"Data structures and algorithms","author":"A Aho","year":"1983","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: Data structures and algorithms. Addison-Wesley, Reading (1983)"},{"key":"7_CR3","volume-title":"Proceedings of CEC 2010 - Congress on Evolutionary Computation","author":"C Blum","year":"2010","unstructured":"Blum, C.: Beam-ACO for the longest common subsequence problem. In: Fogel, G., et al. (eds.) Proceedings of CEC 2010 - Congress on Evolutionary Computation, vol. 2. IEEE Press, Piscataway (2010)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Trans. Man Syst. Cybern. - Part B 34(2), 1161\u20131172 (2004)","journal-title":"IEEE Trans. Man Syst. Cybern. - Part B"},{"issue":"20","key":"7_CR5","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.ipl.2010.07.015","volume":"110","author":"P Bonizzoni","year":"2010","unstructured":"Bonizzoni, P., Della Vedova, G.: Variants of constrained longest common subsequence. Inf. Process. Lett. 110(20), 877\u2013881 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10732-007-9038-y","volume":"14","author":"T Easton","year":"2008","unstructured":"Easton, T., Singireddy, A.: A large neighborhood search heuristic for the longest common subsequence problem. J. Heuristics 14(3), 271\u2013283 (2008)","journal-title":"J. Heuristics"},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology, Cambridge University Press, Cambridge (1997)"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1089\/10665270252935511","volume":"9","author":"T Jiang","year":"2002","unstructured":"Jiang, T., Lin, G., Ma, B., Zhang, K.: A general edit distance between RNA structures. J. Comput. Biol. 9(2), 371\u2013388 (2002)","journal-title":"J. Comput. Biol."},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1007\/11844297_94","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"BA Julstrom","year":"2006","unstructured":"Julstrom, B.A., Hinkemeyer, B.: Starting from scratch: growing longest common subsequences with evolution. In: Runarsson, T.P., Beyer, H.-G., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) PPSN 2006. LNCS, vol. 4193, pp. 930\u2013938. Springer, Heidelberg (2006)"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM 25, 322\u2013336 (1978)","journal-title":"J. ACM"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.cor.2007.07.006","volume":"36","author":"SJ Shyu","year":"2009","unstructured":"Shyu, S.J., Tsai, C.Y.: Finding the longest common subsequence for multiple biological sequences by ant colony optimization. Comput. Oper. Res. 36(1), 73\u201391 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T Smith","year":"1981","unstructured":"Smith, T., Waterman, M.: Identification of common molecular subsequences. J. Mol. Biol. 147(1), 195\u2013197 (1981)","journal-title":"J. Mol. Biol."},{"key":"7_CR13","volume-title":"Data Compression: Methods and Theory","author":"J Storer","year":"1988","unstructured":"Storer, J.: Data Compression: Methods and Theory. Computer Science Press, Rockville (1988)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11683-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T23:52:44Z","timestamp":1674172364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11683-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319116822","9783319116839"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11683-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"25 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}