32 citations · 66 across the 16 of their papers we have counts for
17 papers
Efficient Computation of Periods and Covers Using Sampling
Thierry Lecroq, Francesco Pio Marino
Identifying regularities in strings, such as \emph{periods} and \emph{covers}, is crucial for applications in text compression, computational biology, and pattern recognition. \emp…
A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
Thierry Lecroq
String matching is the problem of finding all the occurrences of a pattern in a text. It has been intensively studied and the Boyer-Moore string matching algorithm is probably one…
Approximate Cartesian Tree Matching: an Approach Using Swaps
Bastien Auvray, Julien David, Richard Groult +1
Cartesian tree pattern matching consists of finding all the factors of a text that have the same Cartesian tree than a given pattern. There already exist theoretical and practical…
Optimal-Hash Exact String Matching Algorithms
Thierry Lecroq
String matching is the problem of finding all the occurrences of a pattern in a text. We propose improved versions of the fast family of string matching algorithms based on hashing…
Practical KMP/BM Style Pattern-Matching on Indeterminate Strings
Hossein Dehghani, Neerja Mhaskar, W. F. Smyth
In this paper we describe two simple, fast, space-efficient algorithms for finding all matches of an indeterminate pattern in an indeterminate string , w…
Fast Multiple Pattern Cartesian Tree Matching
Geonmo Gu, Siwoo Song, Simone Faro +2
Cartesian tree matching is the problem of finding all substrings in a given text which have the same Cartesian trees as that of a given pattern. In this paper, we deal with Cartesi…