Heuristic for solving the multiple alignment sequence problem
Guardat en:
| Autors: | , , |
|---|---|
| Format: | artículo original |
| Estat: | Versión publicada |
| Data de publicació: | 2011 |
| Descripció: | 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. |
| Pais: | Portal de Revistas UCR |
| Institution: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| Idioma: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/2118 |
| Accés en línia: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2118 |
| Paraula clau: | 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 |