Sorting Signed Permutations by Reversal (Reversal Distance)
- David A. BaderAffiliated withCollege of Computing, Georgia Institute of Technology Email author
KeywordsInversion distance Reversal distance Sorting by reversals
Years and Authors of Summarized Original Work
2001; Bader, Moret, Yan
This entry describes algorithms for finding the minimum number of steps needed to sort a signed permutation (also known as inversion distance, reversal distance). This is a real-world problem and, for example, is used in computational biology.
Inversion distance is a difficult computational problem that has been studied intensively in recent years [1, 4, 6–10]. Finding the inversion distance between unsigned permutations is NP-hard , but with signed ones, it can be done in linear time .
Bader et al.  present the first worst-case linear-time algorithm for computing the reversal distance that is simple and practical and runs faster than previous methods. Their key innovation is a new technique to compute connected components of the overlap graph using only a stack, which results in the simple linear-time algorithm for computing the inversion distance between two signed permutations. Ba ...
Reference Work Entry Metrics
- Sorting Signed Permutations by Reversal (Reversal Distance)
- Reference Work Title
- Encyclopedia of Algorithms
- pp 2026-2028
- Print ISBN
- Online ISBN
- Springer New York
- Copyright Holder
- Springer Science+Business Media New York
- Additional Links
- Inversion distance
- Reversal distance
- Sorting by reversals
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.