Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model (Q2784459): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 08:30, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model |
scientific article |
Statements
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model (English)
0 references
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
