Skip to main content


Figure 1 | Algorithms for Molecular Biology

Figure 1

From: An asymmetric approach to preserve common intervals while sorting by reversals

Figure 1

Different approaches to select an optimal sorting sequence. The permutations (-5, -2, -7, 4, -8, 3, 6, -1) and 8 have only one initially detected non-trivial irreducible common interval, which is {2,..., 8}. (A) A sequence of reversals that sorts the permutation, but does not preserve the initially detected common interval. (B) A sequence of reversals that is a perfect sorting sequence (preserves the initially detected common interval), but does not preserve the new common intervals that appear during the sorting process (such as {3, 4} and {2, 3}). (C) A progressive perfect sequence that sorts the descendant permutation (-5, -2, -7, 4, -8, 3, 6, -1) without breaking the progressively detected irreducible common intervals (listed on the right side).

Back to article page