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
id RepoKERWA12989
recordtype dspace
spelling RepoKERWA129892017-08-08T18:50:25Z Heuristic for Solving the Multiple Alignment Sequence Problem Heurística para Solucionar el Problema Alineamiento Múltiple de Secuencias Mora Gutiérrez, Roman Anselmo Ramírez Rodríguez, Javier Elizondo Cortéz, Mayra 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. En el presente trabajo se desarrolló un nuevo algoritmo para resolver el problema de alineamiento múltiple de secuencias (AMS)que es un híbrido basado en las metaheurísticas de búsqueda de armonía (HS) y recocido simulado (RS). Este fue validado con la metodología de Julie Thompson. Es un algoritmo básico y los resultados obtenidos durante esta etapa son alentadores. 2015-05-19T18:58:32Z 2015-05-19T18:58:32Z 2011-03-18 00:00:00 2015-05-19T18:58:32Z info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion http://revistas.ucr.ac.cr/index.php/matematica/article/view/2118 http://hdl.handle.net/10669/12989 10.15517/rmta.v18i1.2118 es Revista de Matemática: Teoría y Aplicaciones Vol. 18 Núm. 1 2011 121-136 application/pdf
institution Universidad de Costa Rica
collection Repositorio KERWA
language Español
description 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.
format Artículo
author Mora Gutiérrez, Roman Anselmo
Ramírez Rodríguez, Javier
Elizondo Cortéz, Mayra
spellingShingle Mora Gutiérrez, Roman Anselmo
Ramírez Rodríguez, Javier
Elizondo Cortéz, Mayra
Heuristic for Solving the Multiple Alignment Sequence Problem
author_sort Mora Gutiérrez, Roman Anselmo
title Heuristic for Solving the Multiple Alignment Sequence Problem
title_short Heuristic for Solving the Multiple Alignment Sequence Problem
title_full Heuristic for Solving the Multiple Alignment Sequence Problem
title_fullStr Heuristic for Solving the Multiple Alignment Sequence Problem
title_full_unstemmed Heuristic for Solving the Multiple Alignment Sequence Problem
title_sort heuristic for solving the multiple alignment sequence problem
publishDate 2015
url http://revistas.ucr.ac.cr/index.php/matematica/article/view/2118
http://hdl.handle.net/10669/12989
_version_ 1679200904639676416
score 11.772393