The inverse tandem duplication random loss (iTDRL) genome rearrangement duplicates and inverts a continuous segment of a given gene order followed by the random loss of one of the redundant copies of each gene. The iTDRL rearrangement has currently been proposed by several authors suggesting it to be an possible mechanisms of mitochondrial gene order evolution. Here we present the algorithm SBiTDRL that calculates a shortest rearrangement scenario that transforms one given gene order into another given gene order. In addition, it calculates the minimum number of iTDRLs in such a transformation. The algorithm runs in quasilinear time with respect to the total number of genes in the given gene orders.

Algorithm SBiTDRL is implemented in C++ and does not have any dependency.

Download SPiTDRL from here.


Tom Hartmann, Max Bannach, Martin Middendorf
Sorting Signed Permutations by Inverse Tandem Duplication Random Losses
submitted for publication