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

Fig. 5

From: Natural family-free genomic distance

Fig. 5

Performance of the ILP computing the family-free DCJ-indel distance of simulated genomes. The experiment results are displayed in two parts and in both of them instances are grouped by the number of genes with multiple connections (i.e. vertices with degree \(> 1\) in \({\mathcal {S}}_{0.1}\)): a shows the average running time for instances grouped in intervals of 100 and up to 900, and b shows the average optimality gap and the average number of connections for groups of instances that did not finish within the time limit of 1 h (in intervals of 500)

Back to article page