The following publications are possibly variants of this publication:
- Computing the Quartet Distance Between Trees of Arbitrary DegreeChris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers. wabi 2005: 77-88 [doi]
- tqDist: a library for computing the quartet and triplet distances between binary or general treesAndreas Sand, Morten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal, Thomas Mailund, Christian N. S. Pedersen. bioinformatics, 30(14):2079-2080, 2014. [doi]
- Fast calculation of the quartet distance between trees of arbitrary degreesChris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers, Martin Stig Stissing. almob, 1, 2006. [doi]
- Computing the Quartet Distance Between Evolutionary Trees of Bounded DegreeM. Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg. apbc 2007: 101-110 [doi]
- A Quadratic Time Algorithm for Computing the Quartet Distance between Two General TreesThomas Mailund, Jesper Nielsen, Christian N. S. Pedersen. ijcbs 2009: 565-568 [doi]
- On the Scalability of Computing Triplet and Quartet DistancesMorten Kragelund Holt, Jens Johansen, Gerth Stølting Brodal. alenex 2014: 9-19 [doi]