Improving viterbi is hard: Better runtimes imply faster clique algorithms

A Backurs, C Tzamos - International Conference on Machine …, 2017 - proceedings.mlr.press
The classic algorithm of Viterbi computes the most likely path in a Hidden Markov Model
(HMM) that results in a given sequence of observations. It runs in time $ O (Tn^ 2) $ given a …

[HTML][HTML] Compressed computations using wavelets for hidden Markov models with continuous observations

L Bello, J Wiedenhöft, A Schliep - Plos one, 2023 - journals.plos.org
Compression as an accelerant of computation is increasingly recognized as an important
component in engineering fast real-world machine learning methods for big data; cf, its …

[HTML][HTML] Fast bayesian inference of copy number variants using hidden Markov models with wavelet compression

J Wiedenhoeft, E Brugel, A Schliep - PLOS Computational Biology, 2016 - journals.plos.org
By integrating Haar wavelets with Hidden Markov Models, we achieve drastically reduced
running times for Bayesian inference using Forward-Backward Gibbs sampling. We show …

Machine learning for big sequence data: Wavelet-compressed Hidden Markov Models

L Bello - 2020 - odr.chalmers.se
Hidden Markov models are among the most important machine learning methods for the
statistical analysis of sequential data, but they struggle when applied on big data. Their …

[图书][B] Reduced representations for efficient analysis of genomic data; From microarray to high-throughput sequencing

MP Mahmud - 2014 - search.proquest.com
Since the genomics era has started in the'70s, microarray technologies have been
extensively used for biological applications such as gene expression profiling, copy number …