Living Reference Work Entry

Encyclopedia of Algorithms

pp 1-5

Date: Latest Version

Sorting Signed Permutations by Reversal (Reversal Sequence)

  • Eric TannierAffiliated withLBBE Biometry and Evolutionary Biology, INRIA Grenoble Rhône-Alpes, University of Lyon Email author 


Genome rearrangements, Genome evolution, Computational biology, Bioinformatics, Sorting by inversions, Inversion distance

Years and Authors of Summarized Original Work

2004; Tannier, Sagot

Problem Definition

A signed permutation\(\uppi\) of size n is a permutation over \(\{ - n,\ldots ,-1,1\ldots n\}\), where \(\uppi _{-i} = -\uppi _{i}\) for all i. We note \(\uppi = (\uppi _{1},\ldots ,\uppi _{n})\).

The reversal\(\uprho =\uprho _{i,j}(1 \leq i \leq j \leq n)\) is an operation that reverses the order and flips the signs of the elements ...

This is an excerpt from the content