Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Genetic algorithms and parallel processing in maximum-likelihood phylogeny inference.

Matthew J Brauer1, Mark T Holder, Laurie A Dries

  • 1Section of Integrative Biology and Center for Computational Biology and Bioinformatics, University of Texas, Austin 78712, USA. dhillis@utexas.edu

Molecular Biology and Evolution
|September 25, 2002
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Parallel sensory compensation following independent subterranean colonization by groundwater salamanders (<i>Eurycea</i>).

Proceedings of the National Academy of Sciences of the United States of America·2025
Same author

Distinguishing species boundaries from geographic variation.

Proceedings of the National Academy of Sciences of the United States of America·2025
Same author

A complete and dynamic tree of birds.

Proceedings of the National Academy of Sciences of the United States of America·2025
Same author

PAX6 protein in neuromasts of the lateral line system of salamanders (Eurycea).

PloS one·2024
Same author

Speeding up iterative applications of the BUILD supertree algorithm.

PeerJ·2024
Same author

Specimen collection is essential for modern science.

PLoS biology·2023

A parallel genetic algorithm significantly speeds up phylogenetic inference for large datasets. This computational approach improves search time linearly with more processors, making it effective for complex evolutionary analyses.

Area of Science:

  • Computational Biology
  • Evolutionary Biology
  • Bioinformatics

Background:

  • Phylogenetic inference aims to reconstruct evolutionary relationships.
  • Maximum-likelihood (ML) is a common criterion for evaluating phylogenetic trees.
  • Large datasets pose significant computational challenges for phylogenetic analysis.

Purpose of the Study:

  • To evaluate the effectiveness of a parallel genetic algorithm for phylogenetic inference using the maximum-likelihood criterion.
  • To assess the scalability and computational speed-up of the parallel approach for large phylogenetic datasets.

Main Methods:

  • Implemented a parallel genetic algorithm where each individual occupied a separate processor.
  • Incorporated genetic operators such as branch-length and topological mutation, and recombination.

Related Experiment Videos

  • Utilized the maximum-likelihood score for selection and explored population migration strategies.
  • Tested the algorithm on large empirical (angiosperm DNA) and simulated DNA sequence datasets (228 taxa).

    • Main Results:

    • Achieved nearly linear search-time improvement with an increasing number of processors.
    • Demonstrated high effectiveness in reducing computation time for large-scale phylogenetic problems.
    • Did not consistently find the optimal solution within the run time for the tested parameters.

    Conclusions:

    • Parallel genetic algorithms offer a highly effective strategy for accelerating phylogenetic inference on large datasets.
    • The parallelization approach shows excellent scalability, making it suitable for computationally intensive evolutionary analyses.
    • Further optimization of genetic algorithm parameters and implementation is needed to consistently find optimal phylogenetic solutions.