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 Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Improving Translational Accuracy02:07

Improving Translational Accuracy

Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
Improving Translational Accuracy02:07

Improving Translational Accuracy

Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
Extraction: Advanced Methods00:56

Extraction: Advanced Methods

Metal ions can be separated from one another by complexation with organic ligands–the chelating agent– to form uncharged chelates. Here, the chelating agent must contain hydrophobic groups and behave as a weak acid, losing a proton to bind with the metal. Since most organic ligands used in this process are insoluble or undergo oxidation in the aqueous phase, the chelating agent is initially added to the organic phase and extracted into the aqueous phase. The metal-ligand complex is formed in...

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Large-scale land acquisitions exacerbate local farmland inequalities in Tanzania.

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

Carbon emissions from the global land rush and potential mitigation.

Nature food·2023
Same author

Computational Creativity and Aesthetics with Algorithmic Information Theory.

Entropy (Basel, Switzerland)·2021
Same author

On the Problem of Small Objects.

Entropy (Basel, Switzerland)·2021
Same author

Mean and Variance of Phylogenetic Trees.

Systematic biology·2019
Same author

Estimating local biodiversity change: a critique of papers claiming no net loss of local diversity.

Ecology·2016
Same journal

CNV-ECOD: A copy number variation detection method based on ECOD algorithm using next-generation sequencing data.

Journal of bioinformatics and computational biology·2026
Same journal

ReinVar: A model-free paradigm-based reinforcement learning approach to detect copy number variation.

Journal of bioinformatics and computational biology·2026
Same journal

When pipelines run but coordinates fail: A simple spatial specificity check for false locality in post-GWAS analysis.

Journal of bioinformatics and computational biology·2026
Same journal

Comparative benchmarking of template-based, evolutionary-diffusion, and generative language models for IsPETase structure prediction.

Journal of bioinformatics and computational biology·2026
Same journal

Trap spaces as labelled ideals of SCC posets: A structural-functional theory of reachability in asynchronous boolean networks.

Journal of bioinformatics and computational biology·2026
Same journal

Erratum - DDINet: Drug-drug interaction prediction network based on multi-molecular fingerprint features and multi-head attention centered weighted autoencoder.

Journal of bioinformatics and computational biology·2026
See all related articles

Related Experiment Video

Updated: Jun 21, 2026

Utilizing vmTracking to Improve the Accuracy of Multi-Animal Pose Estimation in Rodent Social Behavior Studies
07:34

Utilizing vmTracking to Improve the Accuracy of Multi-Animal Pose Estimation in Rodent Social Behavior Studies

Published on: November 7, 2025

A tutorial of techniques for improving standard Hidden Markov Model algorithms.

Daniil Golod1, Daniel G Brown

  • 1David R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, N2L 3G1, Canada. dgolod@cs.uwaterloo.ca

Journal of Bioinformatics and Computational Biology
|July 28, 2009
PubMed
Summary
This summary is machine-generated.

This tutorial optimizes Hidden Markov Models (HMMs) algorithms, Viterbi and Baum-Welch, by reducing space complexity. New methods achieve logarithmic and O(square root n) space, enabling efficient parallelization for faster computation.

Related Experiment Videos

Last Updated: Jun 21, 2026

Utilizing vmTracking to Improve the Accuracy of Multi-Animal Pose Estimation in Rodent Social Behavior Studies
07:34

Utilizing vmTracking to Improve the Accuracy of Multi-Animal Pose Estimation in Rodent Social Behavior Studies

Published on: November 7, 2025

Area of Science:

  • Computer Science
  • Machine Learning
  • Statistical Modeling

Background:

  • Hidden Markov Models (HMMs) are widely used in sequence analysis.
  • Standard implementations of HMM algorithms can be memory-intensive.
  • Optimizing computational efficiency is crucial for large-scale HMM applications.

Purpose of the Study:

  • To present space-optimized algorithms for Hidden Markov Models (HMMs).
  • To explore parallelization strategies for HMM computations.
  • To improve the practical efficiency of Viterbi and Baum-Welch algorithms.

Main Methods:

  • Implemented constant space expectation computations for the Baum-Welch algorithm.
  • Developed O(square root n) and logarithmic space variants for both Viterbi and Baum-Welch algorithms.
  • Investigated parallelization techniques for shared-memory systems.

Main Results:

  • Achieved significant space reductions for HMM algorithms, down to logarithmic and O(square root n).
  • Identified parallelization opportunities for both algorithms, with trade-offs in CPU cost.
  • Demonstrated practical heuristics leading to logarithmic space usage for Viterbi.

Conclusions:

  • Space-optimized HMM algorithms offer substantial memory savings.
  • Parallelization strategies can further enhance computational speed, especially on multi-core systems.
  • The presented methods provide practical improvements for implementing HMMs efficiently.