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

QuickJoin--fast neighbour-joining tree reconstruction.

Thomas Mailund1, Christian N S Pedersen

  • 1Bioinformatics Research Center (BiRC), University of Aarhus, Høegh-Guldbergs Grade 10, Bldg. 090, DK-8000 Arhus C, Denmark. mailund@birc.dk

Bioinformatics (Oxford, England)
|June 18, 2004
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

Genetic predictions of eye and hair colour in the Danish population.

Forensic science international. Genetics·2025
Same author

Bayesian inference of admixture graphs on Native American and Arctic populations.

PLoS genetics·2023
Same author

Author Correction: Comparative and demographic analysis of orang-utan genomes.

Nature·2022
Same author

Insights into bear evolution from a Pleistocene polar bear genome.

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

Targeted conservation genetics of the endangered chimpanzee.

Heredity·2020
Same author

Ancestral Population Genomics with Jocx, a Coalescent Hidden Markov Model.

Methods in molecular biology (Clifton, N.J.)·2020
Same journal

3DICE: Interpretable 3D Cross-Modal Learning for Drug-Target Interaction Prediction and Large-Scale Drug Discovery.

Bioinformatics (Oxford, England)·2026
Same journal

KASSPer: Kinase Active Site Structure Prediction using Protein and Ligand Language Models and Its Application to Virtual Screening.

Bioinformatics (Oxford, England)·2026
Same journal

IDR searcher: a search engine solution for public image resources.

Bioinformatics (Oxford, England)·2026
Same journal

KCFtools: Rapid alignment-free method for introgression screening and GWAS using k-mer profiles.

Bioinformatics (Oxford, England)·2026
Same journal

Meta2DB: Curated shotgun metagenomic feature sets and metadata for health state prediction.

Bioinformatics (Oxford, England)·2026
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
See all related articles

We developed a new tool for rapidly building large phylogenetic trees. This method constructs identical trees to the original neighbor-joining algorithm but is significantly faster, enabling analysis of 8000 species in under 10 minutes.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Evolutionary Biology

Background:

  • Phylogenetic trees are essential for understanding evolutionary relationships.
  • Constructing large phylogenetic trees can be computationally intensive and time-consuming.
  • Existing methods like QuickTree face limitations with very large datasets.

Purpose of the Study:

  • To develop a novel computational tool for the rapid construction of very large phylogenetic trees.
  • To improve the efficiency of phylogenetic tree building without compromising accuracy.
  • To enable the analysis of datasets with thousands of species on standard hardware.

Main Methods:

  • Implementation of a new tool utilizing heuristics to accelerate the neighbor-joining algorithm.

Related Experiment Videos

  • The algorithm ensures the construction of the exact same phylogenetic tree as the original neighbor-joining method.
  • Benchmarking against existing implementations like QuickTree.

    • Main Results:

    • The developed tool can construct phylogenetic trees for up to 8000 species in less than 10 minutes on a single desktop PC.
    • This represents a significant speed improvement compared to QuickTree, which requires over 30 minutes for the same task.
    • The heuristic approach maintains the accuracy of the neighbor-joining algorithm.

    Conclusions:

    • The new tool offers a highly efficient and accurate method for building very large phylogenetic trees.
    • This advancement facilitates large-scale evolutionary analyses previously limited by computational resources.
    • The tool democratizes the construction of complex phylogenetic trees, making it accessible on standard computing infrastructure.