The most probable string: an algorithmic study

DOI10.1093/LOGCOM/EXS049zbMATH Open1286.68299OpenAlexW1925821903MaRDI QIDQ5415366FDOQ5415366

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

probabilistic automataparsing

Mathematics Subject Classification ID

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

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)

• 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?)
• A Probabilistic Analysis of a String Editing Problem and its Variations
• scientific article; zbMATH DE number 1670716 (Why is no real title available?)
• The consensus string problem and the complexity of comparing hidden Markov models.
• Computing the expected edit distance from a string to a probabilistic finite-state automaton
• Computing the expected edit distance from a string to a PFA

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)