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

Fig. 3

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

Fig. 3

An example galled tree. This tree has three galls. One gall has a top node at the root (node 22), with two side nodes on the left and two on the right. A second gall is in the subtree \(T_L\) descended from the left hybridizing side node of the first gall (node 12); this second gall has only one side node on the left and one side node on the right (its hybridizing side nodes). A third gall is descended from the right non-hybridizing side node of the first gall (node 21)

Back to article page