8 citations · 32 across the 26 of their papers we have counts for
Showing 2013 · cs.DSShow all
3 papers · 2 filters
cs.DS2013
A Note on the Longest Common Compatible Prefix Problem for Partial Words
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
For a partial word the longest common compatible prefix of two positions , denoted , is the largest such that , where $\uparr…
cs.DS2013
Suffix Tree of Alignment: An Efficient Index for Similar Data
Joong Chae Na, Heejin Park, Maxime Crochemore +4
We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings and is a compact…
cs.DS2013★ 7 cited
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…