Journal
MEMETIC COMPUTING
Volume 7, Issue 2, Pages 119-133Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s12293-015-0157-y
Keywords
Particle swarm optimization; Multiple sequence alignment; Protein; Average pairwise sequence identity; Scoring schemes; Post-hoc analysis
Funding
- BTIS-sub DIC - DBT, Govt. of India
- Advanced Bioinformatics Centre - Govt. of Rajasthan at Birla Institute of Scientific Research
Ask authors/readers for more resources
This paper presents two-level particle swarm optimization (TL-PSO) algorithm as an effective framework for providing the solution of complex natured problems. Proposed approach is employed to solve a challenging problem of bioinformatics i.e. multiple sequence alignment (MSA) of proteins. The major challenge in MSA is the increasing complexity of the problem as soon as the number of sequences increases and average pairwise sequence identity (APSI) score decreases. Proposed TLPSO-MSA firstly maximizes the matched columns in level one followed by maximization of pairwise similarities in level two at the gbest solutions of level one. TLPSO-MSA efficiently handles the premature convergence and trapping in local optima related issues. The benchmark dataset for MSA of protein sequences are extracted from BAliBASE3.0. The special features of proposed algorithm is its prediction accuracy at very lower APSI scores. Proposed approach significantly outperforms the compared state-of-art competitive algorithms i.e. ALIGNER, MUSCLE, T-Coffee, MAFFT, ClustalW, DIALIGN-TX, ProbAlign and standard PSO algorithm. The claim is supported by the statistical significance testing using one way ANOVA followed by Bonferroni post-hoc analysis.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available