Fig. 11
From: Relative timing information and orthology in evolutionary scenarios
The graph 3-partition \(\mathcal {G}= (G_{_{<}}, G_{_{=}}, G_{_{>}}, \sigma )\) used in Fig. 9 as illustration of Algorithm 1 is explained by different scenarios: Depending on the choice in Line 19, Algorithm 1 can return \(\mathcal {S}_1\) as well as the restricted scenario \(\mathcal {S}_2\). To ensure that always a restricted scenario is returned we provide an alternative subroutine (summarized in Algorithm 2 below) that can be used in Algorithm 1