7 citations · 7 across the 3 of their papers we have counts for
3 papers
Order-Preserving Suffix Trees and Their Algorithmic Applications
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
Recently Kubica et al. (Inf. Process. Let., 2013) and Kim et al. (submitted to Theor. Comp. Sci.) introduced order-preserving pattern matching. In this problem we are looking for c…
Efficient Seeds Computation Revisited
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos +6
The notion of the cover is a generalization of a period of a string, and there are linear time algorithms for finding the shortest cover. The seed is a more complicated generalizat…
On the maximal number of highly periodic runs in a string
Maxime Crochemore, Costas Iliopoulos, Marcin Kubica +3
A run is a maximal occurrence of a repetition with a period such that . The maximal number of runs in a string of length was studied by several authors and…