On codes with finite interpreting delay: A defect theorem. - Yannick Guesnet (RAIRO Theor. Informatics Appl., 2000)

Maximal circular codes versus maximal codes. - Yannick Guesnet (RAIRO Theor. Informatics Appl., 2001)

On Maximal Dense Bifix Codes. - Yannick Guesnet (J. Autom. Lang. Comb., 2001)

On maximal codes with a finite interpreting delay. - Yannick Guesnet (Theor. Comput. Sci., 2002)

On maximal synchronous codes. - Yannick Guesnet (Theor. Comput. Sci., 2003)

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)

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 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)