32 citations · 135 across the 28 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2016★ 2 cited
Analysis of Algorithms for Permutations Biased by Their Number of Records
Nicolas Auger, Mathilde Bouvel, Cyril Nicaud +1
The topic of the article is the parametric study of the complexity of algorithms on arrays of pairwise distinct integers. We introduce a model that takes into account the non-unifo…
cs.DM2012★ 1 cited
Average-case analysis of perfect sorting by reversals (Journal Version)
Mathilde Bouvel, Cedric Chauve, Marni Mishna +1
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity per…