On the computational complexity of the rooted subtree prune and regraft distance (Q1764471)
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: On the computational complexity of the rooted subtree prune and regraft distance |
scientific article; zbMATH DE number 2138552
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of the rooted subtree prune and regraft distance |
scientific article; zbMATH DE number 2138552 |
Statements
On the computational complexity of the rooted subtree prune and regraft distance (English)
0 references
25 February 2005
0 references
The paper proves that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard -- solving a longstanding problem. (This operation cuts off a subtree and reattaches it to another part of the tree.)
0 references
rooted phylogenetic tree
0 references
rooted subtree prune and regraft
0 references
0.88228536
0 references
0.8809458
0 references
0.87912965
0 references
0.8741095
0 references
0.86727715
0 references
0.8660907
0 references
0.8660907
0 references
0.86356044
0 references
