The agreement problem for unrooted phylogenetic trees is FPT (Q5494863)
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 agreement problem for unrooted phylogenetic trees is FPT |
scientific article; zbMATH DE number 6323005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The agreement problem for unrooted phylogenetic trees is FPT |
scientific article; zbMATH DE number 6323005 |
Statements
The agreement problem for unrooted phylogenetic trees is FPT (English)
0 references
30 July 2014
0 references
strictly compatible unrooted phylogenetic trees
0 references
FPT algorithm
0 references
0.9298036098480223
0 references
0.8712148666381836
0 references
0.8695846796035767
0 references
0.8547070026397705
0 references
0.8513849973678589
0 references
