Listing all sorting reversals in quadratic time

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.

Saved in:
Bibliographic Details
Published inAlgorithms for molecular biology Vol. 6; no. 1; p. 11
Main Authors Swenson, Krister M, Badr, Ghada, Sankoff, David
Format Journal Article
LanguageEnglish
Published England BioMed Central Ltd 19.04.2011
BioMed Central
BMC
Subjects
Genetic recombination
Genomes
Permutations
Canada
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1748-7188
1748-7188
DOI:10.1186/1748-7188-6-11