Publications (25)
Linear-Time Algorithm for Long LCF with $k$ Mismatches
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos +5
Fewest repetitions in infinite binary words
Golnaz Badkobeh, Maxime Crochemore
Quasi-Linear-Time Algorithm for Longest Common Circular Factor
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos +6
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications
Maxime Crochemore, Gabriele Fici, Robert MercaÅ +1
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression
Maxime Crochemore, Alessio Langiu, Filippo Mignosi
A note on the Burrows-Wheeler transformation
Maxime Crochemore, Jacques Désarménien, Dominique Perrin
A Note on the Longest Common Compatible Prefix Problem for Partial Words
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
Suffix Tree of Alignment: An Efficient Index for Similar Data
Joong Chae Na, Heejin Park, Maxime Crochemore +4
On the maximal number of highly periodic runs in a string
Maxime Crochemore, Costas Iliopoulos, Marcin Kubica +3
Finite-Repetition threshold for infinite ternary words
Golnaz Badkobeh, Maxime Crochemore
Cartesian trees and Lyndon trees
Maxime Crochemore, Luis M. S. Russo
A Note on Efficient Computation of All Abelian Periods in a String
Maxime Crochemore, Costas Iliopoulos, Tomasz Kociumaka +6
Efficient Seeds Computation Revisited
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos +6
Quasiperiodicities in Fibonacci strings
Michalis Christou, Maxime Crochemore, Costas Iliopoulos
The Rightmost Equal-Cost Position Problem
Maxime Crochemore, Alessio Langiu, Filippo Mignosi
Understanding maximal repetitions in strings
Maxime Crochemore, Lucian Ilie
Fewer runs than word length
Maxime Crochemore, Robert Mercas
Order-Preserving Suffix Trees and Their Algorithmic Applications
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +6
Linear Algorithm for Conservative Degenerate Pattern Matching
Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu +2
Covering Problems for Partial Words and for Indeterminate Strings
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +3
Identifying all abelian periods of a string in quadratic time and relevant problems
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +5
Alignment-free sequence comparison using absent words
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici +2
On the maximal sum of exponents of runs in a string
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski +2
Optimal searching of gapped repeats in a word
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov