The following publications are possibly variants of this publication:
- Computing the All-Pairs Quartet Distance on a Set of Evolutionary TreesM. Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg. apbc 2007: 91-100 [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]
- QDist-quartet distance between evolutionary treesThomas Mailund, Christian N. S. Pedersen. bioinformatics, 20(10):1636-1637, 2004. [doi]
- Computing the Quartet Distance Between Trees of Arbitrary DegreeChris Christiansen, Thomas Mailund, Christian N. S. Pedersen, Martin Randers. wabi 2005: 77-88 [doi]
- Computing the Quartet Distance between Evolutionary Trees in Time O(n log n)Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen. algorithmica, 38(2):377-395, 2003. [doi]
- Computing the Quartet Distance between Evolutionary Trees in Time O(n log:::2::: n)Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen. isaac 2001: 731-742 [doi]