Pages that link to "Item:Q5415366"
From MaRDI portal
The following pages link to The most probable string: an algorithmic study (Q5415366):
Displaying 6 items.
- The consensus string problem and the complexity of comparing hidden Markov models. (Q1872725) (← links)
- Consensus string problem for multiple regular languages (Q2042725) (← links)
- A note on probabilistic models over strings: the linear algebra approach (Q2446798) (← links)
- Computing the Expected Edit Distance from a String to a PFA (Q2830206) (← links)
- Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton (Q4605516) (← links)
- A Probabilistic Analysis of a String Editing Problem and its Variations (Q4852430) (← links)