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

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)

Words over an ordered alphabet and suffix permutations. - Jean-Pierre Duval; Arnaud Lefebvre (RAIRO Theor. Informatics Appl., 2002)

FORRepeats: detects repeats on entire chromosomes and between genomes. - Arnaud Lefebvre; Thierry Lecroq; Hélène Dauchel; Joël Alexandre (Bioinform., 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)

Improvement of the Design Process through Knowledge Capitalization: an Approach by Know-how Mapping. - Jean Renaud; Arnaud Lefebvre; Christian Fonteix (Concurr. Eng. Res. Appl., 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)

Maps of Dispersions for Machining Processes. - Valéry Wolff; Arnaud Lefebvre; Jean Renaud (Concurr. Eng. Res. Appl., 2006)

Evaluation and exploitation of knowledge robustness in knowledge-based systems - Mathieu Barcikowski; Philippe Pernelle; Arnaud Lefebvre; Michel Martinez; Jean Renaud (CoRR, 2008)

Business processes integration and performance indicators in a PLM - Aurélie Bissay; Philippe Pernelle; Arnaud Lefebvre; Abdelaziz Bouras (CoRR, 2008)

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)

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

A methodology of alarm filtering using dynamic fault tree. - Zineb Simeu-Abazi; Arnaud Lefebvre; Jean-Pierre Derain (Reliab. Eng. Syst. Saf., 2011)

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)

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)

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

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)

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

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

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

Efficient Algorithms for Longest Closed Factor Array. - Hideo Bannai; Shunsuke Inenaga; Tomasz Kociumaka; Arnaud Lefebvre; Jakub Radoszewski; Wojciech Rytter; Shiho Sugimoto; Tomasz Walen (SPIRE, 2015)

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

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)

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)

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)

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)