An enhanced cooperative method to solve multiple-sequence alignment problem Online publication date: Tue, 09-Feb-2021
by Lamiche Chaabane
International Journal of Data Mining, Modelling and Management (IJDMMM), Vol. 13, No. 1/2, 2021
Abstract: In this research study, we aim to propose a novel cooperative approach called dynamic simulated particle swarm optimisation (DSPSO) which is based on metaheuristics and the pairwise dynamic programming (DP) procedure to find an approximate solution for the multiple-sequence alignment (MSA) problem. The developed approach applies the particle swarm optimisation (PSO) algorithm to discover the search space globally and the simulated annealing (SA) technique to improve the population leader quality in order to overcome local optimum problem. After that the dynamic programming technique is integrated as an improver mechanism in order to improve the worst solution quality and to increase the convergence speed of the proposed approach. Simulation results on BAliBASE benchmarks have shown the potent of the proposed method to produce good quality alignments comparing to those given by other literature existing methods.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Data Mining, Modelling and Management (IJDMMM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook