Pages that link to "Item:Q1872725"

The following pages link to The consensus string problem and the complexity of comparing hidden Markov models. (Q1872725):

Displaying 17 items.

• The complexity of estimating min-entropy (Q260395) (← links)
• A sufficient condition for reducing recursions in hidden Markov models (Q263604) (← links)
• Absolute convergence of rational series is semi-decidable (Q553292) (← links)
• Computation of distances for regular and context-free probabilistic languages (Q932320) (← links)
• Probabilistic automata of bounded ambiguity (Q2064517) (← links)
• Learning probabilistic automata using residuals (Q2119983) (← links)
• Sequence annotation with HMMs: new problems and their complexity (Q2345874) (← links)
• A note on probabilistic models over strings: the linear algebra approach (Q2446798) (← links)
• The most probable annotation problem in HMMs and its application to bioinformatics (Q2643730) (← links)
• L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA (Q3503091) (← links)
• ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA (Q3532153) (← links)
• Absolute Convergence of Rational Series Is Semi-decidable (Q3618573) (← links)
• Converging from branching to linear metrics on Markov chains (Q4559599) (← links)
• On Computing the Total Variation Distance of Hidden Markov Models. (Q5002817) (← links)
• Probabilistic Automata of Bounded Ambiguity (Q5111632) (← links)
• The most probable string: an algorithmic study (Q5415366) (← links)
• A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness (Q6176993) (← links)