Abstract
Multiple sequence alignment (MSA) is a basic operation in bioinformatics, which is known to be an NP-complete problem. With the advent of the post genetic era, the number of biological sequences is increasing exponentially, it is urgent to develop high-efficiency heuristic parallel algorithms to solve MSA. In this paper, a novel binary particle swarm optimization (NBPSO) is proposed for MSA. Firstly, a novel binary code is designed to encode particle to adapt PSO to MSA, velocity and position updating formulas are refined accordingly. Regarding of the ‘illegal’ phenomenon of MSA after positions updating, based on probability theory, an auxiliary particle re-initialization strategy is proposed. Multi-swarm PSO is used to make the searching more parallel, diversity index dt is proposed based on Hamming Distance, mutation takes place when dt falls below threshold. The proposed NBPSO-MSA is operated on two benchmarks, i.e., OX-Bench and BAliBASE. Experiments show that, NBPSO-MSA outperforms other 12 state-of-the art aligners in accuracy, the trajectories of particles show that, diversity index and mutation help multi-swarm NBPSO jump out of local optima and lead to rapid convergence.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Edgar, R.C.: MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res. 32(5), 1792–1797 (2004)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, Conference Proceedings, no. 4, pp. 1942–1948 (1995)
Yan, C.: Study on biological multi-sequence alignment based on probabilistic particle swarm optimization. Yanshan University (2010)
Sun, J., Palade, V., Wu, X., Fang, W.: Multiple sequence alignment with hidden markov models learned by random drift particle swarm optimization. IEEE/ACM Trans. Comput. Biol. Bioinf. 11(1), 243–257 (2014)
Zhan, Q., Wang, N., Jin, S., Tan, R., Jiang, Q., Wang, Y.: ProbPFP: a multiple sequence alignment algorithm combining partition function and hidden markov model with particle swarm optimization. In: 2018 IEEE International Conference on Bioinformatics and Biomedicine, vol. 2, no. 21, pp. 1290–1295 (2019)
Lalwani, S., Sharma, H., Mohan, M.K., Deep, K.: An efficient bi-level discrete PSO variant for multiple sequence alignment. In: Yadav, N., Yadav, A., Bansal, J.C., Deep, K., Kim, J.H. (eds.) Harmony Search and Nature Inspired Optimization Algorithms. AISC, vol. 741, pp. 797–807. Springer, Singapore (2019). https://doi.org/10.1007/978-981-13-0761-4_76
Álvaro, R., Vanneschi, L., Castelli, M., Miguel, A.V.R.: Swarm intelligence for optimizing the parameters of multiple sequence aligners. Swarm Evol. Comput. 42, 16–28 (2018)
Álvaro, R., Vanneschi, L., Castelli, M., Miguel, A.V.R.: A characteristic-based framework for multiple sequence aligners. IEEE Trans. Cybern. 48(1), 41–51 (2016)
Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Proceedings IEEE International Conference System Man Cybernetics, pp. 4104–4109 (1997)
Bansal, J.C., Singh, P.K., Saraswat, M., Verma, A., Jadon, S.S., Abraham, A.: Inertia weight strategies in particle swarm optimization. In: Proceedings 2011 3rd World Congress on Nature and Biologically Inspired Computing (NaBIC2011), pp. 633–640 (2011)
Iwamatsu, M.: Locating all the global minima using multi-species particle swarm optimizer: the inertia weight and the constriction factor variants. In: IEEE Congress on Evolutionary Computation, pp. 816–822 (2006)
Clerc, M., Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58–73 (2002)
Mendes, R., Kennedy, J., Neves, J.: Watch thy neighbor or how the swarm can learn from its environment. In: IEEE Swarm Intelligence Symposium, pp. 88–94 (2013)
Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10(3), 281–295 (2006)
Chen, W.N., Zhang, J., Chung, H.S., Zhong, W.L., Wu, W.G., Shi, Y.H.: A novel set-based particle swarm optimization method for discrete optimization problems. IEEE Trans. Evol. Comput. 14(2), 278–300 (2010)
Wu, H., Nie, C., Kuo, F., Leung, H., Colbourn, C.J.: A discrete particle swarm optimization for covering array generation. IEEE Trans. Evol. Comput. 19(4), 575–591 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Du, Y., He, J., Du, C. (2019). A Novel Binary Particle Swarm Optimization for Multiple Sequence Alignment. In: Huang, DS., Jo, KH., Huang, ZK. (eds) Intelligent Computing Theories and Application. ICIC 2019. Lecture Notes in Computer Science(), vol 11644. Springer, Cham. https://doi.org/10.1007/978-3-030-26969-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-26969-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26968-5
Online ISBN: 978-3-030-26969-2
eBook Packages: Computer ScienceComputer Science (R0)