The consensus string problem and the complexity of comparing hidden Markov models. (Q1872725)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The consensus string problem and the complexity of comparing hidden Markov models. |
scientific article; zbMATH DE number 1910849
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The consensus string problem and the complexity of comparing hidden Markov models. |
scientific article; zbMATH DE number 1910849 |
Statements
The consensus string problem and the complexity of comparing hidden Markov models. (English)
0 references
14 May 2003
0 references
0 references
