|
Título:
|
Beam-ACO for the longest common subsequence problem
|
|
Autor/a:
|
Blum, Christian
|
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
|
Abstract:
|
The longest common subsequence problem is classical string problem. It has applications, for example, in pattern
recognition and bioinformatics. In this work we present a socalled Beam-ACO approach for solving this problem. Beam-ACO algorithms are hybrid techniques that results from a
combination of ant colony optimization and beam search, which is an incomplete branch and bound derivative. Our results show that Beam-ACO is able to find new best solutions for 31 out of 60 benchmark instances that we chose for the experimental evaluation of the algorithm. |
|
Abstract:
|
Peer Reviewed |
|
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat
-Ant colony optimization
-Beam search
-Mathematical optimization
-Optimització matemàtica
-Algorisme de la colònia de formigues |
|
Derechos:
|
|
|
Tipo de documento:
|
Artículo - Versión publicada
Objeto de conferencia |
|
Editor:
|
IEEE Computer Society Publications
|
|
Compartir:
|
|
