Working on the problem of sorting by transpositions on genome rearrangements

In computational biology, genome rearrangements is a field in which we investigate the combinatorial problem of sorting by transpositions. This problem consists in finding the minimum number of transpositions (mutational event) that transform a chromosome into another. In this work, we implement the 1.5-approximation algorithm proposed by Christie [2] for solving this problem, introducing modifications to reduce its time complexity, and we also propose heuristics to further improve its performance. Comparing our experimental results with the best known results, we had better performance. This work targets to contribute for discovering the complexity of the problem of sorting by transpositions, which remains open.