Swenson, Krister MBadr, GhadaSankoff, David2015-12-182015-12-182011-04-19Algorithms for Molecular Biology. 2011 Apr 19;6(1):11http://dx.doi.org/10.1186/1748-7188-6-11http://hdl.handle.net/10393/33560Abstract We describe an average-case O(n 2) 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 Ω(n 2) in the worst case.Journal Article2015-12-18enSwenson et al; licensee BioMed Central Ltd.