36 citations · 62 across the 17 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★ 36 cited
Internal Pattern Matching Queries in a Text and Applications
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +1
We consider several types of internal queries, that is, questions about fragments of a given text specified in constant space by their locations in . Our main result is an o…
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…