Multiple sequence alignment using enhanced bird swarm align algorithm

2021 ◽  
pp. 1-18
Author(s):  
Hafiz Asadul Rehman ◽  
Kashif Zafar ◽  
Ayesha Khan ◽  
Abdullah Imtiaz
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Research Area ◽  
Evolutionary Information ◽  
Optimal Alignment ◽  
Biological Sequences ◽  
Multiple Sequence ◽  
Alignment Problem ◽  
Computationally Expensive ◽  
Bird Swarm Algorithm

Discovering structural, functional and evolutionary information in biological sequences have been considered as a core research area in Bioinformatics. Multiple Sequence Alignment (MSA) tries to align all sequences in a given query set to provide us ease in annotation of new sequences. Traditional methods to find the optimal alignment are computationally expensive in real time. This research presents an enhanced version of Bird Swarm Algorithm (BSA), based on bio inspired optimization. Enhanced Bird Swarm Align Algorithm (EBSAA) is proposed for multiple sequence alignment problem to determine the optimal alignment among different sequences. Twenty-one different datasets have been used in order to compare performance of EBSAA with Genetic Algorithm (GA) and Particle Swarm Align Algorithm (PSAA). The proposed technique results in better alignment as compared to GA and PSAA in most of the cases.

Resolving the multiple sequence alignment problem using biogeography-based optimization with multiple populations

2015 ◽  
Vol 13 (04) ◽  
pp. 1550016 ◽  
Author(s):  
El-Amine Zemali ◽  
Abdelmadjid Boukra
Keyword(s):  
Sequence Alignment ◽  
Dna Sequences ◽  
Multiple Sequence Alignment ◽  
Search Space ◽  
New Method ◽  
Average Score ◽  
Solution Quality ◽  
Multiple Sequence ◽  
Multiple Populations ◽  
Alignment Problem

The multiple sequence alignment (MSA) is one of the most challenging problems in bioinformatics, it involves discovering similarity between a set of protein or DNA sequences. This paper introduces a new method for the MSA problem called biogeography-based optimization with multiple populations (BBOMP). It is based on a recent metaheuristic inspired from the mathematics of biogeography named biogeography-based optimization (BBO). To improve the exploration ability of BBO, we have introduced a new concept allowing better exploration of the search space. It consists of manipulating multiple populations having each one its own parameters. These parameters are used to build up progressive alignments allowing more diversity. At each iteration, the best found solution is injected in each population. Moreover, to improve solution quality, six operators are defined. These operators are selected with a dynamic probability which changes according to the operators efficiency. In order to test proposed approach performance, we have considered a set of datasets from Balibase 2.0 and compared it with many recent algorithms such as GAPAM, MSA-GA, QEAMSA and RBT-GA. The results show that the proposed approach achieves better average score than the previously cited methods.

scholarly journals A Parallel Multiobjective Metaheuristic for Multiple Sequence Alignment

2017 ◽  
Author(s):  
Álvaro Rubio-Largo ◽  
Leonardo Vanneschi ◽  
Mauro Castelli ◽  
Miguel A. Vega-Rodríguez
Keyword(s):  
Sequence Alignment ◽  
Multiple Sequence Alignment ◽  
Time Complexity ◽  
Optimization Problem ◽  
Optimal Alignment ◽  
Multiple Sequence ◽  
Parallel Metaheuristics ◽  
Parallel Performance ◽  
Parallel Version ◽  
The Comparative Study

AbstractThe alignment among three or more nucleotides/amino-acids sequences at the same time is known as Multiple Sequence Alignment (MSA), an NP-hard optimization problem. The time complexity of finding an optimal alignment raises exponentially when the number of sequences to align increases. In this work, we deal with a multiobjective version of the MSA problem where the goal is to simultaneously optimize the accuracy and conservation of the alignment. A parallel version of the Hybrid Multiobjective Memetic Metaheuristics for Multiple Sequence Alignment is proposed. In order to evaluate the parallel performance of our proposal, we have selected a pull of datasets with different number of sequences (up to 1000 sequences) and study its parallel performance against other well-known parallel metaheuristics published in the literature, such as MSAProbs, T-Coffee, Clustal Ω, and MAFFT. The comparative study reveals that our parallel aligner is around 25 times faster than the sequential version with 32 cores, obtaining a parallel efficiency around 80%.

Sign in / Sign up

Export Citation Format

Share Document