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

Fig. 1

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

Fig. 1

Galled trees. A A galled tree with two galls. B A galled tree with the same labeled topology as A but with a different labeled history. C A network that is not a galled tree because it contains nested cycles. D A network that is not a galled tree because it has cycles that share vertices. This network would be included in the class of galled networks [8], which is distinct from the class of galled trees

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188