Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees.

Gerth Stølting Brodal Konstantinos Mampentzidis

Published in: CoRR (2017)

Keyphrases

orders of magnitude
computationally efficient
benchmark datasets
times faster
significant improvement
theoretical analysis
objective function
computational cost
computational efficiency
data access
data sets
peer to peer
highly scalable