Loading...
Loading...

Go to the content (press return)

A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem

Author
Blum, C.; Blesa, M.
Type of activity
Journal article
Journal
Journal of heuristics
Date of publication
2018-06
Volume
24
Number
3
First page
551
Last page
579
DOI
https://doi.org/10.1007/s10732-017-9329-x Open in new window
Project funding
Algorísmia, Bioinformàtica, Complexitat i Mètodes Formals ALBCOM
Técnicas de Optimización Bioinspirada basadas en bacterias y bancos de peces. Hibridaciones con técnicas exactas.
Repository
http://hdl.handle.net/2117/118970 Open in new window
URL
https://link.springer.com/article/10.1007%2Fs10732-017-9329-x Open in new window
Abstract
This 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 p...
Citation
Blum, 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.
Keywords
Hybrid metaheuristics, Matheuristic, Repetition-free longest common subsequence
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments