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

Algorithms for variable length Markov chain modeling.

Gill Bejerano1

  • 1Center for Biomolecular Science and Engineering, School of Engineering, University of California, Santa Cruz, CA 95064, USA. jill@soe.ucsc.edu

Bioinformatics (Oxford, England)
|January 31, 2004
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

Avoiding genetic racial profiling in criminal DNA profile databases.

Nature computational science·2024
Same author

Whole-genome Comparisons Identify Repeated Regulatory Changes Underlying Convergent Appendage Evolution in Diverse Fish Lineages.

Molecular biology and evolution·2023
Same author

Analysis of structural variation among inbred mouse strains.

BMC genomics·2023
Same author

Whole-genome comparisons identify repeated regulatory changes underlying convergent appendage evolution in diverse fish lineages.

bioRxiv : the preprint server for biology·2023
Same author

WhichTF is functionally important in your open chromatin data?

PLoS computational biology·2022
Same author

Discovering monogenic patients with a confirmed molecular diagnosis in millions of clinical notes with MonoMiner.

Genetics in medicine : official journal of the American College of Medical Genetics·2022
Same journal

conMItion: an R package adjusting confounding factors for associations in multi-omics.

Bioinformatics (Oxford, England)·2026
Same journal

SpaMFG: a Spatial Multi-omics Integration Method based on Feature Grouping.

Bioinformatics (Oxford, England)·2026
Same journal

CSCN: Inference of Cell-Specific Causal Networks Using Single-Cell RNA-Seq Data.

Bioinformatics (Oxford, England)·2026
Same journal

Sparse CCA-Based Mediation Analysis with High-Dimensional Exposures and Mediators.

Bioinformatics (Oxford, England)·2026
Same journal

Enhancing Cross-Context Generalization in Drug Perturbation Prediction with a Multimodal Conditional Diffusion Framework.

Bioinformatics (Oxford, England)·2026
Same journal

Primer Design through Submodular Function Estimation.

Bioinformatics (Oxford, England)·2026
See all related articles

Variable length Markov models adapt their depth using training data, outperforming fixed order models. These models efficiently capture complex patterns without hidden states, offering a powerful tool for data analysis.

Area of Science:

  • Computer Science
  • Machine Learning
  • Statistical Modeling

Background:

  • Traditional Markov models use a fixed order (depth).
  • This limits their ability to capture context-dependent patterns efficiently.
  • Previous methods often require extensive data or complex structures.

Purpose of the Study:

  • Introduce a general-purpose implementation of variable length Markov models (VLMMs).
  • To overcome limitations of fixed order Markov models.
  • To efficiently model complex dependencies in data.

Main Methods:

  • Developed a novel algorithm for constructing VLMMs.
  • The algorithm dynamically adjusts model depth based on training data.
  • No hidden states are required, simplifying the model structure.

Related Experiment Videos

Main Results:

  • VLMMs adapt to higher-order dependencies where present and lower-order elsewhere.
  • Theoretical and experimental results validate the approach.
  • Models capture rich signals from modest training data.

Conclusions:

  • Variable length Markov models offer a flexible and powerful alternative to fixed order models.
  • VLMMs provide efficient pattern detection without hidden states.
  • The implementation is suitable for general-purpose applications.