8 citations · 32 across the 26 of their papers we have counts for
6 papers · 1 filter
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…
A Note on Efficient Computation of All Abelian Periods in a String
Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka +6
We derive a simple efficient algorithm for Abelian periods knowing all Abelian squares in a string. An efficient algorithm for the latter problem was given by Cummings and Smyth in…
Fewest repetitions in infinite binary words
Golnaz Badkobeh, Maxime Crochemore
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length…
Identifying all abelian periods of a string in quadratic time and relevant problems
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Abelian periodicity of strings has been studied extensively over the last years. In 2006 Constantinescu and Ilie defined the abelian period of a string and several algorithms for t…
Quasiperiodicities in Fibonacci strings
Michalis Christou, Maxime Crochemore, Costas Iliopoulos
We consider the problem of finding quasiperiodicities in a Fibonacci string. A factor u of a string y is a cover of y if every letter of y falls within some occurrence of u in y. A…