scientific article; zbMATH DE number 2081009

MaRDI QIDQ4474110zbMATH OpenFDO

Authors Rune B. Lyngsø, Christian Nørgaard Storm Pedersen

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230416.htm

zbMATH Keywords

Hidden Markov ModelsConsensus StringDistance MeasuresNP Hardness

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The consensus string problem and the complexity of comparing hidden Markov models.
• On computing the total variation distance of hidden Markov models
• scientific article; zbMATH DE number 2019610
• The most probable annotation problem in HMMs and its application to bioinformatics
• Sequence annotation with HMMs: new problems and their complexity

Cited in

(9)

• A note on probabilistic models over strings: the linear algebra approach
• Sequence annotation with HMMs: new problems and their complexity
• Distinguishing hidden Markov chains
• scientific article; zbMATH DE number 2019610 (Why is no real title available?)
• The consensus string problem and the complexity of comparing hidden Markov models.
• Learning with attribute costs
• The Complexity of Distinguishing Markov Random Fields
• A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models
• On computing the total variation distance of hidden Markov models

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474110)