David Bryant
Ming Li
ABSTRACT
No abstract available.
Index Terms
- Computing the quartet distance between evolutionary trees
Recommendations
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)
AbstractEvolutionary 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 ...
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2n)
ISAAC '01: Proceedings of the 12th International Symposium on Algorithms and ComputationEvolutionary 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 ...
Computing the quartet distance between trees of arbitrary degree
WABI'05: Proceedings of the 5th International conference on Algorithms in BioinformaticsWe present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number of quartets—sub-trees induced by four leaves—that differs between the trees. ...
Comments