Average-case analysis of perfect sorting by reversals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Lecture Notes in Computer Science Année : 2009

Average-case analysis of perfect sorting by reversals

Résumé

A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show that, despite this worst-case analysis, with probability one, sorting can be done in polynomial time. Further, we find asymptotic expressions for the average length and number of reversals in commuting permutations, an interesting sub-class of signed permutations.
Fichier principal
Vignette du fichier
HAL.pdf (160.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00354235 , version 1 (19-01-2009)

Identifiants

Citer

Mathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin. Average-case analysis of perfect sorting by reversals. CPM'09, Jun 2009, Lille, France. pp.314-325, ⟨10.1007/978-3-642-02441-2_28⟩. ⟨hal-00354235⟩
135 Consultations
118 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More