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

Fig. 13

From: Heuristic algorithms for best match graph editing

Fig. 13

Performance of the BMG editing heuristics for the Aquificales data, measured as the number of arc differences between input digraphs and editing results. As above, the light green indicates the “direct” performance of each method, i.e., the digraph \(\vec {G}(T,\sigma )\) where T is the tree that is directly constructed by each method, whereas the dark green indicates the results if the methods are used as heuristic for MaxRTC in Alg. 1. The three panels show the results for the bins (I) \(15\le |V(\vec {G})|< 25\), (II) \(25\le |V(\vec {G})|< 35\), and (III) \(35\le |V(\vec {G})|< 45\), respectively, as indicated in Fig. 12

Back to article page