{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:27:34Z","timestamp":1760646454489,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319306971"},{"type":"electronic","value":"9783319306988"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30698-8_4","type":"book-chapter","created":{"date-parts":[[2016,3,18]],"date-time":"2016-03-18T17:32:10Z","timestamp":1458322330000},"page":"46-57","source":"Crossref","is-referenced-by-count":17,"title":["Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]},{"given":"Maria J.","family":"Blesa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve and adapt a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10732-015-9286-1","volume":"21","author":"C Blum","year":"2015","unstructured":"Blum, C., Calvo, B.: A matheuristic for the minimum weight rooted arborescence problem. J. Heuristics 21(4), 479\u2013499 (2015)","journal-title":"J. Heuristics"},{"key":"4_CR3","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. Discrete Appl. Math. 158, 1315\u20131324 (2010)","journal-title":"Discrete Appl. Math."},{"key":"4_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology","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":"1","key":"4_CR5","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."},{"issue":"2","key":"4_CR6","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":"4_CR7","volume-title":"Data Compression: Methods and Theory","author":"J Storer","year":"1988","unstructured":"Storer, J.: Data Compression: Methods and Theory. Computer Science Press, MD (1988)"},{"key":"4_CR8","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":"4_CR9","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"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-319-11683-9_7","volume-title":"Artificial Evolution","author":"C Blum","year":"2014","unstructured":"Blum, C., Blesa, M.J., Calvo, B.: Beam-ACO for the repetition-free longest common subsequence problem. In: Legrand, P., Corsini, M.-M., Hao, J.-K., Monmarch\u00e9, N., Lutton, E., Schoenauer, M. (eds.) EA 2013. LNCS, vol. 8752, pp. 79\u201390. Springer, Heidelberg (2014)"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/j.orl.2013.09.002","volume":"41","author":"M Castelli","year":"2013","unstructured":"Castelli, M., Beretta, S., Vanneschi, L.: A hybrid genetic algorithm for the repetition free longest common subsequence problem. Oper. Res. Lett. 41(6), 644\u2013649 (2013)","journal-title":"Oper. Res. Lett."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T., Birattari, M.: The irace package, iterated race for automatic algorithm configuration. Technical report TR\/IRIDIA\/2011-004, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium (2011)","DOI":"10.32614\/CRAN.package.irace"},{"key":"4_CR13","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146, pp. 399\u2013419. Springer, US (2010)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30698-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T03:19:16Z","timestamp":1718421556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30698-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319306971","9783319306988"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30698-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}