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

Fig. 5

From: Super short operations on both gene order and intergenic sizes

Fig. 5

a average returned distance, b maximum returned approximation, and c average returned approximation for instances in FRI. In a dotted curves represent the expected number of inversions, dashed curves represent the algorithms for signed permutations, and line curves represent the algorithms for unsigned permutations. Colors relate problems having the expected number of inversions given by the dotted line of same color. This means that SbSSR and SbSigSSR are expected to have inversions as in Inv. 1, SbSST is expected to have inversions as in Inv. 2, and SbSSO and SbSigSSO are expected to have inversions as in Inv. 3. All the approximations in b and c were calculated based on the lower bound of each problem

Back to article page
\