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

A sufficient condition for reducing recursions in hidden Markov models.

Yun S Song1

  • 1Department of Statistics, University of Oxford, 1 South Parks Road, Oxford, OX1 3TG, UK. yssong@cs.ucdavis.edu

Bulletin of Mathematical Biology
|June 24, 2006
PubMed
Summary

We developed a method to simplify recursion relations in hidden Markov models (HMMs). This simplification removes dependence on Markov states, streamlining probability calculations for specific HMM applications.

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

Replaying germinal center evolution on a quantified affinity landscape.

Cell·2026
Same author

Tree reconstruction guarantees from CRISPR-Cas9 lineage tracing data using Neighbor-Joining.

Genome research·2026
Same author

Hypervariable loop profiling decodes sequence determinants of antibody stability.

Nature structural & molecular biology·2026
Same author

Inference of germinal center evolutionary dynamics via simulation-based deep learning.

eLife·2026
Same author

Separating selection from mutation in antibody language models.

eLife·2026
Same author

Mapping cis-regulatory mutations at scale in sorghum enables modulation of gene expression.

Nature biotechnology·2026

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Statistical Modeling

Background:

  • Hidden Markov models (HMMs) are widely used for sequence analysis.
  • Calculating observation probabilities in HMMs often involves complex recursion relations.
  • Simplifying these relations can significantly improve computational efficiency.

Purpose of the Study:

  • To derive a sufficient condition for simplifying recursion relations in a specific class of HMMs.
  • To develop a reduced recursion method that eliminates dependence on underlying Markov states.
  • To demonstrate the applicability of this method using a practical example.

Main Methods:

  • Formulation of a sufficient condition for recursion relation simplification.
  • Construction of a reduced recursion formula.

Related Experiment Videos

  • Application and validation of the method on the TKF-model for statistical multiple alignment.

    • Main Results:

    • A novel sufficient condition was established for simplifying HMM recursion relations.
    • A reduced recursion was successfully constructed, removing Markov state dependence.
    • The method was shown to be effective in the context of statistical multiple alignment.

    Conclusions:

    • The identified sufficient condition provides a pathway to more efficient HMM computations.
    • The developed reduced recursion offers a computationally advantageous alternative for specific HMM applications.
    • This approach has direct implications for sequence alignment and related bioinformatics tasks.