Fig. 2
From: Embedding gene trees into phylogenetic networks by conflict resolution algorithms
Top left: The unfolded network \(\hat{N}\) of N from Fig. 1 is shown with \(\sigma\) values attached to nodes, where for the leaves, the index is inserted to distinguish leaves with the same labels/mappings. Bottom: 6 scenarios for \(G=((a,(b,c)),d)\) shown as embeddings of G to \(\hat{N}\). Numbers I–IV denote the type of a visited edge. Only \(E_1\) is regular, while \(E_1-E_4\) are optimal. Top right: DC score and types of used reticulation edges for each scenario (\(\Upsilon _{[.]}\)).