Fig. 1From: Testing the agreement of trees with internal labelsA profile \({\mathcal {P}}= \{{\mathcal {T}}_1, {\mathcal {T}}_2, {\mathcal {T}}_3, {\mathcal {T}}_4\}\). The letters are the original labels; grey numbers are labels added to make the trees fully labeled. We use this profile as a running example throughout the paperBack to article page