Listing all sorting reversals in quadratic time
| dc.contributor.author | Swenson, Krister M | |
| dc.contributor.author | Badr, Ghada | |
| dc.contributor.author | Sankoff, David | |
| dc.date.accessioned | 2015-12-18T10:53:20Z | |
| dc.date.available | 2015-12-18T10:53:20Z | |
| dc.date.issued | 2011-04-19 | |
| dc.date.updated | 2015-12-18T10:53:20Z | |
| dc.description.abstract | Abstract 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.identifier.citation | Algorithms for Molecular Biology. 2011 Apr 19;6(1):11 | |
| dc.identifier.uri | http://dx.doi.org/10.1186/1748-7188-6-11 | |
| dc.identifier.uri | http://hdl.handle.net/10393/33560 | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Swenson et al; licensee BioMed Central Ltd. | |
| dc.title | Listing all sorting reversals in quadratic time | |
| dc.type | Journal Article |
Fichiers
Trousse originale
1 - 1 sur 1
En cours de chargement...
- Nom:
- 13015_2010_Article_125.pdf
- Taille:
- 326.76 KB
- Format:
- Adobe Portable Document Format
Trousse de licence
1 - 1 sur 1
En cours de chargement...
- Nom:
- license.txt
- Taille:
- 4.92 KB
- Format:
- Item-specific license agreed upon to submission
- Description: