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 algorithm for statistical alignment of sequences related by a binary tree.

J Hein1

  • 1Department of Ecology and Genetics, University of Aarhus, Ny Munkegade, Aarhus, Denmark. jotun.hein@biology.au.dk

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing
|March 27, 2001
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

Using Hologram-Based Augmented Reality in Anatomy Learning: The TEACHANATOMY Randomized Trial.

Academic medicine : journal of the Association of American Medical Colleges·2025
Same author

Characterization and application of nonlinear plastic materials for post-CPA pulse compression.

Optics letters·2020
Same author

Impact of white-spotting alleles, including W20, on phenotype in the American Paint Horse.

Animal genetics·2020
Same author

Efficient Laser-Driven Proton Acceleration from a Cryogenic Solid Hydrogen Target.

Scientific reports·2019
Same author

[Minimally invasive vs. open partial nephrectomy : Perioperative success and complication rates].

Der Urologe. Ausg. A·2018
Same author

[Primary hyperparathyroidism after obesity surgery].

Der Chirurg; Zeitschrift fur alle Gebiete der operativen Medizen·2014
Same journal

Trust, Reproducibility, and Progress: The Roles of Independent Blind Prediction and Assessment and Benchmarking in Computational Biology.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

The Evolving Cyberinfrastructure at the National Institutes of Health to Support Data and AI in Biomedical Research.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Applications of AI & ML in Biomanufacturing of Cell and Gene Therapies.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

AI for Health: Leveraging Artificial Intelligence to Revolutionize Healthcare.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

Workshop Introduction: Advances of AI Methods in Single Cell Spatial Omics.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
Same journal

DRIVE-KG: Enhancing variant-phenotype association discovery in understudied complex diseases using heterogeneous knowledge graphs.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2026
See all related articles

This study presents an efficient algorithm for calculating sequence probabilities under the Thorne-Kishino-Felsenstein model. The method utilizes Markov chains and stochastic walks for faster ancestral sequence reconstruction and alignment.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Estimating sequence evolution probabilities is crucial in phylogenetics.
  • Existing models, like the Thorne-Kishino-Felsenstein model, require efficient computational methods.
  • Reconstructing ancestral sequences and their alignments aids in understanding evolutionary processes.

Purpose of the Study:

  • To develop a novel algorithm for calculating the probability of sequence sets evolving under a specified binary tree and model.
  • To improve the computational efficiency of phylogenetic analyses involving ancestral sequence reconstruction.

Main Methods:

  • The algorithm defines a Markov chain to generate ancestral sequences and alignments at neighboring tree nodes.
  • A stochastic walk on the binary tree is employed, creating a Markov chain for ancestral sequences at internal nodes.

Related Experiment Videos

  • The computational complexity is analyzed in relation to sequence length and the number of sequences.

    • Main Results:

    • The algorithm successfully calculates probabilities for sequence sets evolving under the Thorne-Kishino-Felsenstein model.
    • The initial running time is O(l^2 kappa), with a potential improvement to O(l kappa).
    • This represents a significant advancement in the computational efficiency of phylogenetic inference.

    Conclusions:

    • The developed algorithm offers an efficient method for phylogenetic analysis.
    • The improved computational speed facilitates larger-scale evolutionary studies.
    • This work contributes to more accurate and scalable methods in computational evolutionary biology.