Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees (Q4910733)
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 6146469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees |
scientific article; zbMATH DE number 6146469 |
Statements
19 March 2013
0 references
maximum agreement supertree
0 references
maximum compatible supertree
0 references
0.9505675435066224
0 references
0.8829183578491211
0 references
0.8776746392250061
0 references
0.8771648406982422
0 references
0.8618216514587402
0 references
