Listing all sorting reversals in quadratic time

FieldValue
dc.contributor.authorSwenson, Krister M
dc.contributor.authorBadr, Ghada
dc.contributor.authorSankoff, David
dc.date.accessioned2015-12-18T10:53:20Z
dc.date.available2015-12-18T10:53:20Z
dc.date.issued2011-04-19
dc.identifier.citationAlgorithms for Molecular Biology. 2011 Apr 19;6(1):11
dc.identifier.urihttp://dx.doi.org/10.1186/1748-7188-6-11
dc.identifier.urihttp://hdl.handle.net/10393/33560
dc.description.abstractAbstract 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.
dc.titleListing all sorting reversals in quadratic time
dc.typeJournal Article
dc.date.updated2015-12-18T10:53:20Z
dc.language.rfc3066en
dc.rights.holderSwenson et al; licensee BioMed Central Ltd.
CollectionLibre accès - Publications // Open Access - Publications

Files