We consider the problem of computing the triplet distance between two rooted unordered trees with
n
labeled leaves. Introduced by Dobson in 1975, the triplet distance is the number of leaf triples that induce different topologies in the two trees. The current theoretically fastest algorithm is an O(
n
log
n
) algorithm by Brodal et al. (SODA 2013). Recently, Jansson and Rajaby proposed a new algorithm that, while slower in theory, requiring O(
n
log
3
n
) time, in practice it outperforms the theoretically faster O(
n
log
n
) algorithm. Both algorithms do not scale to external memory.
We present two cache oblivious algorithms that combine the best of both worlds. The first algorithm is for the case when the two input trees are binary trees, and the second is a generalized algorithm for two input trees of arbitrary degree. Analyzed in the RAM model, both algorithms require O(
n
log
n
) time, and in the cache oblivious model O(
n
/
B
log
2
n
/
M
) I/Os. Their relative simplicity and the fact that they scale to external memory makes them achieve the best practical performance. We note that these are the first algorithms that scale to external memory, both in theory and in practice, for this problem.
Balanced Partitioning of Several Cache-Oblivious Algorithms
