Skip to main content

Advertisement

Fig. 2 | Algorithms for Molecular Biology

Fig. 2

From: Sorting signed circular permutations by super short operations

Fig. 2

Transformation flow starting with a VD-vector X. Note that applying a second transformation at the same positions from the first transformation but reversed results again in X (see the transformations where both indices are in red). Note also that every VD-vector obtained from X (in gray) can be transformed into two different VD-vectors (that are also obtained from X) when we use one of the two indices from the first transformation from X (see the transformations from gray VD-vectors where one of the indices is in red). The VD-vector \(X''\) can be obtained from the four VD-vectors in gray but not from X. Supposing \(X \in S\), if all VD-vectors in gray are in \(S'\), then \(X'' \not \in S \cup S'\). If one (or more) VD-vector in gray is also in S, then it follows that \(X'' \in S'\)

Back to article page