3 citations · 4 across the 8 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2012
The complexity of string partitioning
Anne Condon, Ján Maňuch, Chris Thachuk
Given a string over a finite alphabet and an integer , can be partitioned into strings of length at most , such that there are no \emph{collisions}? We refer to t…
cs.CC2009★ 1 cited
Hardness Results for the Gapped Consecutive-Ones Property
Cedric Chauve, Jan Manuch, Murray Patterson
Motivated by problems of comparative genomics and paleogenomics, in [Chauve et al., 2009], the authors introduced the Gapped Consecutive-Ones Property Problem (k,delta)-C1P: given…