Stølting Brodal, Gerth ;
Mampentzidis, Konstantinos
Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
Abstract
We study the problem of computing the triplet distance between two rooted unordered trees with n labeled leafs. Introduced by Dobson 1975, the triplet distance is the number of leaf triples that induce different topologies in the two trees. The current theoretically best algorithm is an O(nlogn) time algorithm by Brodal et al. [SODA 2013]. Recently Jansson et al. 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 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 practice, for this problem.
BibTeX  Entry
@InProceedings{stltingbrodal_et_al:LIPIcs:2017:7882,
author = {Gerth St\olting Brodal and Konstantinos Mampentzidis},
title = {{Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees}},
booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)},
pages = {21:121:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770491},
ISSN = {18688969},
year = {2017},
volume = {87},
editor = {Kirk Pruhs and Christian Sohler},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7882},
URN = {urn:nbn:de:0030drops78820},
doi = {10.4230/LIPIcs.ESA.2017.21},
annote = {Keywords: Phylogenetic tree, tree comparison, triplet distance, cache oblivious algorithm}
}
01.09.2017
Keywords: 

Phylogenetic tree, tree comparison, triplet distance, cache oblivious algorithm 
Seminar: 

25th Annual European Symposium on Algorithms (ESA 2017)

Issue date: 

2017 
Date of publication: 

01.09.2017 