Binary particle swarm optimization algorithm with mutation for multiple sequence alignment.
Multiple sequence alignment (MSA) is a fundamental and challenging problem in the analysis of biologic sequence. The MSA problem is hard to be solved directly, for it always results in exponential complexity with the scale of the problem. In this paper, we propose mutation-based binary particle swarm optimization (M-BPSO) for MSA solving. In the proposed M-BPSO algorithm, BPSO algorithm is conducted to provide alignments. Thereafter, mutation operator is performed to move out of local optima and speed up convergence. From simulation results of nucleic acid and amino acid sequences, it is shown that the proposed M-BPSO algorithm has superior performance when compared to other existing algorithms. Furthermore, this algorithm can be used quickly and efficiently for smaller and medium size sequences.
Long
Hai-Xia
HX
School of Information Technology, Jiangnam University, No. 1800, Lihudadao Road, Wuxi, Jiangsu 214122, China. haixia_long@163.com
Xu
Wen-Bo
WB
Sun
Jun
J
D000465:Algorithms; D000595:Amino Acid Sequence; D000818:Animals; D001483:Base Sequence; D008390:Markov Chains; D008954:Models, Biological; D009154:Mutation; D011336:Probability; D016415:Sequence Alignment / Q000379:methods*