Inversion's combinatorics is not trivial since it involves the permutation of a subsequence and its flips between each strand
(see Sec:Methods, schemata REF  and REF ).
Nevertheless, from the algorithmic point of view, for a given genotype \({\bf x}\)  the mutational operations can be used to enumerate all the accessible mutants (see Sec:Methods, Algorithm REF : Mutate).
Also, the combinatorics can be represented as a directed multigraph of mutations \(\mathrm {m}({\bf x}),\forall \bf x\in \mathcal {X}\)  (see the mathematical definition in [1]}), i.e. the ordered triple
\(\mathrm {m}=(V(\mathrm {m}),E(\mathrm {m}),I_{\mathrm {m}}),\) 
