Fig. 4
From: The distance and median problems in the single-cut-or-join model with single-gene duplications
Part (i) of the figure shows an instance of the rooted median problem. Genomes A, \(D_1\) and \(D_2\) and the gene content of M are provided. Each adjacency in A has been assigned a color family. For instance, any adjacency \(a_hb_t\) in the median belongs to the red family. Part (ii) translates the problem into an instance of the colored MWM problem. Only, candidate adjacencies, appearing in at least two out of the three given genomes can be seen in the graph. The bold edges, forming a matching on the graph, denote the optimal median. Part (iii) lists the contributions of each of the selected edges