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

Fig. 6

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

Fig. 6

A graphical representation of the direct intergenic partition from Example 1. The intergenic regions with dashed lines are the breakpoints and each block is shown in a different color. The superscripts on each gene represent an assignment capable of inducing the partition. The breakpoint between genes \(C^1\) and \(D^1\) is an undercharged hard breakpoint, and the remaining breakpoints are soft

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188