quartet distance

The quartet distance{{cite journal|last1=Estabrook|first1=George F.|last2=McMorris|first2=F. R.|last3=Meacham|first3=Christopher A.|title=Comparison of Undirected Phylogenetic Trees Based on Subtrees of Four Evolutionary Units|journal=Systematic Zoology|date=1985|volume=34|issue=2|pages=193–200|jstor=2413326|doi=10.2307/2413326}} 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{{cite journal

|last=Bryant

|first=D.

|author2=J. Tsang|author3=P. E. Kearney|author4=M. Li.

|title=Computing the quartet distance between evolutionary trees

|journal=Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms

|pages=285–286

|publisher=ACM Press

|location=N.Y.

|date=11 Jan 2000

|url=http://monod.uwaterloo.ca/papers/00Distance.ps}}

$O(N \log^2 N)$ time

{{Cite book

|last1 = Brodal |first1 = Gerth Stølting

|last2 = Fagerberg |first2 = Rolf

|last3 = Pedersen |first3 = Christian N. S.

|year = 2001

|chapter = Computing the Quartet Distance between Evolutionary Trees in Time $O(n \log^2 n)$

|title = Algorithms and Computation

|series = Lecture Notes in Computer Science

|volume = 2223 |pages = 731–742

|doi = 10.1007/3-540-45678-3_62

|isbn = 978-3-540-42985-2

}}

and

$O(N \log N)$ time{{cite journal

|last=Brodal

|first=Gerth Stølting|authorlink=Gerth Stølting Brodal

|author2=Rolf Fagerberg |author3=Christian Nørgaard Storm Pedersen

|journal=Algorithmica

|issue=2

|pages=377–395

|title=Computing the Quartet Distance Between Evolutionary Trees in Time $O(n \log n)$

|volume=38

|year=2003

|doi=10.1007/s00453-003-1065-y|s2cid=6911940}}

Gerth Stølting Brodal et al. found an algorithm that takes $O(D N \log N)$ time to compute the quartet distance between two multifurcating trees when $D$ is the maximum degree of the trees,{{cite journal

|last=Brodal

|first=Gerth Stølting|authorlink=Gerth Stølting Brodal

|author2=Rolf Fagerberg |author3=T Mailund |author4=Christian Nørgaard Storm Pedersen |author5=A Sand

|journal=Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms

|publisher=SIAM

|year=2013

|title=Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree

|pages=1814–1832

|url=http://www.cs.au.dk/~gerth/papers/soda13.pdf|doi=10.1137/1.9781611973105.130|isbn=978-1-61197-251-1|doi-access=free

}} which is [http://users-cs.au.dk/cstorm/software/tqdist/ accessible] in C, perl, and the R package [https://CRAN.R-project.org/package=Quartet Quartet].

References

Category:Computational phylogenetics

Category:Bioinformatics algorithms