Skip to main content
Figure 2 | BMC Bioinformatics

Figure 2

From: The top-scoring ‘N’ algorithm: a generalized relative expression classification method from small numbers of biomolecules

Figure 2

Inversions. (Top) There are four inversions required to translate the sorted list [1 2 3 4] into the permutation [3 4 1 2]. The sum of the digits of the factoradic give the number of inversions required to translate one permutation into another. (Bottom) The grey squares indicate the set of permutations that have a single inversion distance from the original (black) permutations.

Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us