Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees

The nearest neighbor interchange (nni) distance is a classical metric for measuring the distance (dissimilarity) between two evolutionary trees. The problem of computing the nni distance has been studied over two decades (see e.g., [16, 3, 7, 12, 8, 4]). The long-standing conjecture that the problem is NP-complete was proved only recently, whereas approximation algorithms for the problem have appeared in the literature for a while. Existing approximation algorithms actually perform reasonably well (precisely, the approximation ratios are log n for unweighted trees and 4 log n for weighted trees); yet they are designed for degree- 3 trees only. In this paper we present new approximation algorithms that can handle trees with non-uniform degrees. The running time is O(n2) and the approximation ratios are respectively (2d/log d+2) log n and (2d/log d+12) log n for unweighted and weighted trees, where d ≥ 4 is the maximum degree of the input trees.

[1]  B. Dasgupta,et al.  On distances between phylogenetic trees , 1997, SODA '97.

[2]  Derick Wood,et al.  A Note on Some Tree Similarity Measures , 1982, Inf. Process. Lett..

[3]  Ming-Yang Kao,et al.  General techniques for comparing unrooted evolutionary trees , 1997, STOC '97.

[4]  D. Robinson Comparison of labeled trees with valency three , 1971 .

[5]  A. H. Clark,et al.  Animal evolution , 1981 .

[6]  Mikkel Thorup,et al.  Optimal evolutionary tree comparison by sparse dynamic programming , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  W. H. Day Properties of the nearest neighbor interchange metric for trees of small size , 1983 .

[8]  Mikkel Thorup,et al.  An O(n log n) algorithm for the maximum agreement subtree problem for binary trees , 1996, SODA '96.

[9]  G. Moore,et al.  An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets. , 1973, Journal of theoretical biology.

[10]  Ming-Yang Kao Tree Contractions and Evolutionary Trees , 1998, SIAM J. Comput..

[11]  A. D. Gordon,et al.  Obtaining common pruned trees , 1985 .

[12]  M. Krivánek Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete , 1986 .

[13]  J. Tromp,et al.  On the nearest neighbour interchange distance between evolutionary trees. , 1996, Journal of theoretical biology.

[14]  Ming Li,et al.  Some Notes on the Nearest Neighbour Interchange Distance , 1996, COCOON.

[15]  J. P. Jarvis,et al.  Comments on computing the similarity of binary trees , 1983 .

[16]  Temple F. Smith,et al.  On the similarity of dendrograms. , 1978, Journal of theoretical biology.