Maxime Crochemore

According to our database1, Maxime Crochemore authored at least 225 papers between 1980 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Quasi-Linear-Time Algorithm for Longest Common Circular Factor.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Trie.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Suffix Tree.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos).
Theor. Comput. Sci., 2018

Alignment-free sequence comparison using absent words.
Inf. Comput., 2018

Preface.
Fundam. Inform., 2018

Fast phylogenetic inference from typing data.
Algorithms for Molecular Biology, 2018

On Extended Special Factors of a Word.
Proceedings of the String Processing and Information Retrieval, 2018

How Much Different Are Two Words with Different Shortest Periods.
Proceedings of the Artificial Intelligence Applications and Innovations, 2018

Linear-Time Algorithm for Long LCF with k Mismatches.
Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017
Counting maximal-exponent factors in words.
Theor. Comput. Sci., 2017

Locating maximal approximate runs in a string.
Theor. Comput. Sci., 2017

The longest common substring problem.
Mathematical Structures in Computer Science, 2017

Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time.
Proceedings of the 17th International Workshop on Algorithms in Bioinformatics, 2017

Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes.
Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

Longest Previous Non-overlapping Factors Table Computation.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
Squares and Repetitions.
Encyclopedia of Algorithms, 2016

String Matching.
Encyclopedia of Algorithms, 2016

Multiple String Matching.
Encyclopedia of Algorithms, 2016

On the density of Lyndon roots in factors.
Theor. Comput. Sci., 2016

Order-preserving indexing.
Theor. Comput. Sci., 2016

Linear-size suffix tries.
Theor. Comput. Sci., 2016

Efficient computation of maximal anti-exponent in palindrome-free strings.
Theor. Comput. Sci., 2016

Computing maximal-exponent factors in an overlap-free word.
J. Comput. Syst. Sci., 2016

Linear algorithm for conservative degenerate pattern matching.
Eng. Appl. of AI, 2016

40 years of suffix trees.
Commun. ACM, 2016

Quasiperiodicities in Fibonacci strings.
Ars Comb., 2016

Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
Proceedings of the String Processing and Information Retrieval, 2016

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Optimal Bounds for Computing \alpha α -gapped Repeats.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
A note on the longest common compatible prefix problem for partial words.
J. Discrete Algorithms, 2015

Computing the Burrows-Wheeler transform in place and in small space.
J. Discrete Algorithms, 2015

StringMasters 2012 & 2013 special issue - volume 2.
J. Discrete Algorithms, 2015

Infinite binary words containing repetitions of odd period.
Inf. Process. Lett., 2015

2014
Note on the greedy parsing optimality for dictionary-based text compression.
Theor. Comput. Sci., 2014

Extracting powers and periods in a word from its runs structure.
Theor. Comput. Sci., 2014

On the average number of regularities in a word.
Theor. Comput. Sci., 2014

StringMasters 2012 & 2013 special issue - volume 1.
J. Discrete Algorithms, 2014

Finite repetition threshold for large alphabets.
RAIRO - Theor. Inf. and Applic., 2014

Abelian borders in binary words.
Discrete Applied Mathematics, 2014

Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).
Dagstuhl Reports, 2014

Covering Problems for Partial Words and for Indeterminate Strings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Maximal anti-exponent of gapped palindromes.
Proceedings of the Fourth International Conference on Digital Information and Communication Technology and its Applicationsm DICTAP 2014, 2014

Pattern Matching and Text Compression Algorithms.
Proceedings of the Computing Handbook, 2014

2013
Efficient seed computation revisited.
Theor. Comput. Sci., 2013

StringMasters 2011 Special Issue.
J. Discrete Algorithms, 2013

A note on efficient computation of all Abelian periods in a string.
Inf. Process. Lett., 2013

Computing the Longest Previous Factor.
Eur. J. Comb., 2013

Overlapping factors in words.
Australasian J. Combinatorics, 2013

Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes.
Proceedings of the String Processing and Information Retrieval, 2013

Suffix Tree of Alignment: An Efficient Index for Similar Data.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

The Rightmost Equal-Cost Position Problem.
Proceedings of the 2013 Data Compression Conference, 2013

A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Forty Years of Text Indexing.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

Locating All Maximal Approximate Runs in a String.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
Improved algorithms for the range next value problem and applications.
Theor. Comput. Sci., 2012

Using minimal absent words to build phylogeny.
Theor. Comput. Sci., 2012

On the maximal sum of exponents of runs in a string.
J. Discrete Algorithms, 2012

Efficient algorithms for three variants of the LPF table.
J. Discrete Algorithms, 2012

On left and right seeds of a string.
J. Discrete Algorithms, 2012

The maximal number of cubic runs in a word.
J. Comput. Syst. Sci., 2012

Fewest repetitions in infinite binary words.
RAIRO - Theor. Inf. and Applic., 2012

Computing all subtree repeats in ordered trees.
Inf. Process. Lett., 2012

On-Line Construction of a Small Automaton for a Finite Set of Words.
Int. J. Found. Comput. Sci., 2012

Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems.
Int. J. Found. Comput. Sci., 2012

A comparison of index-based lempel-Ziv LZ77 factorization algorithms.
ACM Comput. Surv., 2012

Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time.
Proceedings of the String Processing and Information Retrieval, 2012

Overlapping repetitions in weighted sequence.
Proceedings of the CUBE International IT Conference & Exhibition, 2012

Lyndon fountains and the Burrows-Wheeler transform.
Proceedings of the CUBE International IT Conference & Exhibition, 2012

The Maximum Number of Squares in a Tree.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011
Periodic-Finite-Type Shift Spaces.
IEEE Trans. Information Theory, 2011

The "runs" conjecture.
Theor. Comput. Sci., 2011

Computing Longest Previous non-overlapping Factors.
Inf. Process. Lett., 2011

Reactive automata.
Inf. Comput., 2011

Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081).
Dagstuhl Reports, 2011

Finite-Repetition threshold for infinite ternary words
Proceedings of the Proceedings 8th International Conference Words 2011, 2011

Building Phylogeny with Minimal Absent Words.
Proceedings of the Implementation and Application of Automata, 2011

Computing All Subtree Repeats in Ordered Ranked Trees.
Proceedings of the String Processing and Information Retrieval, 2011

Hunting Redundancies in Strings.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Efficient Seeds Computation Revisited.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

On the Right-Seed Array of a String.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
Number of Occurrences of powers in Strings.
Int. J. Found. Comput. Sci., 2010

Fast computation of a longest increasing subsequence and application.
Inf. Comput., 2010

Finding Patterns In Given Intervals.
Fundam. Inform., 2010

New Simple Efficient Algorithms Computing Powers and Runs in Strings.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Reactive Links to Save Automata States.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Bounded Number of Squares in Infinite Repetition-Constrained Binary Words.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching.
Proceedings of the String Processing and Information Retrieval, 2010

Extracting Powers and Periods in a String from Its Runs Structure.
Proceedings of the String Processing and Information Retrieval, 2010

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

On the Maximal Number of Cubic Runs in a String.
Proceedings of the Language and Automata Theory and Applications, 2010

On the Maximal Sum of Exponents of Runsin a String.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Dictionary-Symbolwise Flexible Parsing.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Cover Array String Reconstruction.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Algorithms for Three Versions of the Shortest Common Superstring Problem.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches.
Proceedings of the Algorithms and Applications, 2010

2009
Trie.
Proceedings of the Encyclopedia of Database Systems, 2009

Suffix Tree.
Proceedings of the Encyclopedia of Database Systems, 2009

Repetitions in strings: Algorithms and combinatorics.
Theor. Comput. Sci., 2009

From Nerode's congruence to suffix automata with mismatches.
Theor. Comput. Sci., 2009

On-line Construction of a Small Automaton for a Finite Set of Words.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Reverse Engineering Prefix Tables.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

LPF Computation Revisited.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Alignments and Approximate String Matching.
Proceedings of the New Developments in Formal Languages and Applications, 2008

Squares and Repetitions.
Proceedings of the Encyclopedia of Algorithms, 2008

Sequential Multiple String Matching.
Proceedings of the Encyclopedia of Algorithms, 2008

Sequential Exact String Matching.
Proceedings of the Encyclopedia of Algorithms, 2008

Approximating the 2-interval pattern problem.
Theor. Comput. Sci., 2008

Foreword.
Mathematics in Computer Science, 2008

Maximal repetitions in strings.
J. Comput. Syst. Sci., 2008

Optimal prefix and suffix queries on texts.
Inf. Process. Lett., 2008

Computing Longest Previous Factor in linear time and applications.
Inf. Process. Lett., 2008

External Memory Algorithms for String Problems.
Fundam. Inform., 2008

Conservative String Covering of Indeterminate Strings.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Improved Algorithms for the Range Next Value Problem and Applications.
Proceedings of the STACS 2008, 2008

Understanding Maximal Repetitions in Strings.
Proceedings of the STACS 2008, 2008

On the Longest Common Factor Problem.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Bounds on Powers in Strings.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

A Simple Algorithm for Computing the Lempel Ziv Factorization.
Proceedings of the 2008 Data Compression Conference (DCC 2008), 2008

Towards a Solution to the "Runs" Conjecture.
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008

Computing a Longest Increasing Subsequence of Length k in Time O(n log log k).
Proceedings of the Visions of Computer Science, 2008

2007
All maximal-pairs in step-leap representation of melodic sequence.
Inf. Sci., 2007

The Structure of Factor Oracles.
Int. J. Found. Comput. Sci., 2007

On the Suffix Automaton with Mismatches.
Proceedings of the Implementation and Application of Automata, 2007

Finding Patterns in Given Intervals.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Analysis of Maximal Repetitions in Strings.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Application of suffix trees for the acquisition of common motifs with gaps in a set of strings.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Minimizing local automata.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Algorithms on strings.
Cambridge University Press, ISBN: 978-0-521-84899-2, 2007

2006
Text Searching and Indexing.
Proceedings of the Recent Advances in Formal Languages and Applications, 2006

Longest repeats with a block of k don't cares.
Theor. Comput. Sci., 2006

Factor Oracles.
Proceedings of the Implementation and Application of Automata, 2006

2005
Presentations of constrained systems with unconstrained positions.
IEEE Trans. Information Theory, 2005

A note on the Burrows - CWheeler transformation.
Theor. Comput. Sci., 2005

Bases of Motifs for Generating Repeated Patterns with Wild Cards.
IEEE/ACM Trans. Comput. Biology Bioinform., 2005

Bit-parallel (delta, gamma)-matching and suffix automata.
J. Discrete Algorithms, 2005

Foreword.
J. Discrete Algorithms, 2005

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories.
Proceedings of the ISMIR 2005, 2005

Approximating the 2-Interval Pattern Problem.
Proceedings of the Algorithms, 2005

2004
Longest Motifs with a Functionally Equivalent Central Block.
Proceedings of the String Processing and Information Retrieval, 2004

Longest Repeats with a Block of Don't Cares.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

A Trie-Based Approach for Compacting Automata.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
Reducing space for index implementation.
Theor. Comput. Sci., 2003

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices.
SIAM J. Comput., 2003

Directed acyclic subsequence graph - Overview.
J. Discrete Algorithms, 2003

A unifying look at the Apostolico-Giancarlo string-matching algorithm.
J. Discrete Algorithms, 2003

Waiting time and complexity for matching patterns with automata.
Inf. Process. Lett., 2003

Occurrence and Substring Heuristics for i-Matching.
Fundam. Inform., 2003

Computing forbidden words of regular languages.
Fundam. Inform., 2003

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval.
Proceedings of the String Processing and Information Retrieval, 2003

A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Two-Dimensional Pattern Matching with Rotations.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
Approximate String Matching with Gaps.
Nord. J. Comput., 2002

Algorithms for Computing Approximate Repetitions in Musical Sequences.
Int. J. Comput. Math., 2002

On the Implementation of Compact DAWG's.
Proceedings of the Implementation and Application of Automata, 2002

On the Size of DASG for Multiple Texts.
Proceedings of the String Processing and Information Retrieval, 2002

A sub-quadratic sequence alignment algorithm for unrestricted cost matrices.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Improved Antidictionary Based Compression.
Proceedings of the 22nd International Conference of the Chilean Computer Science Society (SCCC 2002), 2002

Three Heuristics for delta-Matching: delta-BM Algorithms.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Jewels of stringology.
World Scientific, ISBN: 978-981-02-4782-9, 2002

2001
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem.
Inf. Process. Lett., 2001

Computing Evolutionary Chains in Musical Sequences.
Electr. J. Comb., 2001

Approximate String Matching in Musical Sequences.
Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms.
Proceedings of the Eighth International Symposium on String Processing and Information Retrieval, 2001

Efficient Experimental String Matching by Weak Factor Recognition.
Proceedings of the Combinatorial Pattern Matching, 12th Annual Symposium, 2001

2000
Fast Evolutionary Chains.
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Finding Motifs with Gaps.
Proceedings of the ISMIR 2000, 2000

1999
Fast Practical Multi-Pattern Matching.
Inf. Process. Lett., 1999

Zones of Low Entropy in Genomic Sequences.
Computers & Chemistry, 1999

Factor Oracle: A New Structure for Pattern Matching.
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Text Compression Using Antidictionaries.
Proceedings of the Automata, 1999

1998
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching.
SIAM J. Comput., 1998

Automata and Forbidden Words.
Inf. Process. Lett., 1998

Two-Dimensional Prefix String Matching and Covering on Square Matrices.
Algorithmica, 1998

Minimal Forbidden Words and Factor Automata.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
Automata for Matching Patterns.
Proceedings of the Handbook of Formal Languages, 1997

Constant-Time Randomized Parallel String Matching.
SIAM J. Comput., 1997

Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm.
Inf. Process. Lett., 1997

Constant-space string-matching in sublinear average time.
Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

Direct Construction of Compact Directed Acyclic Word Graphs.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

On Compact Directed Acyclic Word Graphs.
Proceedings of the Structures in Logic and Computer Science, 1997

Off-line serial exact string searching.
Proceedings of the Pattern Matching Algorithms, 1997

Pattern Matching and Text Compression Algorithms.
Proceedings of the Computer Science and Engineering Handbook, 1997

1996
Pattern-Matching and Text-Compression Algorithms.
ACM Comput. Surv., 1996

Boyer-Moore Strategy to Efficient Approximate String Matching.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995
Fast Parallel Lyndon Factorization with Applications.
Mathematical Systems Theory, 1995

Sqares, Cubes, and Time-Space Efficient String Searching.
Algorithmica, 1995

Two-Dimensional Pattern Matching in Linear Time and Small Space.
STACS, 1995

On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994
On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.
Theor. Comput. Sci., 1994

Speeding Up Two String-Matching Algorithms.
Algorithmica, 1994

Text Algorithms
Oxford University Press, ISBN: 0-19-508609-0, 1994

1993
Two-Dimensional Pattern Matching by Sampling.
Inf. Process. Lett., 1993

Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
A String-Matching Interpretation of the Equation xmyn = zp.
Theor. Comput. Sci., 1992

String-Matching on Ordered Alphabets.
Theor. Comput. Sci., 1992

Speeding Up Two String-Matching Algorithms.
Proceedings of the STACS 92, 1992

Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms.
Proceedings of the Parallel Image Analysis, Second International Conference, 1992

1991
Optimal Canonization of All Substrings of a String
Inf. Comput., November, 1991

Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays.
Theor. Comput. Sci., 1991

On the Parallel Recognition of Unambiguous Context-Free Languages.
Theor. Comput. Sci., 1991

Two-Way String Matching.
J. ACM, 1991

Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings.
Inf. Process. Lett., 1991

Mutually Avoiding Ternary Words of Small Exponent.
IJAC, 1991

1990
Parallel Computations on Strings and Arrays.
Proceedings of the STACS 90, 1990

Parallel Construction of Minimal Suffix and Factor Automata.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Unitary Monoid with Two Generators: An Algorithmic Point of View.
Proceedings of the CAAP '90, 1990

1989
String-matching and periods.
Bulletin of the EATCS, 1989

Thue-Morse sequence and p-adic topology for the free monoid.
Discrete Mathematics, 1989

1988
Critical factorizations of words.
Bulletin of the EATCS, 1988

String Matching with Constraints.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Algorithms and automata.
Proceedings of the Formal Properties of Finite Automata and Applications, 1988

Constant-Space String-Matching.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1987
Longest Common Factor of Two Words.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Data Compression with Substitution.
Proceedings of the Electronic Dictionaries and Automata in Computational Linguistics, 1987

1986
Transducers and Repetitions.
Theor. Comput. Sci., 1986

Calcul de La Distance Par Les Sous-Mots.
ITA, 1986

Computing LCF in linear time.
Bulletin of the EATCS, 1986

1984
Linear Searching for a Squre in a Word (Abstract).
Proceedings of the Automata, 1984

1983
An Optimal Test on Finite Unavoidable Sets of Words.
Inf. Process. Lett., 1983

1982
Sharp Characterizations of Squarefree Morphisms.
Theor. Comput. Sci., 1982

Partitioning a Graph in O(|A| log2 |V|).
Theor. Comput. Sci., 1982

1981
An Optimal Algorithm for Computing the Repetitions in a Word.
Inf. Process. Lett., 1981

1980
Détermination de la Représentation Standard d'une Série Reconnaissable.
ITA, 1980


  Loading...