Sorting by transpositions based on the first increasing substring

In computational molecular biology, genome rearrangement is a fundamental important problem: Given two sequences representing two species, compute a smallest series of a specific operation for transforming a sequence to another sequence. We could have some insight as how far away genetically these species from genome rearrangement. There are different problems according to distinct operations such as sorting by reversals, sorting by transpositions and so on. In this paper, we proposed the concept of the increasing substring, and presented an approach based upon the first increasing substring for sorting by transpositions.