A Variation on the Boyer-Moore Algorithm. - Thierry Lecroq (Theor. Comput. Sci., 1992)

Speeding Up Two String-Matching Algorithms. - Maxime Crochemore; Artur Czumaj; Leszek Gasieniec; Stefan Jarominek; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Algorithmica, 1994)

Experimental Results on String Matching Algorithms. - Thierry Lecroq (Softw. Pract. Exp., 1995)

Pattern-Matching and Text-Compression Algorithms. - Maxime Crochemore; Thierry Lecroq (ACM Comput. Surv., 1996)

Pattern Matching and Text Compression Algorithms. - Maxime Crochemore; Thierry Lecroq (The Computer Science and Engineering Handbook, 1997)

Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. - Maxime Crochemore; Thierry Lecroq (Inf. Process. Lett., 1997)

A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence. - Thierry Lecroq; Guillaume Luce; Jean Frédéric Myoupo (Inf. Process. Lett., 1997)

A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract). - Christian Charras; Thierry Lecroq; Joseph Daniel Pehoushek (CPM, 1998)

Exact String Matching Animation in Java. - Christian Charras; Thierry Lecroq (Stringology, 1998)

A One-Phase Parallel Algorithm for the Sequence Alignment Problem. - Thierry Lecroq; Jean Frédéric Myoupo; David Semé (Parallel Process. Lett., 1998)

Experiments on String Matching in Memory Structures. - Thierry Lecroq (Softw. Pract. Exp., 1998)

Text Data Compression Algorithms. - Maxime Crochemore; Thierry Lecroq (Algorithms and Theory of Computation Handbook, 1999)

Fast Practical Multi-Pattern Matching. - Maxime Crochemore; Artur Czumaj; Leszek Gasieniec; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Inf. Process. Lett., 1999)

Computing Approximate Repetitions in Musical Sequences. - Costas S. Iliopoulos; Thierry Lecroq; Laurent Mouchard; Yoan J. Pinzón (Stringology, 2000)

Compror: Compression with a Factor Oracle. - Arnaud Lefebvre; Thierry Lecroq (Data Compression Conference, 2001)

Approximate String Matching in Musical Sequences. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq; Yoan J. Pinzón (Stringology, 2001)

Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. - Thierry Lecroq; Jean Frédéric Myoupo; David Semé (CATA, 2002)

Three Heuristics for delta-Matching: delta-BM Algorithms. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (CPM, 2002)

A Heuristic for Computing Repeats with a Factor Oracle: Application to Biological Sequences. - Arnaud Lefebvre; Thierry Lecroq (Int. J. Comput. Math., 2002)

Compror: On-line lossless data compression with a factor oracle. - Arnaud Lefebvre; Thierry Lecroq (Inf. Process. Lett., 2002)

FORRepeats: detects repeats on entire chromosomes and between genomes. - Arnaud Lefebvre; Thierry Lecroq; Hélène Dauchel; Joël Alexandre (Bioinform., 2003)

Occurrence and Substring Heuristics for i-Matching. - Maxime Crochemore; Costas S. Iliopoulos; Thierry Lecroq (Fundam. Informaticae, 2003)

On special families of morphisms related to [delta]-matching and don't care symbols. - Richard Cole 001; Costas S. Iliopoulos; Thierry Lecroq; Wojciech Plandowski; Wojciech Rytter (Inf. Process. Lett., 2003)

An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle. - Arnaud Lefebvre; Thierry Lecroq; Joël Alexandre (J. Autom. Lang. Comb., 2003)

A unifying look at the Apostolico-Giancarlo string-matching algorithm. - Maxime Crochemore; Christophe Hancart; Thierry Lecroq (J. Discrete Algorithms, 2003)

String Algorithmics. - Costas S. Iliopoulos; Thierry Lecroq (College Publications, 2004)

Handbook of Exact String Matching Algorithms. - Christian Charras; Thierry Lecroq (College Publications, 2004)

Linear-time computation of local periods. - Jean-Pierre Duval; Roman Kolpakov; Gregory Kucherov; Thierry Lecroq; Arnaud Lefebvre (Theor. Comput. Sci., 2004)

Border Array on Bounded Alphabet. - Jean-Pierre Duval; Thierry Lecroq; Arnaud Lefebvre (J. Autom. Lang. Comb., 2005)

From Suffix Trees to Suffix Vectors. - Élise Prieur; Thierry Lecroq (Int. J. Found. Comput. Sci., 2006)

Text Searching and Indexing. - Maxime Crochemore; Thierry Lecroq (Recent Advances in Formal Languages and Applications, 2006)

Algorithms on strings. - Maxime Crochemore; Christophe Hancart; Thierry Lecroq (Cambridge University Press, 2007)

Fast exact string matching algorithms. - Thierry Lecroq (Inf. Process. Lett., 2007)

Searching Related Resources in a Quality Controlled Health Gateway: a Feasibility Study. - Tayeb Merabti; Suzanne Pereira; Catherine Letord; Thierry Lecroq; Michel Joubert; Badisse Dahamna; Stéfan Jacques Darmoni (MIE, 2008)

Dynamic Burrows-Wheeler Transform. - Mikaël Salson; Thierry Lecroq; Martine Léonard; Laurent Mouchard (Stringology, 2008)

Efficient Pattern Matching on Binary Strings - Simone Faro; Thierry Lecroq (CoRR, 2008)

On-line construction of compact suffix vectors and maximal repeats. - Élise Prieur; Thierry Lecroq (Theor. Comput. Sci., 2008)

Sequential Exact String Matching. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Algorithms, 2008)

Sequential Multiple String Matching. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Algorithms, 2008)

Alignments and Approximate String Matching. - Maxime Crochemore; Thierry Lecroq (New Developments in Formal Languages and Applications, 2008)

An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. - Simone Faro; Thierry Lecroq (CPM, 2009)

CPM's 20th Anniversary: A Statistical Retrospective. - Elena Yavorska Harris; Thierry Lecroq; Gregory Kucherov; Stefano Lonardi (CPM, 2009)

Projection and Inheritance of SNOMED CT Relations between MeSH Terms. - Tayeb Merabti; Catherine Letord; Hocine Abdoune; Thierry Lecroq; Michel Joubert; Stéfan Jacques Darmoni (MIE, 2009)

Efficient Variants of the Backward-Oracle-Matching Algorithm. - Simone Faro; Thierry Lecroq (Int. J. Found. Comput. Sci., 2009)

Efficient validation and construction of border arrays and validation of string matching automata. - Jean-Pierre Duval; Thierry Lecroq; Arnaud Lefebvre (RAIRO Theor. Informatics Appl., 2009)

Identification de répétitions dans les navigations au sein d'un catalogue de santé. - Alexandre Pauchet; Mohamad El-Abed; Tayeb Merabti; Élise Prieur; Thierry Lecroq; Stéfan Jacques Darmoni (Rev. d'Intelligence Artif., 2009)

A four-stage algorithm for updating a Burrows-Wheeler transform. - Mikaël Salson; Thierry Lecroq; Martine Léonard; Laurent Mouchard (Theor. Comput. Sci., 2009)

Suffix Tree. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Database Systems, 2009)

Trie. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Database Systems, 2009)

SMS-Forbid: An Efficient Agorithm for Simple Motif Problem. - Tarek El Falah; Thierry Lecroq; Mourad Elloumi (BICoB, 2010)

An Automated Approach to map a French terminology to UMLS. - Tayeb Merabti; Philippe Massari; Michel Joubert; Eric Sadou; Thierry Lecroq; Hocine Abdoune; Jean Marie Rodrigues; Stéfan Jacques Darmoni (MedInfo, 2010)

The Exact String Matching Problem: a Comprehensive Experimental Evaluation - Simone Faro; Thierry Lecroq (CoRR, 2010)

Dynamic extended suffix arrays. - Mikaël Salson; Thierry Lecroq; Martine Léonard; Laurent Mouchard (J. Discrete Algorithms, 2010)

Improving Algorithms for Knowledge Discovery in Genetics Databases. - Heni Bouhamed; Thierry Lecroq; Ahmed Rebai; Maher Jaoua (DEXA Workshops, 2011)

An Efficient Motif Search Algorithm Based on a Minimal Forbidden Patterns Approach. - Tarek El Falah; Thierry Lecroq; Mourad Elloumi (PACBB, 2011)

2001-2010: Ten Years of Exact String Matching Algorithms. - Simone Faro; Thierry Lecroq (Stringology, 2011)

Computing Abelian Periods in Words. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (Stringology, 2011)

Querying large read collections in main memory: a versatile data structure. - Nicolas Philippe; Mikaël Salson; Thierry Lecroq; Martine Léonard; Therese Commes; Eric Rivals (BMC Bioinform., 2011)

Fast searching in biological sequences using multiple hash functions. - Simone Faro; Thierry Lecroq (BIBE, 2012)

A New Approach for Bayesian Classifier Learning Structure via K2 Algorithm. - Heni Bouhamed; Afif Masmoudi; Thierry Lecroq; Ahmed Rebai (ICIC (3), 2012)

A New Learning Structure Heuristic of Bayesian Networks from Data. - Heni Bouhamed; Afif Masmoudi; Thierry Lecroq; Ahmed Rebai (MLDM, 2012)

Quasi-linear Time Computation of the Abelian Periods of a Word. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston; William F. Smyth (Stringology, 2012)

A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. - Simone Faro; Thierry Lecroq (SEA, 2012)

A Fast Suffix Automata Based Algorithm for Exact Online String Matching. - Simone Faro; Thierry Lecroq (CIAA, 2012)

EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics. - Sophie Coutant; Chloé Cabot; Arnaud Lefebvre; Martine Léonard; Élise Prieur-Gaston; Dominique Campion; Thierry Lecroq; Hélène Dauchel (BMC Bioinform., 2012)

Matching health information seekers' queries to medical terms. - Lina Fatima Soualmia; Élise Prieur-Gaston; Zied Moalla; Thierry Lecroq; Stéfan Jacques Darmoni (BMC Bioinform., 2012)

A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections. - Eric Rivals; Nicolas Philippe; Mikaël Salson; Martine Léonard; Therese Commes; Thierry Lecroq (ERCIM News, 2012)

Pattern discovery in annotated dialogues using dynamic programming. - Thierry Lecroq; Alexandre Pauchet; Émilie Chanoni; Gerardo Ayala Solano (Int. J. Intell. Inf. Database Syst., 2012)

Abelian Repetitions in Sturmian Words. - Gabriele Fici; Alessio Langiu; Thierry Lecroq; Arnaud Lefebvre; Filippo Mignosi; Élise Prieur-Gaston (Developments in Language Theory, 2013)

Suffix Array of Alignment: A Practical Index for Similar Data. - Joong Chae Na; Heejin Park; Sunho Lee 002; Minsung Hong; Thierry Lecroq; Laurent Mouchard; Kunsoo Park (SPIRE, 2013)

The exact online string matching problem: A review of the most recent results. - Simone Faro; Thierry Lecroq (ACM Comput. Surv., 2013)

Querying highly similar sequences. - Carl Barton; Mathieu Giraud; Costas S. Iliopoulos; Thierry Lecroq; Laurent Mouchard; Solon P. Pissis (Int. J. Comput. Biol. Drug Des., 2013)

Pattern Matching and Text Compression Algorithms. - Maxime Crochemore; Thierry Lecroq (Computing Handbook, 3rd ed. (1), 2014)

A fast pattern matching algorithm for highly similar sequences. - Nadia Ben Nsira; Thierry Lecroq; Mourad Elloumi (BIBM, 2014)

From Indexing Data Structures to de Bruijn Graphs. - Bastien Cazaux; Thierry Lecroq; Eric Rivals (CPM, 2014)

Omic Data Modelling for Information Retrieval. - Chloé Cabot; Julien Grosjean; Romain Lelong; Arnaud Lefebvre; Thierry Lecroq; Lina Fatima Soualmia; Stéfan Jacques Darmoni (IWBBIO, 2014)

Rgb: a scriptable genome browser for R. - Sylvain Mareschal; Sydney Dubois; Thierry Lecroq; Fabrice Jardin (Bioinform., 2014)

Algorithms for computing Abelian periods of words. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (Discret. Appl. Math., 2014)

Preface. - Thierry Lecroq (J. Discrete Algorithms, 2014)

Linear computation of unbordered conjugate on unordered alphabet. - Jean-Pierre Duval; Thierry Lecroq; Arnaud Lefebvre (Theor. Comput. Sci., 2014)

Supervised Term Weights for Biomedical Text Classification: Improvements in Nearest Centroid Computation. - Mounia Haddoud; Aïcha Mokhtari; Thierry Lecroq; Saïd Abdeddaïm (CIBB, 2015)

Accurate Keyphrase Extraction from Scientific Papers by Mining Linguistic Information. - Mounia Haddoud; Aïcha Mokhtari; Thierry Lecroq; Saïd Abdeddaïm (CLBib@ISSI, 2015)

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. - Bastien Cazaux; Thierry Lecroq; Eric Rivals (LATA, 2015)

Online Computation of Abelian Runs. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (LATA, 2015)

Abelian Powers and Repetitions in Sturmian Words. - Gabriele Fici; Alessio Langiu; Thierry Lecroq; Arnaud Lefebvre; Filippo Mignosi; Élise Prieur-Gaston (CoRR, 2015)

A fast Boyer-Moore type pattern matching algorithm for highly similar sequences. - Nadia Ben Nsira; Thierry Lecroq; Mourad Elloumi (Int. J. Data Min. Bioinform., 2015)

Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks. - Heni Bouhamed; Afif Masmoudi; Thierry Lecroq; Ahmed Rebai (J. Comput. Appl. Math., 2015)

Editorial. - Thierry Lecroq; Laurent Mouchard (J. Discrete Algorithms, 2015)

Reducing the Structure Space of Bayesian Classifiers Using Some General Algorithms. - Heni Bouhamed; Afif Masmoudi; Thierry Lecroq; Ahmed Rebai (J. Math. Model. Algorithms Oper. Res., 2015)

The String Matching Algorithms Research Tool. - Simone Faro; Thierry Lecroq; Stefano Borzi; Simone Di Mauro; Alessandro Maggio (Stringology, 2016)

A note on easy and efficient computation of full abelian periods of a word. - Gabriele Fici; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston; William F. Smyth (Discret. Appl. Math., 2016)

Combining supervised term-weighting metrics for SVM text classification with extended term representation. - Mounia Haddoud; Aïcha Mokhtari; Thierry Lecroq; Saïd Abdeddaïm (Knowl. Inf. Syst., 2016)

Binary block order Rouen Transform. - Jacqueline W. Daykin; Richard Groult; Yannick Guesnet; Thierry Lecroq; Arnaud Lefebvre; Martine Léonard; Élise Prieur-Gaston (Theor. Comput. Sci., 2016)

Fast computation of abelian runs. - Gabriele Fici; Tomasz Kociumaka; Thierry Lecroq; Arnaud Lefebvre; Élise Prieur-Gaston (Theor. Comput. Sci., 2016)

Abelian powers and repetitions in Sturmian words. - Gabriele Fici; Alessio Langiu; Thierry Lecroq; Arnaud Lefebvre; Filippo Mignosi; Jarkko Peltomäki; Élise Prieur-Gaston (Theor. Comput. Sci., 2016)

FM-index of alignment: A compressed index for similar strings. - Joong Chae Na; Hyunjoon Kim; Heejin Park; Thierry Lecroq; Martine Léonard; Laurent Mouchard; Kunsoo Park (Theor. Comput. Sci., 2016)

Multiple String Matching. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Algorithms, 2016)

String Matching. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Algorithms, 2016)

Algorithms for Indexing Highly Similar DNA Sequences. - Nadia Ben Nsira; Thierry Lecroq; Mourad Elloumi (Algorithms for Next-Generation Sequencing Data, 2017)

On-line String Matching in Highly Similar DNA Sequences. - Nadia Ben Nsira; Mourad Elloumi; Thierry Lecroq (Math. Comput. Sci., 2017)

Practical fast on-line exact pattern matching algorithms for highly similar sequences. - Nadia Ben Nsira; Thierry Lecroq; Élise Prieur-Gaston (BIBM, 2018)

Three Strategies for the Dead-Zone String Matching Algorithm. - Jacqueline W. Daykin; Richard Groult; Yannick Guesnet; Thierry Lecroq; Arnaud Lefebvre; Martine Léonard; Laurent Mouchard; Élise Prieur-Gaston; Bruce W. Watson (Stringology, 2018)

Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph. - Pierre Morisse; Thierry Lecroq; Arnaud Lefebvre (Bioinform., 2018)

A survey of string orderings and their application to the Burrows-Wheeler transform. - Jacqueline W. Daykin; Richard Groult; Yannick Guesnet; Thierry Lecroq; Arnaud Lefebvre; Martine Léonard; Élise Prieur-Gaston (Theor. Comput. Sci., 2018)

FM-index of alignment with gaps. - Joong Chae Na; Hyunjoon Kim; Seunghwan Min; Heejin Park; Thierry Lecroq; Martine Léonard; Laurent Mouchard; Kunsoo Park (Theor. Comput. Sci., 2018)

Suffix Tree. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Database Systems (2nd ed.), 2018)

Trie. - Maxime Crochemore; Thierry Lecroq (Encyclopedia of Database Systems (2nd ed.), 2018)

Fast Cartesian Tree Matching. - Siwoo Song; Cheol Ryu; Simone Faro; Thierry Lecroq; Kunsoo Park (SPIRE, 2019)

Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences. - Nadia Ben Nsira; Thierry Lecroq; Élise Prieur-Gaston (Int. J. Data Min. Bioinform., 2019)

Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. - Jacqueline W. Daykin; Richard Groult; Yannick Guesnet; Thierry Lecroq; Arnaud Lefebvre; Martine Léonard; Laurent Mouchard; Élise Prieur; Bruce W. Watson (Inf. Process. Lett., 2019)

Linking indexing data structures to de Bruijn graphs: Construction and update. - Bastien Cazaux; Thierry Lecroq; Eric Rivals (J. Comput. Syst. Sci., 2019)

Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. - Simone Faro; Thierry Lecroq; Kunsoo Park (Stringology, 2020)

Fast Multiple Pattern Cartesian Tree Matching. - Geonmo Gu; Siwoo Song; Simone Faro; Thierry Lecroq; Kunsoo Park (WALCOM, 2020)

UMI-VarCal: a new UMI-based variant caller that efficiently improves low-frequency variant detection in paired-end sequencing NGS libraries. - Vincent Sater; Pierre-Julien Viailly; Thierry Lecroq; Élise Prieur-Gaston; Élodie Bohers; Mathieu Viennot; Philippe Ruminy; Hélène Dauchel; Pierre Vera; Fabrice Jardin (Bioinform., 2020)

Fast string matching for DNA sequences. - Cheol Ryu; Thierry Lecroq; Kunsoo Park (Theor. Comput. Sci., 2020)

Improving high-resolution copy number variation analysis from next generation sequencing using unique molecular identifiers. - Pierre-Julien Viailly; Vincent Sater; Mathieu Viennot; Élodie Bohers; Nicolas Vergne; Caroline Bérard; Hélène Dauchel; Thierry Lecroq; Alison Celebi; Philippe Ruminy; Vinciane Marchand; Marie-Delphine Lanic; et al. (BMC Bioinform., 2021)

Fast algorithms for single and multiple pattern Cartesian tree matching. - Siwoo Song; Geonmo Gu; Cheol Ryu; Simone Faro; Thierry Lecroq; Kunsoo Park (Theor. Comput. Sci., 2021)

Adding Descriptors to Melodies Improves Pattern Matching: A Study on Slovenian Folk Songs. - Vanessa Nina Borsan; Mathieu Giraud; Richard Groult; Thierry Lecroq (ISMIR, 2023)

Approximate Cartesian Tree Matching: An Approach Using Swaps. - Bastien Auvray; Julien David; Richard Groult; Thierry Lecroq (SPIRE, 2023)

Optimal-Hash Exact String Matching Algorithms. - Thierry Lecroq (CoRR, 2023)

TCS special issue: Combinatorics on Words - WORDS 2021. - Thierry Lecroq; Svetlana Puzynina (Theor. Comput. Sci., 2023)

On the Longest Common Cartesian Substring Problem. - Simone Faro; Thierry Lecroq; Kunsoo Park; Stefano Scafiti (Comput. J., 2023)

Improving Sampled Matching through Character Context Sampling. - Simone Faro; Thierry Lecroq; Francesco Pio Marino; Arianna Pavone; Stefano Scafiti (ICTCS, 2024)

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm. - Thierry Lecroq (CoRR, 2024)

Fast computation of the period and of the shortest cover of a string using its Character-Distance-Sampling representation. - Thierry Lecroq; Francesco Pio Marino (CoRR, 2024)

Practical KMP/BM style pattern-matching on indeterminate strings. - Hossein Dehghani; Thierry Lecroq; Neerja Mhaskar; W. F. Smyth (Discret. Appl. Math., 2025)

Approximate Cartesian Tree Matching with One Difference. - Bastien Auvray; Julien David; Samah Ghazawi; Richard Groult; Gad M. Landau; Thierry Lecroq (CoRR, 2025)

Cartesian Forest Matching. - Bastien Auvray; Julien David; Richard Groult; Thierry Lecroq (CoRR, 2025)

25 Additional Problems - Extension to the Book "125 Problems in Text Algorithms". - Maxime Crochemore; Thierry Lecroq; Wojciech Rytter (CoRR, 2025)