Abstract
We give a quadratic 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.
Original language | English (US) |
---|---|
Pages | 163 |
Number of pages | 1 |
DOIs | |
State | Published - 1997 |
Event | Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB - Santa Fe, NM, USA Duration: Jan 20 1997 → Jan 23 1997 |
Other
Other | Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB |
---|---|
City | Santa Fe, NM, USA |
Period | 1/20/97 → 1/23/97 |
All Science Journal Classification (ASJC) codes
- General Engineering