Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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.

29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
36
The categories of this paper are: cmp-lg
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
9
The categories of this paper are: nlin
30
The categories of this paper are: q-alg
33
The categories of this paper are: plasm-ph
12
The categories of this paper are: nucl-th
4
The categories of this paper are: cond-mat
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
18
The categories of this paper are: econ