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

Recursions for statistical multiple alignment.

Jotun Hein1, Jens Ledet Jensen, Christian N S Pedersen

  • 1Department of Statistics, Oxford University, South Parks Road, Oxford OX1 3SY, United Kingdom.

Proceedings of the National Academy of Sciences of the United States of America
|December 6, 2003
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

Ancestral protein sequence reconstruction using a tree-structured Ornstein-Uhlenbeck variational autoencoder.

... International Conference on Learning Representations·2026
Same author

An almost infinite sites model.

Theoretical population biology·2024
Same author

Comparing Phylogeographies to Reveal Incompatible Geographical Histories within Genomes.

Molecular biology and evolution·2024
Same author

Recoverability of ancestral recombination graph topologies.

Theoretical population biology·2023
Same author

The impact of COVID-19 certification mandates on the number of cases of and hospitalizations with COVID-19 in the UK: A difference-in-differences analysis.

Frontiers in public health·2023
Same author

Systematic inference of indirect transcriptional regulation by protein kinases and phosphatases.

PLoS computational biology·2022
Same journal

The TaMYB55-TaSnRK1α1-TabZIP9 module confers heat stress tolerance in wheat.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Superstatistics approach to turbulent circulation fluctuations.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

A molecular timescale for evolution of cobamide biosynthesis.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Pierre Chambon, a pioneer of molecular biology and gene regulation in eukaryotes.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Granulosa cell glycogen fuels the avascular corpus luteum.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same journal

Synthetic essentiality of TRAIL/TNFSF10 in VHL-deficient renal cell carcinoma.

Proceedings of the National Academy of Sciences of the United States of America·2026
See all related articles

New algorithms calculate sequence evolution probabilities under the Thorne-Kishino-Felsenstein model using Markov chains. These methods offer efficient computation for phylogenetic analysis, improving sequence alignment accuracy.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Molecular Evolution

Background:

  • Understanding sequence evolution is crucial for phylogenetic inference.
  • The Thorne-Kishino-Felsenstein model describes sequence evolution along phylogenetic trees.
  • Efficient algorithms are needed to compute probabilities for complex evolutionary scenarios.

Purpose of the Study:

  • To develop novel algorithms for calculating the probability of sequence sets evolving under the Thorne-Kishino-Felsenstein model.
  • To explore different recursive approaches for sequence probability computation on trees.
  • To analyze the computational complexity and probabilistic differences of these algorithms.

Main Methods:

  • Utilizing Markov chains to model sequence generation and alignment at tree nodes.

Related Experiment Videos

  • Developing two distinct recursive algorithms based on Markov chain decomposition.
  • Formulating an alternative recursion focusing on inner nodes of the phylogenetic tree.
  • Analyzing algorithmic running time complexity as O(Pi id=1 Li).

    • Main Results:

    • Two computationally similar yet probabilistically distinct recursive algorithms were derived.
    • The algorithms efficiently calculate probabilities for sequence sets related by a binary tree.
    • An alternative recursion using only inner nodes was successfully formulated.
    • The computational efficiency is dependent on sequence lengths and the number of sequences.

    Conclusions:

    • The presented algorithms provide efficient methods for probabilistic inference in molecular evolution.
    • The choice of recursion impacts probabilistic outcomes, necessitating careful consideration.
    • These algorithms can enhance phylogenetic analyses by accurately modeling sequence evolution.
    • The study contributes to the development of advanced computational tools for evolutionary biology.