7 citations · 9 across the 7 of their papers we have counts for
5 papers · 1 filter
Algorithms for Longest Common Abelian Factors
Ali Alatabbi, Costas S. Iliopoulos, Alessio Langiu +1
In this paper we consider the problem of computing the longest common abelian factor (LCAF) between two given strings. We present a simple time algorithm, where is…
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…
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…
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression
Maxime Crochemore, Alessio Langiu, Filippo Mignosi
Dynamic dictionary-based compression schemes are the most daily used data compression schemes since they appeared in the foundational papers of Ziv and Lempel in 1977, commonly ref…
The Rightmost Equal-Cost Position Problem
Maxime Crochemore, Alessio Langiu, Filippo Mignosi
LZ77-based compression schemes compress the input text by replacing factors in the text with an encoded reference to a previous occurrence formed by the couple (length, offset). Fo…