A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees
Related Experiment Video
Updated: May 14, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 5, 2014
Andreas Sand1, Gerth Stølting Brodal, Rolf Fagerberg
1Bioinformatics Research Center, Aarhus University, Denmark.
Abstract:
The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two rooted binary trees in time O (n log2 n). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O (n log n). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared to O (n2) time algorithms, we show through experiments that the triplet distance algorithm can be implemented to give a competitive wall-time running time.
Related Concept Videos
The Distance Formula
Distance Problem
Phylogenetic Trees
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Binomial Expansion Using Pascal's Triangle
The Binomial Theorem
