Skip to main content
Fig. 4 | Algorithms for Molecular Biology

Fig. 4

From: All galls are divided into three or more parts: recursive enumeration of labeled histories for galled trees

Fig. 4

Removing a gall does not decrease the number of labeled histories. A A tree with one gall. B A tree obtained from A via a transformation that removes the gall; we remove the hybrid node and one of the hybridizing side nodes, choosing the right hybridizing side node arbitrarily here. We then add two edges, between the left hybridizing side node and the child of the hybrid node, and between the parent and remaining child of the right hybridizing side node (blue). Each labeled history for A has a corresponding labeled history in B

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188