Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers
| dc.creator | Hon, Wing-Kai | |
| dc.creator | Kao, Ming-Yang | |
| dc.creator | Lam, Tak-Wah | |
| dc.creator | Sung, Wing-Kin | |
| dc.creator | Yiu, Siu-Ming | |
| dc.date | 2002-11-11 | |
| dc.date.accessioned | 2026-07-07T03:18:59Z | |
| dc.date.available | 2026-07-07T03:18:59Z | |
| dc.description | The number of the non-shared edges of two phylogenies is a basic measure of the dissimilarity between the phylogenies. The non-shared edges are also the building block for approximating a more sophisticated metric called the nearest neighbor interchange (NNI) distance. In this paper, we give the first subquadratic-time algorithm for finding the non-shared edges, which are then used to speed up the existing approximating algorithm for the NNI distance from $O(n^2)$ time to $O(n \log n)$ time. Another popular distance metric for phylogenies is the subtree transfer (STT) distance. Previous work on computing the STT distance considered degree-3 trees only. We give an approximation algorithm for the STT distance for degree-$d$ trees with arbitrary $d$ and with generalized STT operations. | |
| dc.identifier | https://arxiv.org/abs/cs/0211009 | |
| dc.identifier | http://arxiv.org/abs/cs/0211009 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31337 | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | F.2.2 | |
| dc.title | Improved Phylogeny Comparisons: Non-Shared Edges Nearest Neighbor Interchanges, and Subtree Transfers | |
| dc.type | text |