Now showing items 1-2 of 2
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 ...
An optimization algorithm inspired by musical composition in constrained optimization problems
Un algoritmo de optimización inspirado en composición musical para el problema de optimización con restricciones
Many real-world problems can be expressed as an instance of the constrained nonlinear optimization problem (CNOP). This problem has a set of constraints specifies the feasible solution space. In the last years several ...