Fig. 2
From: On the parameterized complexity of the median and closest problems under some permutation metrics
Sorting sequence of \([4 \, 3\, 2\, 1\, 5]\). The first transposition is a 0-move, while the others are 2-moves
Fig. 2 | Algorithms for Molecular Biology