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

Authors:
Gerth Stølting Brodal;Rolf Fagerberg;Christian N. S. Pedersen
Affiliations:
-;-;-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 7
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms

SIAM Journal on Computing
The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
Computing the quartet distance between evolutionary trees

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Merging, Construction, and Maintenance of Evolutionary Trees

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
The Complexity of Constructing Evolutionary Trees Using Experiments

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is an important task. One previously proposed measure for this is the quartet distance. 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 in time O(n log2 n). The previous best algorithm runs in time O(n2).