4 citations · 8 across the 4 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
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 be a permutation (that shall play the role of the {\em text}) on and a pattern be a sequence of distinct integer(s) of , . The pattern occur…