{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:29:13Z","timestamp":1759847353334,"version":"3.40.5"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"name":"AGAUR, Generalitat de Catalunya"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1016\/j.asoc.2017.10.005","type":"journal-article","created":{"date-parts":[[2017,10,18]],"date-time":"2017-10-18T21:46:57Z","timestamp":1508363217000},"page":"15-28","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem"],"prefix":"10.1016","volume":"62","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8246-9926","authenticated-orcid":false,"given":"Maria J.","family":"Blesa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.asoc.2017.10.005_bib0005","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S1570-8667(03)00080-7","article-title":"The longest common subsequence problem for arc-annotated sequences","volume":"2","author":"Jiang","year":"2004","journal-title":"J. Discr. Alg."},{"key":"10.1016\/j.asoc.2017.10.005_bib0010","series-title":"Proceedings of CPM 1999-10th Annual Symposium on Combinatorial Pattern Matching, Vol. 1645 of Lecture Notes in Computer Science","first-page":"270","article-title":"Finding common subsequences with arcs and pseudoknots","author":"Evans","year":"1999"},{"key":"10.1016\/j.asoc.2017.10.005_bib0015","doi-asserted-by":"crossref","DOI":"10.1093\/bib\/bbw009","article-title":"A comprehensive study of RNA secondary structure alignment algorithms","author":"Chiu","year":"2016","journal-title":"Brief. Bioinformatics"},{"issue":"2","key":"10.1016\/j.asoc.2017.10.005_bib0020","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00224-008-9101-6","article-title":"A new efficient algorithm for computing the longest common subsequence","volume":"45","author":"Iliopoulos","year":"2009","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"10.1016\/j.asoc.2017.10.005_bib0025","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1016\/j.orl.2013.09.002","article-title":"A hybrid genetic algorithm for the repetition free longest common subsequence problem","volume":"41","author":"Castelli","year":"2013","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.asoc.2017.10.005_bib0030","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. ACM"},{"issue":"12","key":"10.1016\/j.asoc.2017.10.005_bib0035","doi-asserted-by":"crossref","first-page":"3178","DOI":"10.1016\/j.cor.2009.02.005","article-title":"Beam search for the longest common subsequence problem","volume":"36","author":"Blum","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2017.10.005_bib0040","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1016\/j.cor.2011.02.026","article-title":"An improved algorithm for the longest common subsequence problem","volume":"39","author":"Mousavi","year":"2012","journal-title":"Comput. Oper. Res."},{"year":"1999","series-title":"Algorithms and Complexity for Annotated Sequence Analysis (Ph.D. thesis)","author":"Evans","key":"10.1016\/j.asoc.2017.10.005_bib0045"},{"issue":"2","key":"10.1016\/j.asoc.2017.10.005_bib0050","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1089\/10665270252935511","article-title":"A general edit distance between RNA structures","volume":"9","author":"Jiang","year":"2002","journal-title":"J. Comput. Biol."},{"issue":"1","key":"10.1016\/j.asoc.2017.10.005_bib0055","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Mol. Biol."},{"year":"2012","series-title":"Combinatorial Objects in Bio-Algorithmics: Related Problems and Complexities (Ph.D. thesis)","author":"Blin","key":"10.1016\/j.asoc.2017.10.005_bib0060"},{"issue":"3","key":"10.1016\/j.asoc.2017.10.005_bib0065","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/S0022-0000(02)00004-1","article-title":"The longest common subsequence problem for sequences with nested arc annotations","volume":"65","author":"Lin","year":"2002","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.asoc.2017.10.005_bib0070","series-title":"Proceedings of WALCOM 2010 \u2013 International Workshop on Algorithms and Computation, Vol. 5942 of Lecture Notes in Computer Science","first-page":"149","article-title":"Comparing RNA structures with biologically relevant operations cannot be done without strong combinatorial restrictions","author":"Blin","year":"2010"},{"key":"10.1016\/j.asoc.2017.10.005_bib0075","series-title":"Proceedings of PCM 2000 \u2013 Annual Symposium on Combinatorial Pattern Matching, Vol. 1848 of Lecture Notes in Computer Science","first-page":"154","article-title":"The longest common subsequence problem for arc-annotated sequences","author":"Jiang","year":"2000"},{"key":"10.1016\/j.asoc.2017.10.005_bib0080","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/CEC.2017.7969305","article-title":"A hybrid evolutionary algorithm based on solution merging for the longest arc-preserving common subsequence problem","author":"Blum","year":"2017","journal-title":"Proceedings of CEC 2017 \u2013 IEEE Congress on Evolutionary Computation, IEEE press"},{"year":"1988","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","key":"10.1016\/j.asoc.2017.10.005_bib0085"},{"year":"2016","series-title":"Metaheuristics for String Problems in Bio-informatics","author":"Blum","key":"10.1016\/j.asoc.2017.10.005_bib0090"},{"key":"10.1016\/j.asoc.2017.10.005_bib0095","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","article-title":"Optimized crossover for the independent set problem","volume":"45","author":"Aggarwal","year":"1997","journal-title":"Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.005_bib0100","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","article-title":"A greedy genetic algorithm for the quadratic assignment problem","volume":"27","author":"Ahuja","year":"2000","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.005_bib0105","series-title":"Proceedings of GECCO 2006 \u2013 Genetic and Evolutionary Computation Conference","first-page":"515","article-title":"A new hybrid evolutionary algorithm for the k-cardinality tree problem","author":"Blum","year":"2006"},{"issue":"3","key":"10.1016\/j.asoc.2017.10.005_bib0110","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1016\/j.ejor.2007.06.060","article-title":"Genetic algorithms for a supply management problem: MIP-recombination vs. greedy decoder","volume":"195","author":"Borisovsky","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.005_bib0115","series-title":"Proceedings of EvoCOP 2016-16th European Conference on Evolutionary Computation in Combinatorial Optimization, Vol. 9595 of Lecture Notes in Computer Science","first-page":"138","article-title":"Experimental evaluation of two approaches to optimal recombination for permutation problems","author":"Eremeev","year":"2016"},{"issue":"1","key":"10.1016\/j.asoc.2017.10.005_bib0120","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1162\/evco.2008.16.1.127","article-title":"On complexity of optimal recombination for binary representations of solutions","volume":"16","author":"Eremeev","year":"2008","journal-title":"Evol. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2017.10.005_bib0125","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2298\/YJOR130731040E","article-title":"Optimal recombination in genetic algorithms for combinatorial optimization problems. Part I","volume":"24","author":"Eremeev","year":"2014","journal-title":"Yugoslav J. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2017.10.005_bib0130","doi-asserted-by":"crossref","first-page":"165","DOI":"10.2298\/YJOR131030041E","article-title":"Optimal recombination in genetic algorithms for combinatorial optimization problems. Part II","volume":"24","author":"Eremeev","year":"2014","journal-title":"Yugoslav J. Oper. Res."},{"key":"10.1016\/j.asoc.2017.10.005_bib0135","series-title":"Handbook of Metaheuristics, 2nd ed., Vol. 146 of International Series in Operations Research & Management Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","article-title":"Large neighborhood search","author":"Pisinger","year":"2010"},{"issue":"3","key":"10.1016\/j.asoc.2017.10.005_bib0140","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/0206038","article-title":"Finding a maximum independent set","volume":"6","author":"Tarjan","year":"1977","journal-title":"SIAM J. Comput."},{"year":"1995","series-title":"Subsequences and Supersequences of Strings (Ph.D. thesis)","author":"Fraser","key":"10.1016\/j.asoc.2017.10.005_bib0145"},{"key":"10.1016\/j.asoc.2017.10.005_bib0150","first-page":"1006","article-title":"Fast algorithms for finding the common subsequences of multiple sequences","author":"Huang","year":"2004","journal-title":"Proceedings of the 2004 International Computer Symposium, IEEE press"},{"issue":"1","key":"10.1016\/j.asoc.2017.10.005_bib0155","doi-asserted-by":"crossref","DOI":"10.1093\/nar\/27.1.314","article-title":"The ribonuclease P database","volume":"27","author":"Brown","year":"1999","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/j.asoc.2017.10.005_bib0160","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","article-title":"The irace package: iterated racing for automatic algorithm configuration","volume":"3","author":"L\u00f3pez-Ib\u00e1 nez","year":"2016","journal-title":"Oper. Res. Perspect."},{"key":"10.1016\/j.asoc.2017.10.005_bib0165","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.asoc.2014.02.009","article-title":"Replication and comparison of computational experiments in applied evolutionary computing: common pitfalls and guidelines to avoid them","volume":"19","author":"\u010crepin\u0161ek","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2017.10.005_bib0170","first-page":"2677","article-title":"An extension on \u201cstatistical comparisons of classifiers over multiple data sets\u201d for all pairwise comparisons","volume":"9","author":"Garc\u00eda","year":"2008","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"10.1016\/j.asoc.2017.10.005_bib0175","doi-asserted-by":"crossref","first-page":"248","DOI":"10.32614\/RJ-2016-017","article-title":"scmamp: statistical comparison of multiple algorithms in multiple problems","volume":"8","author":"Calvo","year":"2016","journal-title":"R J."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494617306087?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494617306087?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T17:21:16Z","timestamp":1570209676000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494617306087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":35,"alternative-id":["S1568494617306087"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2017.10.005","relation":{},"ISSN":["1568-4946"],"issn-type":[{"type":"print","value":"1568-4946"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2017.10.005","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}