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...

Full description

Main Authors: Mora Gutiérrez, Roman Anselmo, Ramírez Rodríguez, Javier, Elizondo Cortéz, Mayra
Format: Artículo
Language: Español
Published: 2015
Online Access: http://revistas.ucr.ac.cr/index.php/matematica/article/view/2118
http://hdl.handle.net/10669/12989
Summary: 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.