1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2020
Sorting Permutations with Fixed Pinnacle Set
Irena Rusu
We give a positive answer to a question raised by Davis et al. ({\em Discrete Mathematics} 341, 2018), concerning permutations with the same pinnacle set. Given , a {\em…
cs.CC2015★ 1 cited
NP-hardness of sortedness constraints
Irena Rusu
In Constraint Programming, global constraints allow to model and solve many combinatorial problems. Among these constraints, several sortedness constraints have been defined, for w…
q-bio.QM2008
On the Approximability of Comparing Genomes with Duplicates
Sébastien Angibaud, Guillaume Fertin, Irena Rusu +2
A central problem in comparative genomics consists in computing a (dis-)similarity measure between two genomes, e.g. in order to construct a phylogeny. All the existing measures ar…