5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.DS2017
The complexity of the Multiple Pattern Matching Problem for random strings
Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello
We generalise a multiple string pattern matching algorithm, recently proposed by Fredriksson and Grabowski [J. Discr. Alg. 7, 2009], to deal with arbitrary dictionaries on an alpha…
cs.DM2008★ 5 cited
Constructions for Clumps Statistics
Frederique Bassino, Julien Clement, Julien Fayolle +1
We consider a component of the word statistics known as clump; starting from a finite set of words, clumps are maximal overlapping sets of these occurrences. This parameter has fir…