Fig. 2
From: A generalized Robinson-Foulds distance for labeled trees
Two unrooted and labeled trees T and T′ on \({\mathcal L} = \{A, B, C, D, E, F, G\}\). The square and circle symbols represent the two possible labels for an internal node. Bad edges are red and good ones are black. {S1,S2} are the maximal bad subtrees of T and {S1′,S2′} the corresponding subtrees of T′