Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words. - Jean-Pierre Duval; Laurent Mouchard (J. Autom. Lang. Comb., 1999)

Quasiperiodicity: From Detection to Normal Forms. - Costas S. Iliopoulos; Laurent Mouchard (J. Autom. Lang. Comb., 1999)

Quasiperiodicity and String Covering. - Costas S. Iliopoulos; Laurent Mouchard (Theor. Comput. Sci., 1999)

Periods and Quasiperiods Characterization. - Mireille Régnier; Laurent Mouchard (CPM, 2000)

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

Normal forms of quasiperiodic strings. - Laurent Mouchard (Theor. Comput. Sci., 2000)

Genome and Stringology. - Laurent Mouchard (Stringology, 2001)

The Max-Shift Algorithm for Approximate String Matching. - Costas S. Iliopoulos; Laurent Mouchard; Yoan J. Pinzón (WAE, 2001)

Distributed Pattern Matching Using Finite Automata. - Jan Holub 001; Costas S. Iliopoulos; Borivoj Melichar; Laurent Mouchard (J. Autom. Lang. Comb., 2001)

Evolutive Tandem Repeats Using Hamming Distance. - Richard Groult; Martine Léonard; Laurent Mouchard (MFCS, 2002)

Algorithms for Computing Approximate Repetitions in Musical Sequences. - Emilios Cambouropoulos; Maxime Crochemore; Costas S. Iliopoulos; Laurent Mouchard; Yoan J. Pinzón (Int. J. Comput. Math., 2002)

Computing the Repetitions in a Weighted Sequence. - Costas S. Iliopoulos; Laurent Mouchard; Katerina Perdikuri; Athanasios K. Tsakalidis (Stringology, 2003)

String Regularities with Don't Cares. - Costas S. Iliopoulos; Manal Mohamed 001; Laurent Mouchard; Katerina Perdikuri; William F. Smyth; Athanasios K. Tsakalidis (Nord. J. Comput., 2003)

Speeding up the detection of evolutive tandem repeats. - Richard Groult; Martine Léonard; Laurent Mouchard (Theor. Comput. Sci., 2004)

A Linear Algorithm for the Detection of Evolutive Tandem Repeats. - Richard Groult; Martine Léonard; Laurent Mouchard (J. Autom. Lang. Comb., 2005)

Computing the Repetitions in a Biological Weighted Sequence. - Costas S. Iliopoulos; Laurent Mouchard; Katerina Perdikuri; Athanasios K. Tsakalidis (J. Autom. Lang. Comb., 2005)

Computation of Repetitions and Regularities of Biologically Weighted Sequences. - Manolis Christodoulakis; Costas S. Iliopoulos; Laurent Mouchard; Katerina Perdikuri; Athanasios K. Tsakalidis; Kostas Tsichlas (J. Comput. Biol., 2006)

Pattern Matching in Degenerate DNA/RNA Sequences. - M. Sohel Rahman; Costas S. Iliopoulos; Laurent Mouchard (WALCOM, 2007)

Combinatorial Pattern Matching. - Kunsoo Park; Laurent Mouchard (J. Discrete Algorithms, 2007)

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

A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching. - Costas S. Iliopoulos; Laurent Mouchard; Mohammad Sohel Rahman (Math. Comput. Sci., 2008)

Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. - Pavlos Antoniou; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (IJCBS, 2009)

A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. - Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (PARCO, 2009)

Algorithms for mapping short degenerate and weighted sequences to a reference genome. - Pavlos Antoniou; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis (Int. J. Comput. Biol. Drug Des., 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)

REAL: an efficient REad ALigner for next generation sequencing reads. - Kimon Frousios; Costas S. Iliopoulos; Laurent Mouchard; Solon P. Pissis; German Tischler (BCB, 2010)

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

Using Belief Function Theory to Deal with Uncertainties and Imprecisions in Image Processing. - Benoît Lelandais; Isabelle Gardin; Laurent Mouchard; Pierre Vera; Su Ruan (Belief Functions, 2012)

Lyndon fountains and the Burrows-Wheeler transform. - Ali Alatabbi; Maxime Crochemore; Jacqueline W. Daykin; Laurent Mouchard (CUBE, 2012)

Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations. - Ali Alatabbi; Carl Barton; Costas S. Iliopoulos; Laurent Mouchard (AIAI (2), 2012)

Segmentation of Biological Target Volumes on Multi-tracer PET Images Based on Information Fusion for Achieving Dose Painting in Radiotherapy. - Benoît Lelandais; Isabelle Gardin; Laurent Mouchard; Pierre Vera; Su Ruan (MICCAI (1), 2012)

An algorithm for mapping short reads to a dynamically changing genomic sequence. - Costas S. Iliopoulos; Derrick G. Kourie; Laurent Mouchard; Themba K. Musombuka; Solon P. Pissis; Corné de Ridder (J. Discrete Algorithms, 2012)

On the number of elements to reorder when updating a suffix array. - Martine Léonard; Laurent Mouchard; Mikaël Salson (J. Discrete Algorithms, 2012)

Editorial. - Laurent Mouchard; Simon J. Puglisi (J. Discrete Algorithms, 2012)

Suffix Tree of Alignment: An Efficient Index for Similar Data. - Joong Chae Na; Heejin Park; Maxime Crochemore; Jan Holub 001; Costas S. Iliopoulos; Laurent Mouchard; Kunsoo Park (IWOCA, 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)

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)

Linear-time computation of minimal absent words using suffix array. - Carl Barton; Alice Héliou; Laurent Mouchard; Solon P. Pissis (BMC Bioinform., 2014)

Dealing with uncertainty and imprecision in image segmentation using belief function theory. - Benoît Lelandais; Isabelle Gardin; Laurent Mouchard; Pierre Vera; Su Ruan (Int. J. Approx. Reason., 2014)

Extending alignments with k-mismatches and ℓ-gaps. - Carl Barton; Costas S. Iliopoulos; Inbok Lee; Laurent Mouchard; Kunsoo Park; Solon P. Pissis (Theor. Comput. Sci., 2014)

Parallelising the Computation of Minimal Absent Words. - Carl Barton; Alice Héliou; Laurent Mouchard; Solon P. Pissis (PPAM (2), 2015)

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

Efficient dynamic range minimum query. - Alice Héliou; Martine Léonard; Laurent Mouchard; Mikaël Salson (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)

Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. - Maxime Crochemore; Alice Héliou; Gregory Kucherov; Laurent Mouchard; Solon P. Pissis; Yann Ramusat (FCT, 2017)

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)

A data-supported history of bioinformatics tools. - Clément Levin; Emeric Dynomant; Bruno J. Gonzalez; Laurent Mouchard; David Landsman; Eivind Hovig; Kristian Vlahovicek (CoRR, 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)

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)

Absent words in a sliding window with applications. - Maxime Crochemore; Alice Héliou; Gregory Kucherov; Laurent Mouchard; Solon P. Pissis; Yann Ramusat (Inf. Comput., 2020)