{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:07:50Z","timestamp":1761808070011},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2016,10,6]],"date-time":"2016-10-06T00:00:00Z","timestamp":1475712000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Spanish Ministry for Economy and Comptetitiveness","award":["TIN2012-37930-C02-02"],"award-info":[{"award-number":["TIN2012-37930-C02-02"]}]},{"DOI":"10.13039\/501100003030","name":"AGAUR","doi-asserted-by":"crossref","award":["SGR 2014-1034"],"award-info":[{"award-number":["SGR 2014-1034"]}],"id":[{"id":"10.13039\/501100003030","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CONACYT","award":["253787"],"award-info":[{"award-number":["253787"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00500-016-2379-4","type":"journal-article","created":{"date-parts":[[2016,10,6]],"date-time":"2016-10-06T11:11:25Z","timestamp":1475752285000},"page":"4901-4915","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Large neighborhood search for the most strings with few bad columns problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Evelia","family":"Liz\u00e1rraga","sequence":"first","affiliation":[]},{"given":"Maria J.","family":"Blesa","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,6]]},"reference":[{"key":"2379_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.tcs.2013.05.037","volume":"498","author":"C Boucher","year":"2013","unstructured":"Boucher C, Landau GM, Levy A, Pritchard D, Weimann O (2013) On approximating string selection problems with outliers. Theor Comput Sci 498:107\u2013114","journal-title":"Theor Comput Sci"},{"key":"2379_CR2","doi-asserted-by":"crossref","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 (1997) Algorithms on strings, trees, and sequences. Computer science and computational biology. Cambridge University Press, Cambridge"},{"issue":"1","key":"2379_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01934514","volume":"24","author":"WJ Hsu","year":"1984","unstructured":"Hsu WJ, Du MW (1984) Computing a longest common subsequence for a set of strings. BIT Numer Math 24(1):45\u201359. doi: 10.1007\/BF01934514","journal-title":"BIT Numer Math"},{"issue":"1","key":"2379_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"GM Landau","year":"2001","unstructured":"Landau GM, Schmidt JP, Sokol D (2001) An algorithm for approxixmate tandem repeat. J Comput Biol 8(1):1\u201318","journal-title":"J Comput Biol"},{"key":"2379_CR5","doi-asserted-by":"crossref","unstructured":"Liz\u00e1rraga E, Blesa MJ, Blum C, Raidl GR (2015) On solving the most strings with few bad columns problem: an ILP model and heuristics. In: Proceedings of INISTA 2015\u2014international symposium on innovations in intelligent systems and applications, IEEE Press, pp 1\u20138","DOI":"10.1109\/INISTA.2015.7276795"},{"key":"2379_CR6","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, St\u00fctzle T, Birattari M (2011) The $$\\sf irace$$ irace package, iterated race for automatic algorithm configuration. Technical Report TR\/IRIDIA\/2011-004, IRIDIA, Universit\u00e9 libre de Bruxelles, Belgium","DOI":"10.32614\/CRAN.package.irace"},{"issue":"3","key":"2379_CR7","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/MEMB.2005.1436464","volume":"24","author":"C Meneses","year":"2005","unstructured":"Meneses C, Oliveira C, Pardalos P (2005) Optimization techniques for string selection and comparison problems in genomics. IEEE Eng Med Biol Mag 24(3):81\u201387","journal-title":"IEEE Eng Med Biol Mag"},{"key":"2379_CR8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10732-011-9177-z","volume":"18","author":"S Mousavi","year":"2012","unstructured":"Mousavi S, Babaie M, Montazerian M (2012) An improved heuristic for the far from most strings problem. J Heuristics 18:239\u2013262","journal-title":"J Heuristics"},{"key":"2379_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-9053-1","volume-title":"Optimization approaches for solving string selection problems. SpringerBriefs in optimization","author":"E Pappalardo","year":"2013","unstructured":"Pappalardo E, Pardalos PM, Stracquadanio G (2013) Optimization approaches for solving string selection problems. SpringerBriefs in optimization. Springer, New York"},{"key":"2379_CR10","doi-asserted-by":"crossref","unstructured":"Pisinger D, Ropke S (2010) Large neighborhood search. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics, International series in operations research and management science, vol 146. Springer, New York, pp 399\u2013419","DOI":"10.1007\/978-1-4419-1665-5_13"},{"issue":"1","key":"2379_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1009897903540","volume":"5","author":"S Rajasekaran","year":"2001","unstructured":"Rajasekaran S, Hu Y, Luo J, Nick H, Pardalos PM, Sahni S, Shaw G (2001) Efficient algorithms for similarity search. J Comb Optim 5(1):125\u2013132","journal-title":"J Comb Optim"},{"issue":"1","key":"2379_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/A:1009893719470","volume":"5","author":"S Rajasekaran","year":"2001","unstructured":"Rajasekaran S, Nick H, Pardalos PM, Sahni S, Shaw G (2001) Efficient algorithms for local alignment search. J Comb Optim 5(1):117\u2013124","journal-title":"J Comb Optim"},{"issue":"1","key":"2379_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"T Smith","year":"1981","unstructured":"Smith T, Waterman M (1981) Identification of common molecular subsequences. J Mol Biol 147(1):195\u2013197","journal-title":"J Mol Biol"},{"issue":"1","key":"2379_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S Vo\u00df","year":"2005","unstructured":"Vo\u00df S, Fink A, Duin C (2005) Looking ahead with the pilot method. Ann Oper Res 136(1):285\u2013302","journal-title":"Ann Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2379-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2379-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2379-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T20:03:27Z","timestamp":1718827407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2379-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,6]]},"references-count":14,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["2379"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2379-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,6]]}}}