Heuristic for solving the multiple alignment sequence problem
Guardado en:
| Autores: | , , |
|---|---|
| 格式: | artículo original |
| 狀態: | Versión publicada |
| Fecha de Publicación: | 2011 |
| 實物特徵: | 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. |
| País: | Portal de Revistas UCR |
| 機構: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 語言: | Español |
| OAI Identifier: | oai:portal.ucr.ac.cr:article/2118 |
| 在線閱讀: | https://revistas.ucr.ac.cr/index.php/matematica/article/view/2118 |
| Palabra clave: | 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 |