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

Fig. 3

From: Approximation algorithm for rearrangement distances considering repeated genes and intergenic regions

Fig. 3

One of the possible orthologous assignments between two balanced genomes \({\mathcal {G}}=([A\,\, E\,\, B\,\, C\,\, D\,\, E\,\, D\,\, E],[1\,\, 2\,\, 2\,\, 1\,\, 3\,\, 2\,\, 3])\) and \({\mathcal {H}}=([C\,\, D\,\, E\,\, A\,\, E\,\, B\,\, D\,\, E],[3\,\, 3\,\, 1\,\, 1\,\, 2\,\, 1\,\, 3])\). The superscripts on each gene represent the assignment (characters with same label and same index are associated with each other, i.e., \(\xi (X^i) = X^i\))

Back to article page