Average-case analysis of perfect sorting by reversals - Mathematics > CombinatoricsReport as inadecuate




Average-case analysis of perfect sorting by reversals - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: A sequence of reversals that takes a signed permutation to the identity isperfect if at no step a common interval is broken. Determining a parsimoniousperfect sequence of reversals that sorts a signed permutation is NP-hard. Herewe show that, despite this worst-case analysis, with probability one, sortingcan be done in polynomial time. Further, we find asymptotic expressions for theaverage length and number of reversals in commuting permutations, aninteresting sub-class of signed permutations.



Author: Mathilde Bouvel LIAFA, Cedric Chauve, Marni Mishna, Dominique Rossin LIAFA

Source: https://arxiv.org/



DOWNLOAD PDF




Related documents