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

Fig. 1

From: An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes

Fig. 1

On the top we have a fictitious genome \({\mathcal {G}}\), with 5 genes and an intergenic region between each pair of genes and also in the extremities of \({\mathcal {G}}\). Each intergenic region has a specific number of nucleotides (represented by the letters A, C, G, or T). At the bottom, we have the genome representation for the \({\textsc {SbIRT}}\) problem, using a permutation \(\pi\) and a list \(\breve{\pi }\), representing the order of the genes and the sizes of the intergenic regions, respectively. Observe that for each intergenic region \(\breve{\pi }_i\) we have the information about the number of nucleotides inside it

Back to article page