A. Apostolico and L. Parida, Incremental paradigms of motif discovery. Unpublished, 2002.

A. Apostolico and L. Parida, Compression and the wheel of fortune, Data Compression Conference, 2003. Proceedings. DCC 2003, pp.143-152, 2003.
DOI : 10.1109/DCC.2003.1194005

R. Baeza-yates and B. Ribeiro-neto, Modern Information Retrieval, 1999.

A. Brazma, I. Jonassen, I. Eidhammer, and D. R. Gilbert, Approaches to the Automatic Discovery of Patterns in Biosequences, Journal of Computational Biology, vol.5, issue.2, pp.279-305, 1998.
DOI : 10.1089/cmb.1998.5.279

T. Imielinski and H. Mannila, A database perspective on knowledge discovery, Communications of the ACM, vol.39, issue.11, pp.58-64, 1999.
DOI : 10.1145/240455.240472

M. Lothaire, Combinatorics on Words, 1997.
DOI : 10.1017/CBO9780511566097
URL : https://hal.archives-ouvertes.fr/hal-00620607

M. Lothaire, Algebraic Combinatorics on Words, 2002.
DOI : 10.1017/CBO9781107326019
URL : https://hal.archives-ouvertes.fr/hal-00620608

L. Parida, I. Rigoutsos, A. Floratos, D. Platt, and Y. Gao, Pattern Discovery on Character Sets and Real-valued Data: Linear Bound on Irredundant Motifs and Efficient Polynomial Time Algorithm, Proceedings of the eleventh ACM-SIAM Symposium on Discrete Algorithms, pp.297-308, 2000.

L. Parida, I. Rigoutsos, and D. Platt, An Output-Sensitive Flexible Pattern Discovery Algorithm, Combinatorial Pattern Matching, pp.131-142, 2001.
DOI : 10.1007/3-540-48194-X_11

J. Pelfrêne, S. Abdedda?, and J. Alexandre, Un algorithme d'indexation de motifs approchés, Journée Ouvertes Biologie Informatique Mathématiques (JOBIM), pp.263-264, 2002.

J. Pelfrêne, S. Abdedda?, and J. Alexandre, Extracting approximare patterns, Combinatorial Pattern Matching, pp.328-347, 2003.

N. Pisanti, M. Crochemore, R. Grossi, and M. Sagot, A basis for repeated motifs in pattern discovery and text mining, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00627828

N. Pisanti, M. Crochemore, R. Grossi, and M. Sagot, Bases of motifs for generating repeated patterns with don't cares, 2003.

N. Pisanti, M. Crochemore, R. Grossi, and M. Sagot, A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum, Mathematical Foundations of Computer Science, pp.622-631, 2003.
DOI : 10.1007/978-3-540-45138-9_56
URL : https://hal.archives-ouvertes.fr/hal-00620116

M. Sagot and A. Viari, A double combinatorial approach to discovering patterns in biological sequences, Combinatorial Pattern Matching, pp.186-208, 1996.
DOI : 10.1007/3-540-61258-0_15
URL : https://hal.archives-ouvertes.fr/hal-00435048

M. Sagot, A. Viari, and H. Soldano, Multiple sequence comparison ??? a peptide matching approach, Theoretical Computer Science, vol.180, issue.1-2, pp.115-137, 1997.
DOI : 10.1016/S0304-3975(96)00137-5
URL : https://hal.archives-ouvertes.fr/hal-00698199