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

Molecular clock fork phylogenies: closed form analytic maximum likelihood solutions.

Benny Chor1, Sagi Snir

  • 1School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel. benny@cs.tau.ac.il

Systematic Biology
|March 15, 2005
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

A graph homomorphism approach for unraveling histories of metastatic cancers and viral outbreaks under evolutionary constraints.

Nature communications·2025
Same author

Evolution of gene order in prokaryotes is driven primarily by gene gain and loss.

bioRxiv : the preprint server for biology·2025
Same author

Evolution of gene order in prokaryotes is driven primarily by gene gain and loss.

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

The Multi-State Epigenetic Pacemaker enables the identification of combinations of factors that influence DNA methylation.

GeroScience·2024
Same author

Privacy-preserving biological age prediction over federated human methylation data using fully homomorphic encryption.

Genome research·2024
Same author

Enforcing Temporal Consistency in Migration History Inference.

Journal of computational biology : a journal of computational molecular cell biology·2024
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

Researchers developed analytic solutions for maximum likelihood (ML) phylogenetic tree selection in four-taxa, two-state character models under a molecular clock. This work proves a unique ML point for fork topologies, advancing computational phylogenetics.

Area of Science:

  • Computational phylogenetics
  • Evolutionary biology
  • Statistical modeling

Background:

  • Maximum likelihood (ML) is a key criterion for evolutionary tree selection.
  • Finding the global optimum for ML is computationally challenging.
  • Existing analytic solutions are limited to simple three-taxa models.

Purpose of the Study:

  • To derive general analytic solutions for ML phylogenetic tree selection in four-taxa models.
  • To address the increased complexity of four-taxa systems compared to three-taxa.
  • To prove uniqueness of the ML point for specific tree topologies.

Main Methods:

  • Formulating the ML problem as a constrained optimization problem.
  • Developing specialized algebraic techniques for molecular clock models.

Related Experiment Videos

  • Combining ultrametric properties with Hadamard conjugation for fork topologies.
  • Utilizing symbolic algebra software for closed-form solutions.

    • Main Results:

    • General analytic solutions derived for four-taxa, two-state character models under a molecular clock.
    • Substantial simplification of polynomial equations for fork topologies.
    • Proof of a unique (local and global) ML point for each fork topology.

    Conclusions:

    • The study provides novel analytic solutions for a more complex phylogenetic scenario.
    • The findings offer a significant advancement in the computational tractability of ML tree selection.
    • Uniqueness of the ML point for fork topologies simplifies phylogenetic inference.