title: Fast algorithms for transforming back and forth between a signed permutation and its equivalent simple permutation.
abstract: The problem of sorting signed permutations by reversals is a well-studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pevzner in 1995. The algorithm was improved several times, and nowadays the most efficient algorithm has a subquadratic running time. Simple permutations played an important role in the development of these algorithms. Although the latest result of Tannier et al. does not require simple permutations, the preliminary version of their algorithm as well as the first polynomial time algorithm of Hannenhalli and Pevzner use the structure of simple permutations. More precisely, the latter algorithms require a precomputation that transforms a permutation into an equivalent simple permutation. To the best of our knowledge, all published algorithms for this transformation have at least a quadratic running time. For further investigations on genome rearrangement problems, the existence of a fast algorithm for the transformation could be crucial. Another important task is the back transformation, i.e. if we have a sorting on the simple permutation, transform it into a sorting on the original permutation. Again, the naive approach results in an algorithm with quadratic running time. In this paper, we present a linear time algorithm for transforming a permutation into an equivalent simple permutation, and an O(n log n) algorithm for the back transformation of the sorting sequence.
authors.affiliation: Faculty of Engineering and Computer Sciences, Ulm University, Ulm, Germany. simon.gog@uni-ulm.de
authors.forename: Simon
authors.initials: S
authors.lastname: Gog
authors.forename: Martin
authors.initials: M
authors.lastname: Bader
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods; D016678:Genome; D008957:Models, Genetic