7 citations · 13 across the 25 of their papers we have counts for
5 papers · 2 filters
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…
The Swap Matching Problem Revisited
Pritom Ahmed, Costas S. Iliopoulos, A. S. M. Sohidull Islam +1
In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap Matching problem, for short). We first present a graph-theoretic model, which opens a new an…
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…
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…
Order Preserving Matching
Jinil Kim, Peter Eades, Rudolf Fleischer +5
We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders…