Maxime Crochemore

ORCID

Publication Activity (10 Years)

Years Active: 1980-2023
Publications (10 Years): 51

Top Venues

CoRR

Theor. Comput. Sci.

CPM

J. Discrete Algorithms

Publications

Marie-Pierre Béal, Maxime Crochemore
Fast Detection of Specific Fragments Against a Set of Sequences. DLT (2023)
Golnaz Badkobeh, Maxime Crochemore
Linear construction of a left Lyndon tree. Inf. Comput. 285 (Part) (2022)
Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud
Back-To-Front Online Lyndon Forest Construction. CPM (2022)
Marie-Pierre Béal, Maxime Crochemore
Fast detection of specific fragments against a set of sequences. CoRR (2022)
Marie-Pierre Béal, Maxime Crochemore
Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. 933 (2022)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Linear-Time Computation of Shortest Covers of All Rotations of a String. CPM (2022)
Marie-Pierre Béal, Maxime Crochemore
Checking whether a word is Hamming-isometric in linear time. CoRR (2021)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Shortest covers of all cyclic shifts of a string. Theor. Comput. Sci. 866 (2021)
Golnaz Badkobeh, Maxime Crochemore
Left Lyndon Tree Construction. Stringology (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Internal Quasiperiod Queries. SPIRE (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Internal Quasiperiod Queries. CoRR (2020)
Golnaz Badkobeh, Maxime Crochemore
Left Lyndon tree construction. CoRR (2020)
Maxime Crochemore, Costas S. Iliopoulos, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Shortest Covers of All Cyclic Shifts of a String. WALCOM (2020)
Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat
Absent words in a sliding window with applications. Inf. Comput. 270 (2020)
Maxime Crochemore, Luís M. S. Russo
Cartesian and Lyndon trees. Theor. Comput. Sci. 806 (2020)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CoRR (2019)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. CPM (2019)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37 (2) (2019)
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
-gapped repeats. Inf. Comput. 268 (2019)
Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto
-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology (2019)
Maxime Crochemore, Jakub Radoszewski
Special issue in honor of the 70th birthday of Prof. Wojciech Rytter. Theor. Comput. Sci. 792 (2019)
Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
How Much Different Are Two Words with Different Shortest Periods. AIAI (Workshops) (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Alignment-free sequence comparison using absent words. CoRR (2018)
João A. Carriço, Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Bruno Ribeiro-Gonçalves, Cátia Vaz
Fast phylogenetic inference from typing data. Algorithms Mol. Biol. 13 (1) (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Linear-Time Algorithm for Long LCF with k Mismatches. CoRR (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Linear-Time Algorithm for Long LCF with k Mismatches. CPM (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Alignment-free sequence comparison using absent words. Inf. Comput. 262 (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis
On Extended Special Factors of a Word. SPIRE (2018)
Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis
Preface. Fundam. Informaticae 163 (3) (2018)
Maxime Crochemore, Solon P. Pissis
Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos). Theor. Comput. Sci. 710 (2018)
Supaporn Chairungsee, Maxime Crochemore
Longest Previous Non-overlapping Factors Table Computation. COCOA (2) (2017)
Maxime Crochemore, Luís M. S. Russo
Cartesian trees and Lyndon trees. CoRR (2017)
Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes. COCOON (2017)
Golnaz Badkobeh, Maxime Crochemore, Robert Mercas
Counting maximal-exponent factors in words. Theor. Comput. Sci. 658 (2017)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Covering problems for partial words and for indeterminate strings. Theor. Comput. Sci. 698 (2017)
Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. FCT (2017)
Maxime Crochemore, Costas S. Iliopoulos, Alessio Langiu, Filippo Mignosi
The longest common substring problem. Math. Struct. Comput. Sci. 27 (2) (2017)
Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Cátia Vaz
Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time. WABI (2017)
Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol
Locating maximal approximate runs in a string. Theor. Comput. Sci. 700 (2017)
Golnaz Badkobeh, Maxime Crochemore, Manal Mohamed, Chalita Toopsuwan
Efficient computation of maximal anti-exponent in palindrome-free strings. Theor. Comput. Sci. 656 (2016)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Quasiperiodicities in Fibonacci strings. Ars Comb. 129 (2016)
Maxime Crochemore, Chiara Epifanio, Roberto Grossi, Filippo Mignosi
Linear-size suffix tries. Theor. Comput. Sci. 638 (2016)
Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
Linear algorithm for conservative degenerate pattern matching. Eng. Appl. Artif. Intell. 51 (2016)
Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
40 years of suffix trees. Commun. ACM 59 (4) (2016)
Maxime Crochemore, Robert Mercas
On the density of Lyndon roots in factors. Theor. Comput. Sci. 656 (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-preserving indexing. Theor. Comput. Sci. 638 (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE (2016)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR (2016)
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
Optimal Bounds for Computing \alpha α -gapped Repeats. LATA (2016)
Golnaz Badkobeh, Maxime Crochemore
Computing maximal-exponent factors in an overlap-free word. J. Comput. Syst. Sci. 82 (3) (2016)
Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. LATIN (2016)
Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. CoRR (2015)
Maxime Crochemore, Roman Kolpakov, Gregory Kucherov
Optimal searching of gapped repeats in a word. CoRR (2015)
Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták
StringMasters 2012 & 2013 special issue - volume 2. J. Discrete Algorithms 32 (2015)
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
Computing the Burrows-Wheeler transform in place and in small space. J. Discrete Algorithms 32 (2015)
Golnaz Badkobeh, Maxime Crochemore
Infinite binary words containing repetitions of odd period. Inf. Process. Lett. 115 (5) (2015)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34 (2015)
Maxime Crochemore, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Fatima Vayani
Linear Algorithm for Conservative Degenerate Pattern Matching. CoRR (2015)
Golnaz Badkobeh, Maxime Crochemore, Michaël Rao
Finite repetition threshold for large alphabets. RAIRO Theor. Informatics Appl. 48 (4) (2014)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Covering Problems for Partial Words and for Indeterminate Strings. CoRR (2014)
Maxime Crochemore, James D. Currie, Gregory Kucherov, Dirk Nowotka
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). Dagstuhl Reports 4 (3) (2014)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521 (2014)
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Abelian borders in binary words. Discret. Appl. Math. 171 (2014)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Covering Problems for Partial Words and for Indeterminate Strings. ISAAC (2014)
Maxime Crochemore, Alessio Langiu, Filippo Mignosi
Note on the greedy parsing optimality for dictionary-based text compression. Theor. Comput. Sci. 525 (2014)
Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták
StringMasters 2012 & 2013 special issue - volume 1. J. Discrete Algorithms 28 (2014)
Maxime Crochemore, Robert Mercas
Fewer runs than word length. CoRR (2014)
Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan
Maximal anti-exponent of gapped palindromes. DICTAP (2014)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Krzysztof Stencel, Tomasz Walen
New simple efficient algorithms computing powers and runs in strings. Discret. Appl. Math. 163 (2014)
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
On the average number of regularities in a word. Theor. Comput. Sci. 525 (2014)
Alberto Apostolico, Maxime Crochemore, Martin Farach-Colton, Zvi Galil, S. Muthukrishnan
Forty Years of Text Indexing. CPM (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-Preserving Suffix Trees and Their Algorithmic Applications CoRR (2013)
Maxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
Computing the Longest Previous Factor. Eur. J. Comb. 34 (1) (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113 (3) (2013)
Manolis Christodoulakis, Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Overlapping factors in words. Australas. J Comb. 57 (2013)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
Efficient seed computation revisited. Theor. Comput. Sci. 483 (2013)
Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park
Suffix Tree of Alignment: An Efficient Index for Similar Data. IWOCA (2013)
Maxime Crochemore, Jacqueline W. Daykin
StringMasters 2011 Special Issue. J. Discrete Algorithms 20 (2013)
Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen
A Note on the Longest Common Compatible Prefix Problem for Partial Words. CoRR (2013)
Mika Amit, Maxime Crochemore, Gad M. Landau
Locating All Maximal Approximate Runs in a String. CPM (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE (2013)
Joong Chae Na, Heejin Park, Maxime Crochemore, Jan Holub, Costas S. Iliopoulos, Laurent Mouchard, Kunsoo Park
Suffix Tree of Alignment: An Efficient Index for Similar Data CoRR (2013)
Maxime Crochemore, Alessio Langiu, Filippo Mignosi
The Rightmost Equal-Cost Position Problem. DCC (2013)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
The Maximum Number of Squares in a Tree. CPM (2012)
Golnaz Badkobeh, Maxime Crochemore
Fewest repetitions in infinite binary words CoRR (2012)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen
Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11 (2012)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Quasiperiodicities in Fibonacci strings CoRR (2012)
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen
A Note on Efficient Computation of All Abelian Periods in a String CoRR (2012)
Anisa Al-Hafeedh, Maxime Crochemore, Lucian Ilie, Evguenia Kopylova, William F. Smyth, German Tischler, Munina Yusufu
A comparison of index-based lempel-Ziv LZ77 factorization algorithms. ACM Comput. Surv. 45 (1) (2012)
Golnaz Badkobeh, Maxime Crochemore, Chalita Toopsuwan
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time. SPIRE (2012)
Maxime Crochemore, Alessio Langiu, Filippo Mignosi
Note on the Greedy Parsing Optimality for Dictionary-Based Text Compression CoRR (2012)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
The maximal number of cubic runs in a word. J. Comput. Syst. Sci. 78 (6) (2012)
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, German Tischler, Tomasz Walen
Improved algorithms for the range next value problem and applications. Theor. Comput. Sci. 434 (2012)
Golnaz Badkobeh, Maxime Crochemore
Fewest repetitions in infinite binary words. RAIRO Theor. Informatics Appl. 46 (1) (2012)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Identifying all abelian periods of a string in quadratic time and relevant problems CoRR (2012)
Ali Alatabbi, Maxime Crochemore, Costas S. Iliopoulos, Tewogboye A. Okanlawon
Overlapping repetitions in weighted sequence. CUBE (2012)
Maxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo
Dictionary-symbolwise flexible parsing. J. Discrete Algorithms 14 (2012)
Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos
Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems. Int. J. Found. Comput. Sci. 23 (6) (2012)
Supaporn Chairungsee, Maxime Crochemore
Using minimal absent words to build phylogeny. Theor. Comput. Sci. 450 (2012)

Maxime Crochemore.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Maxime Crochemore