An improved chromosome sorting algorithm by permutation group-based inverted block-interchanges

In comparative genomics, a common issue is to find the shortest course of operations for the transformation of one genome into another. During rejoining the blocks, inverted block interchange, a more distinct form of block interchange, gives the option to the blocks to reverse their orientation. In this particular paper, we have presented an improved algorithm to sort circular chromosomes by inverted block interchanges and also compared the performances with a previous algorithm. Our experimental findings justify the fact that accommodation of inverted block interchange ensures results with equal or less number of series of operations in terms of block interchanges.