Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Construct, merge, solve and adapt: Application to the repetition-free longest common subsequence problem

Autor
Blum, C.; Blesa, M.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2016-03
Volum
9595
Pàgina inicial
46
Pàgina final
57
DOI
https://doi.org/10.1007/978-3-319-30698-8_4 Obrir en finestra nova
Projecte finançador
Basque Foundation for Science
SGR Grup de Investigación Reconegut: Algorismes, Bioinformàtica, Complexitat i Métodes Formals
TIN2012-37930-C02-02
Repositori
http://hdl.handle.net/2117/102814 Obrir en finestra nova
URL
https://link.springer.com/chapter/10.1007/978-3-319-30698-8_4 Obrir en finestra nova
Resum
In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetition-free longest common subsequence problem. The applied algorithm, which is labelled Construct, Merge, Solve & Adapt, generates sub-instances based on merging the solution components found in randomly constructed solutions. These sub-instances are subsequently solved by means of an exact solver. Moreover, the considered sub-instances are dynamically changing due to ad...
Citació
Blum, C., Blesa, M. Construct, Merge, Solve and Adapt: Application to the repetition-free longest common subsequence problem. "Lecture notes in computer science", Març 2016, vol. 9595, p. 46-57.
Paraules clau
Hybrid Algorithm, Combining Metaheuristics With Ilp Solvers, Repetition-free Longest Common Subsequence Problem
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius