Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A hybrid metaheuristic for the longest common subsequence problem

Autor
Lozano, M.; Blum, C.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
2010-10
Número
6373
Pàgina inicial
1
Pàgina final
15
DOI
https://doi.org/10.1007/978-3-642-16054-7_1 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/11436 Obrir en finestra nova
URL
http://www.springerlink.com/content/?k=A+Hybrid+Metaheuristic+for+the+Longest+Common+Subsequence+Problem Obrir en finestra nova
Resum
The longest common subsequence problem is a classical string problem. It has applications, for example, in pattern recognition and bioinformatics. This contribution proposes an integrative hybrid metaheuristic for this problem. More specifically, we propose a variable neighborhood search that applies an iterated greedy algorithm in the improvement phase and generates the starting solutions by invoking either beam search or a greedy randomized procedure. The main motivation of this work is the la...
Citació
Lozano, M.; Blum, C. A hybrid metaheuristic for the longest common subsequence problem. "Lecture notes in computer science", Octubre 2010, núm. 6373, p. 1-15.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants