Show simple item record

dc.contributor.authorBlum, Christian
dc.contributor.authorBlesa Aguilera, Maria Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2018-07-05T06:32:29Z
dc.date.available2018-07-05T06:32:29Z
dc.date.issued2018-06
dc.identifier.citationBlum, Christian, Blesa, M. A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. "Journal of heuristics", Juny 2018, vol. 24, núm. 3, p. 551-579.
dc.identifier.issn1381-1231
dc.identifier.urihttp://hdl.handle.net/2117/118970
dc.description.abstractThis paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has been shown that general purpose integer linear programming solvers are very efficient for solving many of the problem instances that were used so far in the literature. Therefore, in this work we extend the available benchmark set, adding larger instances to which integer linear programming solvers cannot be applied anymore. Moreover, we provide a comprehensive comparison of the approaches found in the literature. Based on the results we propose a hybrid between two of the best methods which turns out to inherit the complementary strengths of both methods.
dc.format.extent29 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
dc.subject.lcshHeuristic algorithms
dc.subject.otherRepetition-free longest common subsequence
dc.subject.otherHybrid metaheuristics
dc.subject.otherMatheuristic
dc.titleA comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem
dc.typeArticle
dc.subject.lemacHeurística
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1007/s10732-017-9329-x
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://link.springer.com/article/10.1007%2Fs10732-017-9329-x
dc.rights.accessOpen Access
local.identifier.drac23212957
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/MICINN/ TIN2012-37930-C02-02
dc.relation.projectidinfo:eu-repo/grantAgreement/AGAUR/2014 SGR 1034
local.citation.authorBlum, Christian; Blesa, M.
local.citation.publicationNameJournal of heuristics
local.citation.volume24
local.citation.number3
local.citation.startingPage551
local.citation.endingPage579


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder