An enhanced cooperative method to solve multiple-sequence alignment problem

Lamiche Chaabane

International Journal of Data Mining, Modelling and Management, 2021, vol. 13, issue 1/2, 1-16

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.

Keywords: cooperative approach; multiple-sequence alignment; MSA; DSPSO; particle swarm optimisation; PSO; SA; DP; BAliBASE benchmarks. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=112907 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:13:y:2021:i:1/2:p:1-16

Access Statistics for this article

More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().