Binary Particle Swarm Optimization Versus Hybrid Genetic Algorithm for Inferring Well Supported Phylogenetic Trees
The amount of completely sequenced chloroplast genomes increases rapidly every day, leading to the possibility to build large-scale phylogenetic trees of plant species. Considering a subset of close plant species defined according to their chloroplasts, the phylogenetic tree that can be inferred by their core genes is not necessarily well supported, due to the possible occurrence of “problematic” genes (i.e., homoplasy, incomplete lineage sorting, horizontal gene transfers, etc.) which may blur the phylogenetic signal. However, a trustworthy phylogenetic tree can still be obtained provided such a number of blurring genes is reduced. The problem is thus to determine the largest subset of core genes that produces the best-supported tree. To discard problematic genes and due to the overwhelming number of possible combinations, this article focuses on how to extract the largest subset of sequences in order to obtain the most supported species tree. Due to computational complexity, a distributed Binary Particle Swarm Optimization (BPSO) is proposed in sequential and distributed fashions. Obtained results from both versions of the BPSO are compared with those computed using an hybrid approach embedding both genetic algorithms and statistical tests. The proposal has been applied to different cases of plant families, leading to encouraging results for these families.
KeywordsChloroplasts Phylogeny Genetic algorithms Lasso test Binary Particle Swarm Optimization
All computations have been performed on the Mésocentre de calculs supercomputer facilities of the University of Franche-Comté.
- 3.AlKindy, B., Guyeux, C., Couchot, J.-F., Salomon, M., Parisod, C., Bahi, J.M.: Hybrid genetic algorithm and lasso test approach for inferring well supported phylogenetic trees based on subsets of chloroplastic core genes. In: Dediu, A.-H., Hernández-Quiroz, F., Martín-Vide, C., Rosenblueth, D.A. (eds.) AlCoB 2015. LNCS, vol. 9199, pp. 83–96. Springer, Heidelberg (2015)CrossRefGoogle Scholar
- 4.Alsrraj, R., Alkindy, B., Guyeux, C., Philippe, L., Couchot, J.-F.: Well-supported phylogenies using largest subsets of core-genes by discrete particle swarm optimization. In: CIBB 2015, 12th International Meeting on Computational Intelligence Methods for Bioinformatics and Biostatistics, Naples, Italy, September 2015Google Scholar
- 5.Alkindy, B., Couchot, J.-F., Guyeux, C., Mouly, A., Salomon, M., Bahi, J.M.: Finding the core-genes of chloroplasts. J. Biosci. Biochem. Bioinform. 4(5), 357–364 (2014)Google Scholar
- 6.Alkindy, B., Guyeux, C., Couchot, J.-F., Salomon, M., Bahi, J.M.: Gene similarity-based approaches for determining core-genes of chloroplasts. In: IEEE International Conference on Bioinformatics and Biomedicine (BIBM) (to Present) (2014)Google Scholar
- 8.Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)Google Scholar
- 9.Khanesar, M.A., Tavakoli, H., Teshnehlab, M., Shoorehdeli, M.A.: Novel binary particle swarm optimization, 11 (2009). www.intechopen.com, ISBN: 978-953-7619-48-0
- 11.Poli, R., Kennedy, J., Blackwell, T.: Particle swarm optimization. Swarm Intell. 1, 33–57 (2007). doi: 10.1007/s11721-007-0002-0. (Springer Science + Business Media)
- 12.Eberhart, R.C., Shi, Y.: Particle swarm optimization: developments, applications and resources. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 1, pp. 81–86. IEEE (2001)Google Scholar
- 14.Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, vol. 3. IEEE (1999)Google Scholar