Now showing items 1-1 of 1
Heuristic for Solving the Multiple Alignment Sequence Problem
Heurística para Solucionar el Problema Alineamiento Múltiple de Secuencias
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 ...