Listing all sorting reversals in quadratic time
<p>Abstract</p> <p>We describe an average-case <it>O</it>(<it>n</it><sup>2</sup>) algorithm to list all reversals on a signed permutation <it>π </it>that, when applied to <it>π</it>, produce a permutation that is closer to...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2011-04-01
|
| Series: | Algorithms for Molecular Biology |
| Online Access: | http://www.almob.org/content/6/1/11 |
| Summary: | <p>Abstract</p> <p>We describe an average-case <it>O</it>(<it>n</it><sup>2</sup>) algorithm to list all reversals on a signed permutation <it>π </it>that, when applied to <it>π</it>, 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 Ω(<it>n</it><sup>2</sup>) in the worst case.</p> |
|---|---|
| ISSN: | 1748-7188 |