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: | Badr Ghada, Swenson Krister M, Sankoff David |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2011-04-01
|
Series: | Algorithms for Molecular Biology |
Online Access: | http://www.almob.org/content/6/1/11 |
Similar Items
-
LazySorted: A Lazily, Partially Sorted Python List
by: Naftali Harris
Published: (2015-06-01) -
All Sorts of Shorts
by: Terry, Tobin F.
Published: (2009) -
Quadratic regular reversal maps
by: Francisco J. Solis, et al.
Published: (2004-01-01) -
Dynamic algorithms for partially-sorted lists
by: Ross, Kostya Kamalah
Published: (2015) -
Sorting by Reversals in Genome Rearrangement
by: Ya-Lin Lin, et al.
Published: (2012)