Efficient Parallel Computation of Nearest Neighbor Interchange Distances

The nni-distance is a well-known distance measure for phylogenetic trees. We construct an efficient parallel approximation algorithm for the nni-distance in the CRCW-PRAM model running in O(log n) time on O(n) processors. Given two phylogenetic trees T1 and T2 on the same set of taxa and with the same multi-set of edge-weights, the algorithm constructs a sequence of nni-operations of weight at most O(log n) \cdot opt, where opt denotes the minimum weight of a sequence of nni-operations transforming T1 into T2 . This algorithm is based on the sequential approximation algorithm for the nni-distance given by DasGupta et al. (2000). Furthermore, we show that the problem of identifying so called good edge-pairs between two weighted phylogenies can be computed in O(log n) time on O(n log n) processors.

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

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

[3]  W. H. Day.  Optimal algorithms for comparing trees with labeled leaves , 1985 .

[4]  Xin He,et al.  On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees , 1999, Algorithmica.

[5]  Siu-Ming Yiu,et al.  Non-shared edges and nearest neighbor interchanges revisited , 2004, Inf. Process. Lett..

[6]  Daniel S. Hirschberg,et al.  Parallel algorithms for the transitive closure and the connected component problems , 1976, STOC '76.

[7]  M. Steel,et al.  Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees , 2001 .

[8]  Guy E. Blelloch,et al.  Vector Models for Data-Parallel Computing , 1990 .

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

[10]  Uzi Vishkin,et al.  On Finding Lowest Common Ancestors: Simplification and Parallelization , 1988, AWOC.

[11]  Xin He,et al.  On computing the nearest neighbor interchange distance , 1999, Discrete Mathematical Problems with Medical Applications.

[12]  Ming-Yang Kao,et al.  Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers , 2000, ISAAC.

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

[14]  Steve Goddard,et al.  Connected components algorithms for mesh-connected parallel computers , 1994, Parallel Algorithms.