Algorithmica

, Volume 38, Issue 2, pp 377–395

Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)

Article

DOI: 10.1007/s00453-003-1065-y

Cite this article as:
Brodal, G., Fagerberg, R. & Pedersen, C. Algorithmica (2004) 38: 377. doi:10.1007/s00453-003-1065-y

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(n2).

Evolutionary treesDistance measuresQuartet distanceHierarchical decompositions

Copyright information

© Springer-Verlag 2003

Authors and Affiliations

  1. 1.Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000 Århus CDenmark