Finding a maximum likelihood tree is hard (Q3455214): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:30, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a maximum likelihood tree is hard |
scientific article |
Statements
Finding a maximum likelihood tree is hard (English)
0 references
4 December 2015
0 references
maximum likelihood
0 references
approximate vertex cover
0 references
intractability
0 references
maximum parsimony
0 references
tree reconstruction
0 references
