Before revision: Sorting permutations by reversals and/or transpositions is an important genome rearrangement problem in computational molecular biology. From theoretical point of view, finding efficient algorithms for this problem and its variations are quite challenging. In this paper we consider the problem of sorting unsigned permutations by prefix reversals and prefix transpositions , where a prefix reversal or a prefix transposition is applied always at the unsorted suffix of the given permutation.
After revision: In this paper we study several variations of the the problem of sorting unsigned permutations by prefix reversals and prefix transpositions , where a prefix reversal or a prefix transposition is applied always at the unsorted suffix of the given permutation.