Package: Quartet 1.4.0

Quartet: Comparison of Phylogenetic Trees Using Quartet and Split Measures

Calculates the number of four-taxon subtrees consistent with a pair of cladograms, calculating the symmetric quartet distance of Bandelt & Dress (1986), Reconstructing the shape of a tree from observed dissimilarity data, Advances in Applied Mathematics <doi:10.1016/0196-8858(86)90038-2>, using the tqDist algorithm of Sand et al. (2014), tqDist: a library for computing the quartet and triplet distances between binary or general trees, Bioinformatics <doi:10.1093/bioinformatics/btu157> for pairs of binary trees; calculating the rooted triplet distance using the CPDT algorithm of Jansson & Rajaby (2017), A more practical algorithm for the rooted triplet distance, Journal of Computational Biology <doi:10.1089/cmb.2016.0185>; these distances can be used to construct consensus trees via the greedy heuristic of Takazawa et al. (2026), Outperforming the majority-rule consensus tree using fine-grained dissimilarity measures, bioRxiv <doi:10.64898/2026.03.16.712085>.

Authors:Martin R. Smith [aut, cre, cph], Jesper Jansson [ant, cph], Ramesh Rajaby [ant, cph], Andreas Sand [ant, cph], Gerth Stølting Brodal [ant, cph], Rolf Fagerberg [ant, cph], Thomas Mailund [ant, cph], Christian N. S. Pedersen [ant, cph], Jens Johansen [ant, cph], Morten K. Holt [ant, cph]