The consensus string problem and the complexity of comparing hidden Markov models.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2081009
- The most probable string: an algorithmic study
- On computing the total variation distance of hidden Markov models
- The most probable annotation problem in HMMs and its application to bioinformatics
- Sequence annotation with HMMs: new problems and their complexity
Cites work
- scientific article; zbMATH DE number 1670809 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- On the computational complexity of approximating distributions by probabilistic automata
- Stochastic models for heterogeneous DNA sequences
Cited in
(19)- Converging from branching to linear metrics on Markov chains
- The most probable string: an algorithmic study
- The most probable annotation problem in HMMs and its application to bioinformatics
- Computation of distances for regular and context-free probabilistic languages
- Learning probabilistic automata using residuals
- Absolute convergence of rational series is semi-decidable
- A note on probabilistic models over strings: the linear algebra approach
- Absolute Convergence of Rational Series Is Semi-decidable
- Sequence annotation with HMMs: new problems and their complexity
- ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
- scientific article; zbMATH DE number 2081009 (Why is no real title available?)
- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar
- A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness
- On computing the total variation distance of hidden Markov models
- Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
- The complexity of estimating min-entropy
- A sufficient condition for reducing recursions in hidden Markov models
- Probabilistic automata of bounded ambiguity
- Probabilistic automata of bounded ambiguity
This page was built for publication: The consensus string problem and the complexity of comparing hidden Markov models.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872725)
