Molecular Biology and Evolution 19:1717-1726 (2002)
© 2002 Society for Molecular Biology and Evolution
Genetic Algorithms and Parallel Processing in Maximum-Likelihood Phylogeny Inference
*Section of Integrative Biology and Center for Computational Biology and Bioinformatics, University of Texas;
Department of Ecology and Evolutionary Biology, University of Connecticut
We investigated the usefulness of a parallel genetic algorithm for phylogenetic inference under the maximum-likelihood (ML) optimality criterion. Parallelization was accomplished by assigning each "individual" in the genetic algorithm "population" to a separate processor so that the number of processors used was equal to the size of the evolving population (plus one additional processor for the control of operations). The genetic algorithm incorporated branch-length and topological mutation, recombination, selection on the ML score, and (in some cases) migration and recombination among subpopulations. We tested this parallel genetic algorithm with large (228 taxa) data sets of both empirically observed DNA sequence data (for angiosperms) as well as simulated DNA sequence data. For both observed and simulated data, search-time improvement was nearly linear with respect to the number of processors, so the parallelization strategy appears to be highly effective at improving computation time for large phylogenetic problems using the genetic algorithm. We also explored various ways of optimizing and tuning the parameters of the genetic algorithm. Under the conditions of our analyses, we did not find the best-known solution using the genetic algorithm approach before terminating each run. We discuss some possible limitations of the current implementation of this genetic algorithm as well as of avenues for its future improvement.
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  D. A. Morrison Increasing the Efficiency of Searches for the Maximum Likelihood Tree in a Phylogenetic Analysis of up to 150 Nucleotide Sequences Syst Biol, December 1, 2007; 56(6): 988 - 1010. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 T. M. Keane, T. J. Naughton, and J. O. McInerney MultiPhyl: a high-throughput phylogenomics webserver using distributed computing Nucleic Acids Res., July 13, 2007; 35(suppl_2): W33 - W37. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 S. L. K. Pond and S. D. W. Frost A Genetic Algorithm Approach to Detecting Lineage-Specific Variation in Selection Pressure Mol. Biol. Evol., March 1, 2005; 22(3): 478 - 485. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 A. Stamatakis, T. Ludwig, and H. Meier RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees Bioinformatics, February 15, 2005; 21(4): 456 - 463. [Abstract] [Full Text] [PDF]
|
|
|
|
|
|
L. S. Vinh and A. von Haeseler IQPNNI: Moving Fast Through Tree Space and Stopping in Time Mol. Biol. Evol., August 1, 2004; 21(8): 1565 - 1571. [Abstract] [Full Text] [PDF]
|
|