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

An optimal algorithm to reconstruct trees from additive distance data.

J J Hein

    Bulletin of Mathematical Biology
    |January 1, 1989
    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 journal

    Effects of Seasonal Births and Predation on Disease Spread.

    Bulletin of mathematical biology·2026
    Same journal

    Identifiability, Sensitivity, and Genetic Algorithms in Bacterial Biofilm Selection Models.

    Bulletin of mathematical biology·2026
    Same journal

    Slow Evolution Towards Generalism in a Model of Variable Dietary Range.

    Bulletin of mathematical biology·2026
    Same journal

    CBINN: Cancer Biology-Informed Neural Network for Unknown Parameter Estimation and Missing Physics Identification.

    Bulletin of mathematical biology·2026
    Same journal

    A Cost-Sensitive Behavioral Modeling Analysis of the Early Identification and Control of Infectious Diseases.

    Bulletin of mathematical biology·2026
    Same journal

    Tracking Dynamics of Superspreading Through Contacts, Exposures, and Transmissions in Edge-Based Network Epidemics.

    Bulletin of mathematical biology·2026
    See all related articles

    Reconstructing phylogenetic trees from distance data can be faster. New algorithms offer O(n*log(n)) efficiency for trees with bounded internal nodes, improving upon older O(n2) methods.

    Area of Science:

    • Computational Biology
    • Phylogenetics
    • Bioinformatics

    Background:

    • Phylogenetic tree reconstruction is crucial for understanding evolutionary relationships.
    • Current methods often rely on complete distance matrices, leading to high computational costs.
    • Operational Taxonomic Units (OTUs) represent the tips of the phylogenetic tree.

    Purpose of the Study:

    • To address the computational efficiency of phylogenetic tree reconstruction from additive distance data.
    • To investigate the impact of tree topology on algorithm complexity.
    • To develop more efficient algorithms for biologically relevant trees.

    Main Methods:

    • Analysis of algorithms for phylogenetic tree reconstruction.
    • Examination of computational complexity based on tree structure (node degrees).

    Related Experiment Videos

  • Comparison of existing O(n^2) methods with potential O(n*log(n)) approaches.

    • Main Results:

    • The use of complete distance matrices for n OTUs (Operational Taxonomic Units) results in O(n^2) computing time.
    • For trees with bounded internal node degrees, an O(n*log(n)) algorithm is feasible.
    • If internal nodes can have unbounded degrees, the problem retains an O(n^2) lower bound.

    Conclusions:

    • Existing phylogenetic reconstruction algorithms are computationally wasteful for many biologically realistic trees.
    • Optimized algorithms offer significant speedups for phylogenies with constrained branching.
    • The complexity of phylogenetic reconstruction is highly dependent on the tree's topological features.