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

Fig. 12

From: Heuristic algorithms for best match graph editing

Fig. 12

Summary of the data set of protein-coding gene families from 11 genomes of Aquificales, see [35] for details. We show the distribution of the number of vertex-colored digraphs \((\vec {G},\sigma )\) (histogram) and the median number of arcs \(|E(\vec {G})|\) (\(\diamond \) symbols) for the estimated BMGs as a function of the number of genes \(V|(\vec {G})|\) in each family. The bins (I) \(15\le |V(\vec {G})|< 25\), (II) \(25\le |V(\vec {G})|< 35\), and (III) \(35\le |V(\vec {G})|< 45\) are used for the comparison of the BMG editing methods, see text for details

Back to article page