Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
 
Abteilung V

 
Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 2010 Copyright 2010 Universität Bonn, Institut für Informatik, Abt. V
89123

08.03.2010

Efficient Parallel Computation of Nearest Neighbor Interchange Distances
(Preliminary Version)

Mikael Gast and Mathias Hauptmann
[Download PostScript] [Download PDF]

The nni-distance is a well-known distance measure for phylogenetic trees. We construct an efficient parrallel approximation algorithm (in the CRCW-PRAM model) for the nni-distance. 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) ⋅ 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. [DHJ+00].

Last Change: 11/05/14 at 10:54:05
 English
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope