Heuristic for Solving the Multiple Alignment Sequence Problem

In this paper we developed a new algorithm for solving the problem of multiple sequence alignment (AM S), 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 obtain...

Descripción completa

Autores Principales: Mora Gutiérrez, Roman Anselmo, Ramírez Rodríguez, Javier, Elizondo Cortéz, Mayra
Formato: Artículo
Idioma: Español
Publicado: 2015
Acceso en línea: http://revistas.ucr.ac.cr/index.php/matematica/article/view/2118
http://hdl.handle.net/10669/12989
Sumario: In this paper we developed a new algorithm for solving the problem of multiple sequence alignment (AM S), 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.