Heuristic for solving the multiple alignment sequence problem
Uloženo v:
Autoři: | , , |
---|---|
Médium: | artículo original |
Stav: | Versión publicada |
Datum vydání: | 2011 |
Popis: | In this paper we developed a new algorithm for solving the problem of multiple sequence alignment (AMS), which is a hybrid metaheuristic based on harmony search and simulated annealing. The hybrid was validated with the methodology of Julie Thompson. This is a basic algorithm and and results obtained during this stage are encouraging. |
Země: | Portal de Revistas UCR |
Instituce: | Universidad de Costa Rica |
Repositorio: | Portal de Revistas UCR |
Jazyk: | Español |
OAI Identifier: | oai:portal.ucr.ac.cr:article/2118 |
On-line přístup: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2118 |
Access Level: | acceso abierto |
Klíčové slovo: | multiple sequence alignment harmony search hybrid metaheuristic simulated annealing alineamiento múltiple de secuencias búsqueda de la armonía metaheurística híbrida recocido simulado |