Mathieu Raffinot

collaborators

3 papers

cs.DS2013

Various improvements to text fingerprinting

Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot

Let s = s_1 .. s_n be a text (or sequence) on a finite alphabet Σof size σ. A fingerprint in s is the set of distinct characters appearing in one of its substrings. The problem con…

cs.DS2013

Single and multiple consecutive permutation motif search

Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot +1

Let $t$ be a permutation (that shall play the role of the {\em text}) on $[n]$ and a pattern $p$ be a sequence of $m$ distinct integer(s) of $[n]$ , $m \leq n$ . The pattern $p$ occur…

cs.DS2010

Consecutive ones property testing: cut or swap

Mathieu Raffinot

Let C be a finite set of $N elements and R = {R_1,R_2, ..,R_m} a family of M subsets of C. The family R verifies the consecutive ones property if there exists a permutation P of C…