On the computational complexity of the rooted subtree prune and regraft distance (Q1764471): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q104141373, #quickstatements; #temporary_batch_1711504539957 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982901388 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q104141373 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:17, 27 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of the rooted subtree prune and regraft distance |
scientific article |
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
