One needs to make sorting with specific transformations called "reversals", denoted "R[i,j]", 
such transformation takes a subsequence from i-th to j-th position, and just reverts its order.

Biologically it corresponds to break of DNA sequence at two positions i and j, and then cell reparation machinery puts the fragment back to its position, but it can make mistake and can reverse the order of the genes.

The function generating such permutation transformations can be found [here](https://cayleypy.github.io/cayleypy-docs/generated/cayleypy.PermutationGroups.html#cayleypy.PermutationGroups.full_reversals). 

The number of such transformation between two such sequences (DNAs) may be useful to estimate the evolutionary distance between two different genomes. 

The task is exactly to find as short sequence of transformations as possible.