Skip to main content
Conference Proceedings

Listing all sorting reversals in quadratic time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6293 LNBI 102-110
DOI: 10.1007/978-3-642-15294-8_9
3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe an average-case O(n2) algorithm to list all reversals on a signed permutation π that, when applied to π, produce a permutation that is closer to the identity. This algorithm is optimal in the sense that, the time it takes to write the list is Ω(n2) in the worst case. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Swenson, K. M., Badr, G., & Sankoff, D. (2010). Listing all sorting reversals in quadratic time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6293 LNBI, pp. 102–110). https://doi.org/10.1007/978-3-642-15294-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free