Maxime Crochemore

Maxime Crochemore's AcademicInfluence.com Rankings

Maxime Crochemore

Computer Science

#2171

World Rank

#2259

Historical Rank

Algorithms

#73

World Rank

#73

Historical Rank

Database

#3998

World Rank

#4157

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Maxime Crochemore Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Maxime Crochemore is a French computer scientist known for his numerous contributions to algorithms on strings. He is currently a professor at King's College London. Biography Crochemore earned his doctorate in 1978 and his Doctorat d'état in 1983 from the University of Rouen. He was a professor at Paris 13 University in 1985–1989, and moved to a professorship at Paris Diderot University in 1989. In 2002–2007, Crochemore was a senior research fellow at King's College London, where he is a professor since 2007. Since 2007, he is also a professor emeritus at the University of Marne-la-Vallée.

(See a Problem?)

Maxime Crochemore's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Algorithms on strings (2007) (903)
Text Algorithms (1994) (749)
On-line construction of suffix trees (2002) (351)
An Optimal Algorithm for Computing the Repetitions in a Word (1981) (350)
Extracting Powers and Periods in a String from Its Runs Structure (2010) (345)
Jewels of stringology (2002) (310)
On the Maximal Number of Cubic Runs in a String (2010) (271)
Transducers and Repetitions (1986) (234)
Factor Oracle: A New Structure for Pattern Matching (1999) (217)
Speeding up two string-matching algorithms (1992) (177)
Two-way string-matching (1991) (164)
A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices (2003) (141)
Automata and Forbidden Words (1998) (137)
Algorithms and Theory of Computation Handbook (2010) (136)
Automata for Matching Patterns (1997) (127)
Jewels of stringology : text algorithms (2002) (124)
Symposium on Theoretical Aspects of Computer Science (2008) (120)
Computing Longest Previous Factor in linear time and applications (2008) (119)
Algorithms on Strings: Tools (2007) (118)
Squares, cubes, and time-space efficient string searching (1995) (117)
Mathematical Foundations Of Computer Science 2003 (2003) (117)
Algorithms For Computing Approximate Repetitions In Musical Sequences (2002) (108)
A fast and practical bit-vector algorithm for the Longest Common Subsequence problem (2001) (100)
Direct Construction of Compact Directed Acyclic Word Graphs (1997) (96)
Data compression using antidictionaries (2000) (91)
A Simple Algorithm for Computing the Lempel Ziv Factorization (2008) (84)
Sharp Characterizations of Squarefree Morphisms (1982) (83)
Finding Patterns In Given Intervals (2007) (83)
Partitioning a Graph in O(|A| log2 |V|) (1982) (81)
Fast Practical Multi-Pattern Matching (1999) (79)
Bases of motifs for generating repeated patterns with wild cards (2005) (79)
Maximal repetitions in strings (2008) (76)
Pattern-matching and text-compression algorithms (1996) (73)
Temporal Structure (2009) (71)
A sub-quadratic sequence alignment algorithm for unrestricted cost matrices (2002) (66)
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions (1993) (62)
The Computer Science and Engineering Handbook (2004) (57)
Approximate String Matching with Gaps (2002) (56)
Repetitions in strings: Algorithms and combinatorics (2009) (56)
Towards a Solution to the "Runs" Conjecture (2008) (54)
Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays (1991) (53)
Efficient Experimental String Matching by Weak Factor Recognition (2001) (52)
Using minimal absent words to build phylogeny (2012) (52)
Extracting powers and periods in a word from its runs structure (2014) (52)
On Compact Directed Acyclic Word Graphs (1997) (46)
String-Matching on Ordered Alphabets (1992) (45)
A note on the Burrows-Wheeler transformation (2005) (44)
The "runs" conjecture (2011) (43)
Efficient Parallel Algorithms to Test Square-Freeness and Factorize Strings (1991) (43)
Two-dimensional pattern matching with rotations (2003) (43)
Fast computation of a longest increasing subsequence and application (2010) (42)
Optimal Canonization of All Substrings of a String (1991) (42)
Approximating the 2-interval pattern problem (2005) (41)
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes (2013) (41)
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum (2003) (41)
Improved algorithms for the range next value problem and applications (2012) (40)
Reverse Engineering Prefix Tables (2009) (39)
LPF Computation Revisited (2009) (36)
Cover Array String Reconstruction (2010) (36)
Motifs in Sequences: Localization and Extraction (2004) (36)
Fast parallel Lyndon factorization with applications (1995) (35)
Computing forbidden words of regular languages (2003) (35)
40 years of suffix trees (2016) (31)
A comparison of index-based lempel-Ziv LZ77 factorization algorithms (2012) (31)
Suffix Tree of Alignment: An Efficient Index for Similar Data (2013) (30)
Computing Longest Previous non-overlapping Factors (2011) (30)
Zones of Low Entropy in Genomic Sequences (1999) (29)
A note on the Burrows - CWheeler transformation (2005) (29)
Directed acyclic subsequence graph - Overview (2003) (28)
Approximate String Matching in Musical Sequences (2001) (28)
String Matching with Constraints (1988) (27)
A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories (2005) (27)
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (2009) (26)
Order-preserving indexing (2016) (26)
Occurrence and Substring Heuristics for i-Matching (2002) (25)
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications (2015) (24)
Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time (2012) (24)
Analysis of Maximal Repetitions in Strings (2007) (24)
Two-Dimensional Prefix String Matching and Covering on Square Matrices (1998) (24)
Computing the Longest Previous Factor (2013) (24)
Improved antidictionary based compression (2002) (23)
Efficient algorithms for three variants of the LPF table (2012) (23)
Pattern Matching in Strings (2010) (23)
Optimal Factor Transducers (1985) (22)
Reactive automata (2011) (22)
The maximal number of cubic runs in a word (2012) (22)
External Memory Algorithms for String Problems (2008) (22)
On the maximal sum of exponents of runs in a string (2010) (21)
Conservative String Covering of Indeterminate Strings (2008) (21)
Alignment-free sequence comparison using absent words (2018) (20)
A note on efficient computation of all Abelian periods in a string (2012) (20)
26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009) (2009) (20)
Note on the greedy parsing optimality for dictionary-based text compression (2012) (19)
Reducing space for index implementation (2003) (19)
Longest repeats with a block of k don't cares (2006) (19)
Two-Dimensional Pattern Matching in Linear Time and Small Space (1995) (19)
Bit-parallel (delta, gamma)-matching and suffix automata (2005) (19)
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform (2013) (18)
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries (2016) (18)
Covering Problems for Partial Words and for Indeterminate Strings (2014) (17)
Computing the Burrows-Wheeler transform in place and in small space (2015) (17)
Median of an odd number of permutations (2011) (17)
Efficient Seeds Computation Revisited (2011) (17)
Longest Common Factor of Two Words (1987) (17)
String pattern matching for a deluge survival kit (2002) (17)
Minimizing incomplete automata (2008) (16)
Optimal bounds for computing α-gapped repeats (2019) (16)
On the Parallel Recognition of Unambiguous Context-Free Languages (1991) (16)
Linear-Time Algorithm for Long LCF with k Mismatches (2018) (16)
Efficient seed computation revisited (2013) (16)
Speeding-up hirschberg and hunt-szymanski LCS algorithms (2001) (16)
EEE International Symposium on Information Theory (2007) (15)
Constant-Time Randomized Parallel String Matching (1997) (15)
A bit-parallel suffix automaton approach for (δ, γ)-matching in music retrieval (2003) (15)
Algorithms for computing evolutionary chains in molecular and musical sequences (1998) (15)
Finding Motifs with Gaps (2000) (15)
Minimal Forbidden Words and Factor Automata (1998) (15)
The Maximum Number of Squares in a Tree (2012) (15)
Boyer-Moore Strategy to Efficient Approximate String Matching (1996) (15)
Periodic Prefixes in Texts (1993) (15)
Encyclopedia of Database Systems (2009) (15)
Fast phylogenetic inference from typing data (2018) (15)
Absent words in a sliding window with applications (2020) (14)
6th international conference on music information retrieval (2005) (14)
Three Heuristics for delta-Matching: delta-BM Algorithms (2002) (14)
Absent words and the (dis)similarity analysis of DNA sequences: an experimental study (2016) (14)
Re-Use Dynamic Programming for Sequence Alignment: An Algorithmic Toolkit (2005) (14)
A Trie-Based Approach for Compacting Automata (2004) (14)
The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching (2010) (14)
Linear algorithm for conservative degenerate pattern matching (2015) (13)
Minimizing local automata (2007) (13)
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching (1998) (13)
Fewest repetitions in infinite binary words (2012) (13)
On the implementation of compact DAWG's (2002) (13)
A Comparative Study of Bases for Motif Inference in String Algorithmics (2004) (13)
Parallel Computations on Strings and Arrays (1990) (12)
Algorithms for Three Versions of the Shortest Common Superstring Problem (2010) (12)
Abelian borders in binary words (2014) (12)
Efficient Computing of Longest Previous Reverse Factors (2009) (12)
Thue-Morse sequence and p-adic topology for the free monoid (1989) (12)
Presentations of constrained systems with unconstrained positions (2005) (12)
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm (1997) (12)
On left and right seeds of a string (2012) (11)
Cartesian and Lyndon trees (2020) (11)
Constant-space string-matching in sublinear average time (1997) (11)
Finite-Repetition threshold for infinite ternary words (2011) (11)
On Extended Special Factors of a Word (2018) (11)
Mutually Avoiding Ternary Words of Small Exponent (1991) (11)
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching (2017) (11)
Waiting time and complexity for matching patterns with automata (2003) (10)
A Basis for Repeated Motifs in Pattern Discovery and Text Mining (2002) (10)
Off-line serial exact string searching (1997) (10)
Dictionary-symbolwise flexible parsing (2010) (10)
The Rightmost Equal-Cost Position Problem (2012) (10)
Automata-theoretic approach (2002) (9)
Quasiperiodicities in Fibonacci strings (2012) (9)
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches (2010) (9)
Periodic-Finite-Type Shift Spaces (2001) (9)
String-matching and periods (1989) (9)
Computing all subtree repeats in ordered trees (2012) (8)
Linear-size suffix tries (2016) (8)
Identifying All Abelian Periods of a String in quadratic Time and Relevant Problems (2012) (8)
An Optimal Test on Finite Unavoidable Sets of Words (1983) (8)
Two-Dimensional Pattern Matching by Sampling (1993) (8)
Computing Evolutionary Chains in Musical Sequences (2000) (8)
Three heuristics for δ-matching: δ-BM algorithms (2002) (8)
The Structure of Factor Oracles (2007) (8)
Parallel Construction of Minimal Suffix and Factor Automata (1990) (8)
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (2002) (8)
Quasi-Linear-Time Algorithm for Longest Common Circular Factor (2019) (7)
All maximal-pairs in step-leap representation of melodic sequence (2007) (7)
New simple efficient algorithms computing powers and runs in strings (2014) (7)
A fast implementation of the Boyer-Moore string matching algorithm (2007) (7)
Optimal searching of gapped repeats in a word (2015) (7)
Computing All Subtree Repeats in Ordered Ranked Trees (2011) (7)
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings (2007) (7)
On the Size of DASG for Multiple Texts (2002) (7)
Order-Preserving Suffix Trees and Their Algorithmic Applications (2013) (7)
On the average number of regularities in a word (2014) (7)
Longest Repeats with a Block of Don't Cares (2004) (7)
Suffix Tree (2009) (6)
On the Right-Seed Array of a String (2011) (6)
125 Problems in Text Algorithms (2021) (6)
Algorithmic Aspects of ARC‐Annotated Sequences (2010) (6)
Text Data Compression Algorithms (2010) (6)
5th IFIP International Conference on Theoretical Computer Science (2008) (6)
Locating All Maximal Approximate Runs in a String (2013) (6)
A unifying look at the Apostolico-Giancarlo string-matching algorithm (2003) (6)
Hunting Redundancies in Strings (2011) (6)
Forty Years of Text Indexing (2013) (6)
On the density of Lyndon roots in factors (2016) (6)
Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms (1992) (6)
Constant-Space String-Matching (1988) (5)
Transactional Business Processes (2005) (5)
Compression for an effective management of telemetry data (1993) (5)
Optimal Bounds for Computing \alpha α -gapped Repeats (2019) (5)
A note on the longest common compatible prefix problem for partial words (2013) (5)
The longest common substring problem (2015) (5)
Unitary Monoid with Two Generators: An Algorithmic Point of View (1990) (5)
Bounds on Powers in Strings (2008) (4)
Computing a Longest Increasing Subsequence of Length k in Time O(n log log k) (2008) (4)
Service Bus (2009) (4)
Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time (2017) (4)
Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (2008) (4)
Optimal prefix and suffix queries on texts (2008) (4)
Prague Stringology Conference 2008 (2008) (4)
Text Retrieval (2009) (4)
Fewer runs than word length (2014) (4)
Finite repetition threshold for large alphabets (2014) (4)
Proceedings of the 14th annual conference on Combinatorial pattern matching (2003) (4)
Factor Oracles (2006) (4)
Time-Constrained Transaction Management (2009) (4)
Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching (1992) (4)
Shortest Covers of All Cyclic Shifts of a String (2020) (4)
Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings (2005) (4)
Computing maximal-exponent factors in an overlap-free word (2016) (4)
Finding the median of three permutations under the Kendall-tau distance (2009) (4)
On-Line Construction of a Small Automaton for a Finite Set of Words (2012) (3)
On the Suffix Automaton with Mismatches (2007) (3)
String Processing and Information Retrieval, SPIRE'2002 (2002) (3)
Longest Previous Non-overlapping Factors Table Computation (2017) (3)
Translingual Information Retrieval (2009) (3)
Computing LCF in linear time (1986) (3)
Number of Occurrences of powers in Strings (2010) (3)
Handbook of Massive Data Sets (2002) (3)
A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval (2003) (3)
Bit-parallel (γ,δ)-matching and suffix automata (2005) (3)
Checking whether a word is Hamming-isometric in linear time (2021) (3)
Multiple String Matching (2016) (3)
Linear Searching for a Squre in a Word (Abstract) (1984) (3)
On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms (1994) (3)
Proceedings of the International Conference on Analysis of Algorithms (2007) (3)
Recent Advances in Formal Languages and Applications (2006) (3)
Alignment-free sequence comparison using absent words (cid:73) (2018) (3)
Topological Data Structure (2009) (2)
Symposium on String Processing and Information Retrieval (SPIRE01) (2001) (2)
Overlapping repetitions in weighted sequence (2012) (2)
From Nerode's congruence to suffix automata with mismatches (2009) (2)
Internal Quasiperiod Queries (2020) (2)
Finding the median of three permutations under the Kendall-τ distance-Extended Abstract (2013) (2)
Combinatorial Pattern Matching: 5th Annual Symposium, Cpm 94 Asilomar, Ca, Usa, June 5-8, 1994 : Proceedings (1994) (2)
Two-dimensional dictionary prefix-matching (1998) (2)
Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (1993) (2)
Finite-State Methods and Natural Language Processing (2008) (2)
Sequential Multiple String Matching (2008) (2)
Combinatorial pattern matching : 14th annual symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003 : proceedings (2003) (2)
Text Searching and Indexing (2006) (2)
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings (2016) (2)
Maximal anti-exponent of gapped palindromes (2014) (2)
Structures for indexes (2005) (2)
Approximate pattern matching (2002) (2)
String Matching (2016) (1)
Back-To-Front Online Lyndon Forest Construction (2022) (1)
Combinatorial pattern matching : 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings (1999) (1)
Building Phylogeny with Minimal Absent Words (2011) (1)
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching (1995) (1)
Temporal Association Mining (2009) (1)
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111) (2014) (1)
Locating maximal approximate runs in a string (2017) (1)
Statistical Decision Techniques (2009) (1)
17th International Workshop on Algorithms in Bioinformatics, WABI 2017, August 21-23, 2017, Boston, MA, USA (2017) (1)
Prague Stringology Conference (2010) (1)
Cartesian trees and Lyndon trees (2017) (1)
Indexing and Matching Strings (2005) (1)
Infinite binary words containing repetitions of odd period (2015) (1)
Combinatorial Pattern Matching: 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993. Proceedings (1993) (1)
Bounded Number of Squares in Infinite Repetition-Constrained Binary Words (2010) (1)
Indexing a sequence for mapping reads with a single mismatch (2014) (1)
Fast Evolutionary Chains (2000) (1)
A failure function for multiple two-dimensional pattern matching (2000) (1)
Left Lyndon tree construction (2020) (1)
Proceedings of the Seventeenth Australasian Workshop on Combinatorial Algorithms (2006) (1)
Implementation and Application of Automata, 12th International Conference (2007) (1)
On the Longest Common Factor Problem (2008) (1)
Data Compression with Substitution (1987) (1)
Secret-Key Encryption (2009) (1)
Linear-Time Computation of Shortest Covers of All Rotations of a String (2022) (1)
Overlapping factors in words (2013) (1)
Efficient enumeration of non-equivalent squares in partial words with few holes (2018) (1)
How Much Different Are Two Words with Different Shortest Periods (2018) (1)
Seventh International Conference on Computer Science and Information Technologies (CSIT 2009) (2009) (1)
Two-Sorted First-Order Logic (2009) (1)
Term Processing (2009) (0)
Translation Lookaside Buffer (TLB) (2009) (0)
Efficient enumeration of non-equivalent squares in partial words with few holes (2017) (0)
Time-Based Access Control (2009) (0)
More on suffix trees (2002) (0)
J 9 2-D Monotone Spatial Indexing Scheme with Optimal Update Time (2005) (0)
Algorithms on Strings: Pattern matching automata (2007) (0)
Longest Motifs with a Functionally Equivalent Central Block (2004) (0)
Symmetries and repetitions in texts (2002) (0)
Preface (1969) (0)
Statistical Disclosure Control (SDC) (2009) (0)
Informatics and the genome (1999) (0)
Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos) (2018) (0)
Efficient computation of maximal anti-exponent in palindrome-free strings (2016) (0)
Tug-of-War Sketch (2009) (0)
Constant-Space String-Matchingin Sublinear Average Time ( Extended Abstract ) (2019) (0)
Temporal Domain (2009) (0)
Squares and Repetitions (2008) (0)
Algorithms on Strings: Approximate patterns (2007) (0)
String Processing and Information Retrieval (2014) (0)
Maximal-exponent factors in strings ✩ (2013) (0)
Absent words and the (dis)similarity analysis of DNA sequences: an experimental study (2016) (0)
Algorithms on Strings: String searching with a sliding window (2007) (0)
Mathematical Foundations of Computer Science 2007, Proceedings (2007) (0)
Proceedings 22nd International Conference of the Chilean Computer Science Society. IEEE Comput. Soc. 2002, pp.7-13. Los Alamitos, CA, USA. (2002) (0)
LATIN 2004: Theoretical Informatics (2004) (0)
Temporal Type (2009) (0)
Automata and algorithms (1989) (0)
Matching by dueling and sampling (2002) (0)
Proceedings of the 21st International Symposium on String Processing and Information Retrieval - Volume 8799 (2014) (0)
Applied Combinatorics on Words (2005) (0)
Text Compression Using Antidictionaries (extended Abstract) (0)
Alignments and Approximate String Matching (2008) (0)
Gapped Suﬀix Arrays: a New Index Structure for Fast Approximate Matching (2010) (0)
Algorithms on Strings: Local periods (2007) (0)
Developments in Language Theory (2002) (0)
Combinatorics, Words and Symbolic Dynamics (2015) (0)
Proceedings of Prague Stringology Club Workshop (PSCW'01) (2001) (0)
Service Choreography (2009) (0)
Storage Array (2009) (0)
Finite-Repetition threshold for infinite ternary words Golnaz Badkobeh (2019) (0)
Dynamic range minimum queries (2010) (0)
Algorithms on Strings: Preface (2007) (0)
Service Item (2020) (0)
Visions of Computing Science (2008) (0)
Genome and Informatics (2002) (0)
Special issue in honor of the 70th birthday of Prof. Wojciech Rytter (2019) (0)
Mathematics in Computer Science, special issue on Combinatorial Algorithms (2008) (0)
Order-Preserving Indexing (cid:73) (2016) (0)
Algorithms and automata (1987) (0)
D ec 2 01 7 Cartesian trees and Lyndon trees (2018) (0)
StringMasters 2011 Special Issue (2013) (0)
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) (2011) (0)
Computational Biology: annotated glossary of terms (appendix 1). (2004) (0)
Basic string searching algorithms (2002) (0)
Algorithms on Strings: Bibliography (2007) (0)
Text compression techniques (2002) (0)
Longest common substrings, related problems and applications (2013) (0)
Factor Oracle, Suux Oracle (1999) (0)
Encyclopedia of Algorithms (2008) (0)
Foreword (2008) (0)
30 14111 – Combinatorics and Algorithmics of Strings 2 Table of Contents (2014) (0)
Visions of computer science (2008) (0)
LECT NOTE COMPUT SCI (2004) (0)
A String-Matching Interpretation of the Equation xmyn = zp (1992) (0)
A Note on E(cid:30)cient Computation of All Abelian Periods in a String (2012) (0)
Efficient Data Structures (2021) (0)
-Space String- in Sublinear Average Time (1998) (0)
Proceedings of the 1st International Conference on Language and Automata Theory and Applications (LATA'07) (2007) (0)
On the maximal number of highly periodic runs in a string (2009) (0)
Algorithms on Strings: Suffix arrays (2007) (0)
Fast phylogenetic inference from typing data (2018) (0)
Factor oracle, Suffix oracle (Extended Abstract) (2007) (0)
Sequential Exact String Matching (2008) (0)
Constant-space searchings (2002) (0)
Linear construction of a left Lyndon tree (2022) (0)
Fast detection of specific fragments against a set of sequences (2022) (0)
Two-dimensional pattern matching (2002) (0)
Preface (2018) (0)
Algorithms on Strings: Indexes (2007) (0)
k-Abelian Pattern Matching: Revisited, Corrected, and Extended (2019) (0)
Combinatorial Pattern Matching, CPM'2002 (2002) (0)
Forty Years of Suﬀix Trees Forty Years of Sufﬁx Trees (2018) (0)
Two-dimensional periodicities (2002) (0)
A solution to Berstel's problem P3 (1982) (0)
String Matching with Contraints (1988) (0)
Les automates finis (1993) (0)
Reactive Links to Save Automata States (2010) (0)
Counting maximal-exponent factors in words (2017) (0)
On the appearance of seeds in words (2015) (0)
Understanding maximal repetitions in strings (2008) (0)
SOFSEM 2010: Theory and Practice of Computer Science36th Conference on Current Trends in Theory and Practice of Computer Science, (2010) (0)
Mathematical Foundations of Computer Science (2007) (0)
Approximate Indexing: Gapped Suffix Arrays (2013) (0)
Spatial Analysis (2018) (0)
Two dimensional Range Minimum/Maximum Query revisited (2010) (0)
Computational Biology: Annotated Glossary of Terms (2004) (0)
Text algorithms related to sorting (2002) (0)
Parallel text algorithms (2002) (0)
Critical factorizations of words (1988) (0)
Foreword (2005) (0)
Lyndon fountains and the Burrows-Wheeler transform (2012) (0)
Time Sequence (2009) (0)
StringMasters 2012 & 2013 special issue - volume 1 (2014) (0)
Negative information for building phylogenies. (2013) (0)
Combinatorial Pattern Matching (2003) (0)
Preprocessing for basic searchings (2002) (0)
StringMasters 2012 & 2013 special issue - volume 2 (2015) (0)
Algorithms on Strings: Alignments (2007) (0)

This paper list is powered by the following services:

Other Resources About Maxime Crochemore

What Schools Are Affiliated With Maxime Crochemore?

Maxime Crochemore is affiliated with the following schools:

King's College London

Maxime Crochemore's Academic­Influence.com Rankings

Why Is Maxime Crochemore Influential?

Maxime Crochemore's Published Works

Published Works

Other Resources About Maxime Crochemore

What Schools Are Affiliated With Maxime Crochemore?

Maxime Crochemore's AcademicInfluence.com Rankings