An Efficient O(n log n) Algorithm for Sorting Signed Permutations by Reversals

This article presents the first algorithm that runs in O(n log n) time in the worst case for the Signed Sorting by Reversals problem, which transforms a signed permutation into the identity permutation using a minimum-length sequence of reversals.