A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
Crossref DOI link: https://doi.org/10.1007/s10732-017-9329-x
Published Online: 2017-04-06
Published Print: 2018-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Blum, Christian
Blesa, Maria J.
Funding for this research was provided by:
Ministerio de EconomÃa y Competitividad (TIN2012-37930-C02-02)
Generalitat de Catalunya (SGR 2014:1034)
License valid from 2017-04-06