Sorting by Prefix Reversals and Prefix Transpositions

In this paper, we present a new algorithm for the Sorting by Prefix Reversals and Prefix Transpositions Problem. The previous approximation algorithm was bounded by factor 3, and here we present an asymptotic 2-approximation algorithm. We consider theoretical and practical aspects in our analysis, and we show that our method is better than other approaches in both cases.