Evolutionary trees can be learned in polynomial time in the two-state general Markov model (Q2784459)
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: Evolutionary trees can be learned in polynomial time in the two-state general Markov model |
scientific article; zbMATH DE number 1732349
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Evolutionary trees can be learned in polynomial time in the two-state general Markov model |
scientific article; zbMATH DE number 1732349 |
Statements
23 April 2002
0 references
computational learning theory
0 references
evolutionary trees
0 references
PAC-learning
0 references
learning of distributions
0 references
Markov model
0 references
0.8543976
0 references
0.84685814
0 references
0 references
0.8361087
0 references
0.83586335
0 references
0.83449674
0 references
0.83339787
0 references
0.8300177
0 references
Evolutionary trees can be learned in polynomial time in the two-state general Markov model (English)
0 references
