Fig. 1From: Approximation algorithm for rearrangement distances considering repeated genes and intergenic regionsA genome \({\mathcal {G}}= (S,\breve{S})\), with \(S = [I\,\, B\,\, B\,\, A\,\, C\,\, A\,\, A\,\, F]\) and \(\breve{S} = [5\,\, 1\,\, 4\,\, 3\,\, 1\,\, 3\,\, 2]\), and its reverse \(rev({\mathcal {G}})\). The two new genes included in the extension process are represented by the characters I and FBack to article page