Quartet distance

The quartet distance is a way of measuring the distance between two phylogenetic trees. It is defined as the number of subsets of four leaves that are not related by the same topology in both trees.

Computing the quartet distance

The most straightforward computation of the quartet distance would require $O(N^{4})$ time, where $N$ is the number of leaves in the trees.

For binary trees, better algorithms have been found to compute the distance in

$O(N^{2})$ time^[1]
$O(N\log ^{2}N)$ time^[2]

and

$O(N\log N)$ time^[3]

Brodal et al. found an algorithm that takes $O(DN\log N)$ time to compute the quartet distance between two multifurcating trees when $D$ is the maximum degree of the trees.^[4]

References

↑ Bryant, D.; J. Tsang; P. E. Kearney; M. Li. (11 Jan 2000). "Computing the quartet distance between evolutionary trees". Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms. N.Y.: ACM Press: 285–286.
↑ Brodal, Gerth Stølting; Rolf Fagerberg; Christian N.S. Pedersen (2001). "Computing the Quartet Distance Between Evolutionary Trees in Time $Nlog^{2}N$ ". Algorithmica. Springer-Verlag. pp. 731–742.
↑ Brodal, Gerth Stølting; Rolf Fagerberg; Christian Nørgaard Storm Pedersen (2003). "Computing the Quartet Distance Between Evolutionary Trees in Time $O(n\log n)$ ". Algorithmica, Special issue on ISAAC 2001. 38 (2): 377–395.
↑ Brodal, GS; R Fagerberg; T Mailund; CNS Pedersen; A Sand (2013). "Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree" (PDF). Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'13). SIAM: 1814–1832.

This article is issued from Wikipedia - version of the 1/10/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.