Evolutionary Algorithms for Solving Multi-Objective Problems
Evolutionary Algorithms for Solving Multi-Objective Problems
Inferring Phylogenetic Trees Using Evolutionary Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Gaphyl: An Evolutionary Algorithms Approach For The Study Of Natural Evolution
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Phylogenetic Tree Reconstruction Using Self-Adaptive Genetic Algorithm
BIBE '00 Proceedings of the 1st IEEE International Symposium on Bioinformatics and Biomedical Engineering
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Multi-objective evolutionary algorithms and phylogenetic inference with multiple data sets
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Progressive Tree Neighborhood Applied to the Maximum Parsimony Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Evolving phylogenetic trees: a multiobjective approach
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
Firefly algorithm, stochastic test functions and design optimisation
International Journal of Bio-Inspired Computation
A faster algorithm for calculating hypervolume
IEEE Transactions on Evolutionary Computation
A multiobjective proposal based on the firefly algorithm for inferring phylogenies
EvoBIO'13 Proceedings of the 11th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics
Hi-index | 0.00 |
Throughout the years, researchers have reported a wide variety of proposals to infer evolutionary histories from biological data. Recent studies suggested the use of matrices of genetic distances to represent phylogenetic topologies in population-based metaheuristics. A key question that must be addressed is the choice of a particular method to build phylogenies from evolutionary distances. In addition to this, there is a growing need to overcome the problems that arise when different optimality criteria describe conflicting hypotheses about the evolution of the input species. In this paper, we tackle the phylogenetic inference problem by using a multiobjective algorithm with matrix representation inspired by the bioluminescence of fireflies. Our main goal is to study the behaviour of several clustering and neighbor-joining methods applied to infer phylogenies from the distance matrices processed by our algorithm. Experimental results on four real nucleotide data sets point out the advantages and disadvantages of each proposal, in terms of multiobjective performance and processing times.