Abstract
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is therefore an important task. The quartet distance is a distance measure between trees previously proposed by Estabrook, McMorris, and Meacham. The quartet distance between two unrooted evolutionary trees is the number of quartet topology differences between the two trees, where a quartet topology is the topological subtree induced by four species. In this paper we present an algorithm for computing the quartet distance between two unrooted evolutionary trees of n species, where all internal nodes have degree three, in time O(n log n. The previous best algorithm for the problem uses time O(n 2).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Brodal, G., Fagerberg, R. & Pedersen, C. Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). Algorithmica 38, 377–395 (2004). https://doi.org/10.1007/s00453-003-1065-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-003-1065-y