All that Glisters is not Galled

Galled trees, evolutionary networks with isolated reticulation cycles, have appeared under several slightly different definitions in the literature. In this paper we establish the actual relationships between the main four such alternative definitions: namely, the original galled trees, level-1 networks, nested networks with nesting depth 1, and evolutionary networks with arc-disjoint reticulation cycles.

💡 Research Summary

The paper investigates four closely related concepts that have been used to describe phylogenetic networks with isolated reticulation cycles: the original galled trees, level‑1 networks, 1‑nested networks (nesting depth 1), and networks with arc‑disjoint reticulation cycles (weakly galled trees). Although these notions appear in the literature with slight variations, their precise relationships had not been fully clarified. The authors first formalize each definition. A galled tree requires that any two reticulation cycles be vertex‑disjoint; this automatically forces each hybrid node to have indegree 2 (the “2‑hybrid” condition). A weakly galled tree relaxes the disjointness to the level of arcs rather than vertices, but still implies the 2‑hybrid property. A 1‑nested network demands that the sets of intermediate vertices of cycles belonging to different hybrid nodes be disjoint. Finally, a level‑1 network is defined by the restriction that every biconnected subgraph contains at most one hybrid node.

Through a series of lemmas and propositions the authors map out the inclusion hierarchy among these classes. Lemma 1 establishes a basic structural fact about reticulation cycles, while Lemma 2 proves that any weakly galled tree (and therefore any galled tree) must be 2‑hybrid. Proposition 1 shows that every level‑1 network is necessarily 1‑nested, because a vertex that lies in the interior of cycles for two distinct hybrids would create a biconnected component containing two hybrids, contradicting the level‑1 definition. The converse does not hold in general; Figure 1(b) provides a counter‑example of a 1‑nested network that is not level‑1. Theorem 1 demonstrates that this counter‑example captures the only possible obstruction, so apart from this special case the two notions are closely related. Lemma 3 further proves that a 1‑nested network cannot contain a reticulation cycle with an intermediate hybrid node, because such a configuration would force two cycles to share an arc, violating the 1‑nested condition.

The paper then turns to the fully resolved (binary) case, where every tree node has out‑degree 2 and every hybrid node has indegree 2 and out‑degree 1. Under these stringent degree constraints, all four definitions collapse to the same class of networks. Consequently, in the binary setting the original galled trees, weakly galled trees, 1‑nested networks, and level‑1 networks are indistinguishable.

In summary, the authors establish three main results: (i) under the 2‑hybrid restriction, 1‑nested networks are exactly the weakly galled trees; (ii) level‑1 networks form a strictly larger class than 1‑nested networks, which in turn are strictly larger than the original galled trees; and (iii) when networks are fully resolved, all four definitions coincide. These findings clarify the theoretical landscape of constrained phylogenetic networks, informing both complexity analyses of reconstruction algorithms and the design of new methods that may relax degree constraints while preserving desirable structural properties.