A Faster And Simpler Algorithm For Sorting Signed Permutations By Reversals (1997)
Cached
Download Links
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- [www.math.tau.ac.il]
- DBLP
Other Repositories/Bibliography
by
Haim Kaplan
,
Ron Shamir
,
Robert E. Tarjan
| Citations: | 89 - 7 self |
BibTeX
@MISC{Kaplan97afaster,
author = {Haim Kaplan and Ron Shamir and Robert E. Tarjan},
title = {A Faster And Simpler Algorithm For Sorting Signed Permutations By Reversals},
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We give a quadratic-time algorithm for finding the minimum number of reversals needed to sort a signed permutation. Our algorithm is faster than the previous algorithm of Hannenhalli and Pevzner and its faster implementation of Berman and Hannenhalli. The algorithm is conceptually simple and does not require special data structures. Our study also considerably simplifies the combinatorial structures used by the analysis.
