Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7045246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a most parsimonious or likely tree in a network with respect to an alignment |
scientific article; zbMATH DE number 7045246 |
Statements
Finding a most parsimonious or likely tree in a network with respect to an alignment (English)
0 references
29 March 2019
0 references
phylogenetic tree
0 references
phylogenetic network
0 references
maximum parsimony
0 references
maximum likelihood
0 references
NP-hardness
0 references
APX-hardness
0 references
0 references
0 references
0.87955815
0 references
0.8715539
0 references
0.8596836
0 references
0.85292774
0 references
0.85292774
0 references
0.8487813
0 references
0.8480388
0 references
0.84653157
0 references
