Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers

Authors:
Wing-Kai Hon;Ming-Yang Kao;Tak Wah Lam
Affiliations:
-;-;-
Venue:
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Year:
2000

Citing 3
Cited 1

On the complexity of comparing evolutionary trees

Discrete Applied Mathematics - Special volume on computational molecular biology
On distances between phylogenetic trees

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating the nearest neighbor interchange distance for evolutionary trees with non-uniform degrees

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Finding Similar or Diverse Solutions in Answer Set Programming

ICLP '09 Proceedings of the 25th International Conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The number of the non-shared edges of two phylogenies is a basic measure of the distance (dissimilarity) between the phylogenies. The non-shared edges are also the building block for approximating a more sophisticated metric called the NNI distance. In this paper we give the first sub-quadratic time algorithm for finding the non-shared edges, which are then used to speed up the existing approximation algorithm for the NNI distance. The time is improved from O(n2) to O(n log n). Another popular distance metric for phylogenies is the STT distance. Previous work on computing the STT distance focused on degree-3 trees only. We show that the STT distance can be applied in a broader sense, allowing us to cover degree-d trees, where d ≥ 3. In particular, we give a new approximation algorithm for the STT distance.