Fig. 4
From: The link between orthology relations and gene trees: a correction perspective
R and S are the input relation graph and species tree, respectively, for an instance of the Maximum Node ConsistencyProblem (genes of R are labeled by their species). The gene tree G is constructed from R as described in the proof. Leaves of G related through orthology in O are joined by a black solid edge, while paralogs are joined by a dotted line. The graph \(R'\) is a solution to the consistent induced subgraph with \(k = 3\), and H is the DS-tree corresponding to \(R'\). The tree \(G'\) is a solution to the Maximum Clade Correction Problem constructed from H