Average-case analysis of perfect sorting by reversals

Simple item page
dc.creatorBouvel, Mathilde
dc.creatorChauve, Cedric
dc.creatorMishna, Marni
dc.creatorRossin, Dominique
dc.date2009-01-19
dc.date.accessioned2026-07-07T13:15:26Z
dc.date.available2026-07-07T13:15:26Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/0901.2847
dc.identifierhttp://arxiv.org/abs/0901.2847
dc.identifierCPM'09, Lille : France (2009)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/230472
dc.subjectCombinatorics
dc.subjectData Structures and Algorithms
dc.subjectQuantitative Methods
dc.subject05A05, 05A16, 05C90, 05C05
dc.titleAverage-case analysis of perfect sorting by reversals
dc.typetext

Files

Collections

arXiv