Heuristic for solving the multiple alignment sequence problem

DOI10.15517/RMTA.V18I1.2118MaRDI QIDQ5177315zbMATH OpenOpenAlexFDO

Authors Roman Anselmo Mora-Gutiérrez, Javier Ramírez-Rodríguez, Mayra Elizondo-Cortés

Publication date 11 March 2015

Published in Revista de Matemática: Teoría y Aplicaciones (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15517/rmta.v18i1.2118

zbMATH Keywords

harmony searchhybrid metaheuristicmultiple sequence alignmentsimulated annealing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1785848
• scientific article; zbMATH DE number 2243390
• Hybrid iterated local search algorithm for solving multiple sequences alignment problem
• scientific article; zbMATH DE number 5171932
• Multiple DNA sequence alignment based on genetic simulated annealing techniques

Cited in

(5)

• Adaptation of the method of musical composition for solving the multiple sequence alignment problem
• Hybrid iterated local search algorithm for solving multiple sequences alignment problem
• Incorporating random pairwise dynamic programming with particle swarm optimization in solving multiple sequence alignment
• scientific article; zbMATH DE number 1785848 (Why is no real title available?)
• Multiple DNA sequence alignment based on genetic simulated annealing techniques

This page was built for publication: Heuristic for solving the multiple alignment sequence problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5177315)