The complexity of inferring a minimally resolved phylogenetic supertree (Q2884583)
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 complexity of inferring a minimally resolved phylogenetic supertree |
scientific article; zbMATH DE number 6039273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of inferring a minimally resolved phylogenetic supertree |
scientific article; zbMATH DE number 6039273 |
Statements
30 May 2012
0 references
phylogenetic tree
0 references
rooted triplet
0 references
minimally resolved supertree
0 references
NP-hardness
0 references
graph coloring
0 references
tree separator
0 references
The complexity of inferring a minimally resolved phylogenetic supertree (English)
0 references
0.8423808217048645
0 references
0.8299412727355957
0 references
0.8188527226448059
0 references
