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

Fig. 2

From: Relative timing information and orthology in evolutionary scenarios

Fig. 2

Left: a relaxed scenario \(\mathcal {S}=(T,S,\sigma ,\mu ,\tau _{T},\tau _{S})\). The maps \(\mu \) and \(\sigma \) are shown implicitly by the embedding of T into S and the colors of the leaves of T, respectively. If a vertex x is drawn higher than a vertex y, this means that \(\tau (y) <\tau '(x)\), \(\tau ,\tau '\in \{\tau _{T},\tau _{S}\}\). In the remainder of the paper, we will omit drawing the time axis explicitly. Right: The graph 3-partition \(\mathcal {G}(\mathcal {S})\) that is explained by \(\mathcal {S}\). Throughout, the edges of the LDT graph \(G_{_{<}}(\mathcal {S})\), EDT graph \(G_{_{=}}(\mathcal {S})\), and PDT graph \(G_{_{>}}(\mathcal {S})\) will always be drawn as dashed, solid straight, and wavy lines, respectively

Back to article page