<HashMap><database>biostudies-literature</database><scores/><additional><omics_type>Unknown</omics_type><volume>18(6)</volume><submitter>Bello L</submitter><pubmed_abstract>Compression as an accelerant of computation is increasingly recognized as an important component in engineering fast real-world machine learning methods for big data; c.f., its impact on genome-scale approximate string matching. Previous work showed that compression can accelerate algorithms for Hidden Markov Models (HMM) with discrete observations, both for the classical frequentist HMM algorithms-Forward Filtering, Backward Smoothing and Viterbi-and Gibbs sampling for Bayesian HMM. For Bayesian HMM with continuous-valued observations, compression was shown to greatly accelerate computations for specific types of data. For instance, data from large-scale experiments interrogating structural genetic variation can be assumed to be piece-wise constant with noise, or, equivalently, data gener</pubmed_abstract><journal>PloS one</journal><pagination>e0286074</pagination><full_dataset_link>https://www.ebi.ac.uk/biostudies/studies/S-EPMC10243634</full_dataset_link><repository>biostudies-literature</repository><pubmed_title>Compressed computations using wavelets for hidden Markov models with continuous observations.</pubmed_title><pmcid>PMC10243634</pmcid><pubmed_authors>Wiedenhoft J</pubmed_authors><pubmed_authors>Bello L</pubmed_authors><pubmed_authors>Schliep A</pubmed_authors></additional><is_claimable>false</is_claimable><name>Compressed computations using wavelets for hidden Markov models with continuous observations.</name><description>Compression as an accelerant of computation is increasingly recognized as an important component in engineering fast real-world machine learning methods for big data; c.f., its impact on genome-scale approximate string matching. Previous work showed that compression can accelerate algorithms for Hidden Markov Models (HMM) with discrete observations, both for the classical frequentist HMM algorithms-Forward Filtering, Backward Smoothing and Viterbi-and Gibbs sampling for Bayesian HMM. For Bayesian HMM with continuous-valued observations, compression was shown to greatly accelerate computations for specific types of data. For instance, data from large-scale experiments interrogating structural genetic variation can be assumed to be piece-wise constant with noise, or, equivalently, data gener</description><dates><release>2023-01-01T00:00:00Z</release><publication>2023</publication><modification>2025-04-19T14:14:58.33Z</modification><creation>2025-04-19T14:14:58.33Z</creation></dates><accession>S-EPMC10243634</accession><cross_references><pubmed>37279196</pubmed><doi>10.1371/journal.pone.0286074</doi></cross_references></HashMap>