Faster and simpler algorithm for sorting signed permutations by reversals

Haim Kaplan, Ron Shamir, Robert E. Tarjan

Research output: Contribution to conferencePaper

59 Scopus citations

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 languageEnglish (US)
Pages344-351
Number of pages8
StatePublished - Jan 1 1997
EventProceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA, USA
Duration: Jan 5 1997Jan 7 1997

Other

OtherProceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms
CityNew Orleans, LA, USA
Period1/5/971/7/97

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Faster and simpler algorithm for sorting signed permutations by reversals'. Together they form a unique fingerprint.

  • Cite this

    Kaplan, H., Shamir, R., & Tarjan, R. E. (1997). Faster and simpler algorithm for sorting signed permutations by reversals. 344-351. Paper presented at Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, USA, .