Figure 5From: A sub-cubic time algorithm for computing the quartet distance between two general treesComparing two edges. A pair of inner edges, e ∈ T, e' ∈ T', where F i (G j ) is the sub-tree behind e (e') and F k , k ≠ i (G l , l ≠ j) the remaining subtrees of the node pointed to by e (e'). Highlighted are two claims, one from each tree.Back to article page