Before revision:  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 consider. We consider the variations in the sorting process by adding with prefix reversals other similar operations such as prefix transpositions and prefix transreversals. These type of sorting problems have applications in interconnection networks and computational biology. We first study 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.