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

Fig. 10

From: Heuristic algorithms for best match graph editing

Fig. 10

Running times of the different methods for BMG editing. The time only includes the construction of the tree T, i.e., Alg. 2 or BPMF, resp., but not the extraction of the triple set \({\mathcal {R}}^*\) followed by rerunning BUILD. For each number of leaves \(N\in \{10,20,30,40\}\) and each number of colors \(\ell \) (taken from \(\{2,5,10,20\}\) such that \(\ell <N\)), 100 perturbed BMGs were generated using equal insertion and deletion probabilities of 0.1. In the right panel, the median values are shown with logarithmic axes

Back to article page