Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Beam-ACO for the repetition-free longest common subsequence problem

Autor
Blum, C.; Blesa, M.; Calvo, B.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
11th Biennal International Conference on Artificial Evolution
Any de l'edició
2013
Data de presentació
2013-10
Llibre d'actes
Artificial Evolution 2013 (Evolution Artificielle 2013): 11th Biennal International Conference on Artificial Evolution: proceedings: 21-23 October 2013, Bordeaux, France
Pàgina inicial
187
Pàgina final
198
Repositori
http://hdl.handle.net/2117/23345 Obrir en finestra nova
Resum
In this paper we propose a Beam-ACO approach for a combinatorial optimization problem known as the repetition-free longest common subsequence problem. Given two input sequences x and y over a ¿nite alphabet S, this problem concerns to ¿nd a longest common subsequence of x and y in which no letter is repeated. Beam-ACO algorithms are combinations between the metaheuristic ant colony optimization and a deterministic tree search technique called beam search. The algorithm that we present is an ad...
Citació
Blum, C.; Blesa, M.; Calvo, B. Beam-ACO for the repetition-free longest common subsequence problem. A: Biennal International Conference on Artificial Evolution. "Artificial Evolution 2013 (Evolution Artificielle 2013): 11th Biennal International Conference on Artificial Evolution: proceedings: 21-23 October 2013, Bordeaux, France". Bordeaux: 2013, p. 187-198.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants