Using MOEA with Redistribution and Consensus Branches to Infer Phylogenies

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

In recent years, to infer phylogenies, which are NP-hard problems, more and more research has focused on using metaheuristics. Maximum Parsimony and Maximum Likelihood are two effective ways to conduct inference. Based on these methods, which can also be considered as the optimal criteria for phylogenies, various kinds of multi-objective metaheuristics have been used to reconstruct phylogenies. However, combining these two time-consuming methods results in those multi-objective metaheuristics being slower than a single objective. Therefore, we propose a novel, multi-objective optimization algorithm, MOEA-RC, to accelerate the processes of rebuilding phylogenies using structural information of elites in current populations. We compare MOEA-RC with two representative multi-objective algorithms, MOEA/D and NAGA-II, and a non-consensus version of MOEA-RC on three real-world datasets. The result is, within a given number of iterations, MOEA-RC achieves better solutions than the other algorithms.

Cite

CITATION STYLE

APA

Min, X., Zhang, M., Yuan, S., Ge, S., Liu, X., Zeng, X., & Xia, N. (2018). Using MOEA with Redistribution and Consensus Branches to Infer Phylogenies. International Journal of Molecular Sciences, 19(1). https://doi.org/10.3390/ijms19010062

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free