The most probable string: an algorithmic study

DOI10.1093/LOGCOM/EXS049MaRDI QIDQ5415366zbMATH OpenOpenAlexFDO

Authors Colin de la Higuera, Jose Oncina

Publication date 12 May 2014

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ab73c1dca8ba339ddc6618d348e15f70a2417890

zbMATH Keywords

parsingprobabilistic automata

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Randomized algorithms (68W20)

Recommendations

• The consensus string problem and the complexity of comparing hidden Markov models.
• scientific article; zbMATH DE number 1670709
• Consensus string problem for multiple regular languages
• Consensus string problem for multiple regular languages
• Computing the expected edit distance from a string to a probabilistic finite-state automaton

Cited in

(8)

• The consensus string problem and the complexity of comparing hidden Markov models.
• Consensus string problem for multiple regular languages
• A note on probabilistic models over strings: the linear algebra approach
• scientific article; zbMATH DE number 1670709 (Why is no real title available?)
• scientific article; zbMATH DE number 1670716 (Why is no real title available?)
• Computing the expected edit distance from a string to a PFA
• Computing the expected edit distance from a string to a probabilistic finite-state automaton
• A Probabilistic Analysis of a String Editing Problem and its Variations

This page was built for publication: The most probable string: an algorithmic study

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