9 citations · 16 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.FL2013
Searching of gapped repeats and subrepetitions in a word
Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin +1
A gapped repeat is a factor of the form where and are nonempty words. The period of the gapped repeat is defined as . The gapped repeat is maximal if it cann…
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…