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

Phylogenetic diversity within seconds.

Bui Quang Minh1, Steffen Klaere, Arndt von Haeseler

  • 1Center for Integrative Bioinformatics, Vienna, Max F Perutz Laboratories, University of Vienna, Medical University of Vienna, Veterinary University of Vienna, Dr-Bohr-Gasse 9/6, A-1030, Vienna, Austria.

Systematic Biology
|October 25, 2006
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

GTRspmix: Capturing Heterogeneity of Exchangeabilities Across Sites to Improve Protein Phylogenetics.

bioRxiv : the preprint server for biology·2026
Same author

IQ-TREE 3: phylogenomic inference software using complex evolutionary models.

Molecular biology and evolution·2026
Same author

piqtree: a python package for seamless phylogenetic inference with IQ-TREE.

Molecular biology and evolution·2026
Same author

Rate variation and recurrent sequence errors in pandemic-scale phylogenetics.

Nature methods·2026
Same author

Phylogenetic Accuracy Under Non-Stationary and Non-Homogeneous Conditions: A Simulation Study.

Systematic biology·2026
Same author

Genomic GC bias correction improves species abundance estimation from metagenomic data.

Nature communications·2025
Same journal

Diversification dynamics in the global radiation of gobies.

Systematic biology·2026
Same journal

Correction to: nQMaker: Estimating Time Nonreversible Amino Acid Substitution Models.

Systematic biology·2026
Same journal

Phylogenomic challenges in polyploid-rich lineages: Insights from paralog processing and reticulation methods using the complex genus Packera (Asteraceae: Senecioneae).

Systematic biology·2026
Same journal

An evolving view of phylogenetic biogeography.

Systematic biology·2026
Same journal

Modeling Site-and-Branch-Heterogeneity with GFmix.

Systematic biology·2026
Same journal

Coalescent-based branch length estimation improves dating of species trees.

Systematic biology·2026
See all related articles

This study introduces two efficient algorithms for calculating maximal phylogenetic diversity in large datasets. These methods can identify optimal subsets of taxa in trees with over 100,000 leaves in seconds.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Algorithm Analysis

Background:

  • Phylogenetic diversity quantifies evolutionary history within a set of taxa.
  • Calculating maximal phylogenetic diversity is crucial for biodiversity assessment and conservation.
  • Previous methods were computationally intensive for large datasets.

Purpose of the Study:

  • To develop and present time-efficient algorithms for computing maximal phylogenetic diversity.
  • To enable the analysis of large phylogenetic trees with numerous taxa.
  • To provide practical tools for evolutionary and biodiversity research.

Main Methods:

  • Introduced two novel algorithms: a greedy algorithm and a pruning algorithm.
  • Analyzed the time complexity of both algorithms as O(n log k) and O[n + (n-k) log (n-k)], respectively.

Related Experiment Videos

  • Implemented and tested algorithms on phylogenetic trees with up to 100,000 taxa.

    • Main Results:

    • Both algorithms efficiently compute maximal phylogenetic diversity.
    • The greedy algorithm is an optimized implementation of the greedy strategy.
    • The pruning algorithm offers an alternative computational approach to the same problem.
    • Algorithms achieve results within seconds even for very large datasets.

    Conclusions:

    • The developed algorithms significantly improve the efficiency of maximal phylogenetic diversity computation.
    • These methods are scalable and suitable for analyzing large-scale phylogenetic data.
    • The findings facilitate advanced research in evolutionary biology and biodiversity studies.