Tree rearrangement operations are widely used to measure the dissimilarity between phylogenetic trees with identical leaf sets. The tree bisection and reconnection (tbr) distance for unrooted trees can be equivalently defined in terms of agreement forests. For both the tbr distance and the less general subtree prune and regraft (spr) distance, we use such forests to derive new upper and lower bounds on the maximal possible distance between two trees with n leaves. © 2011 Elsevier Inc.
Ding, Y., Grünewald, S., & Humphries, P. J. (2011). On agreement forests. Journal of Combinatorial Theory. Series A, 118(7), 2059–2065. https://doi.org/10.1016/j.jcta.2011.04.013