A. Amir, Y. Aumann, R. Cole, M. Lewenstein, and E. Porat, Function Matching: Algorithms, Applications, and a Lower Bound, Proc. of ICALP 03, pp.929-942, 2003.
DOI : 10.1007/3-540-45061-0_72

B. S. Baker, Parameterized Pattern Matching: Algorithms and Applications, Journal of Computer and System Sciences, vol.52, issue.1, pp.28-42, 1996.
DOI : 10.1006/jcss.1996.0003

B. S. Baker, Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance, SIAM Journal on Computing, vol.26, issue.5, pp.1343-1362, 1997.
DOI : 10.1137/S0097539793246707

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

G. S. Brodal, R. B. Lyngsø, C. N. Pederson, and J. Stoye, Finding maximal pairs with bounded gaps, J. of Discrete Algorithms, vol.1, issue.1, pp.1-27, 2000.

H. S. Chan and K. A. Dill, Compact polymers, Macromolecules, vol.22, issue.12, pp.4559-4573, 1989.
DOI : 10.1021/ma00202a031

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms ? Second Edition, 1998.

M. Crochemore, C. Iliopoulos, M. Mohamed, and M. F. Sagot, Longest repeats with a block of don't cares, Proc. of Latin 04, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00619567

D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, 1997.
DOI : 10.1017/CBO9780511574931

D. Harel and R. E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984.
DOI : 10.1137/0213024

S. Karlin and G. Ghandour, Multiple-alphabet amino acid sequence comparisons of the immunoglobulin kappa-chain constant domain., Proc. Natl. Acad. Sci. USA, pp.8597-8601, 1985.
DOI : 10.1073/pnas.82.24.8597

R. Kolpakov and G. Kucherov, Finding repeats with fixed gap, Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000, pp.162-168, 2002.
DOI : 10.1109/SPIRE.2000.878192

URL : https://hal.archives-ouvertes.fr/inria-00107855

T. Li, K. Fan, J. Wang, and W. Wang, Reduction of protein sequence complexity by residue grouping, Protein Engineering Design and Selection, vol.16, issue.5, pp.323-330, 2003.
DOI : 10.1093/protein/gzg044

X. Liu, D. Liu, J. Qi, and W. M. Zheng, Simplified amino acid alphabets based on deviation of conditional probability from random background, Physical Review E, vol.66, issue.2, pp.1-9, 2002.
DOI : 10.1103/PhysRevE.66.021906

M. Lothaire, Applied Combinatorics on Words
DOI : 10.1017/CBO9781107341005

URL : https://hal.archives-ouvertes.fr/hal-00620607

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

E. M. Mccreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.
DOI : 10.1145/321941.321946

L. R. Murphy, A. Wallqvist, and R. M. Levy, Simplified amino acid alphabets for protein fold recognition and implications for folding, Protein Engineering Design and Selection, vol.13, issue.3, pp.149-152, 2000.
DOI : 10.1093/protein/13.3.149

B. Schieber and U. Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization, SIAM Journal on Computing, vol.17, issue.6, pp.1253-1262, 1988.
DOI : 10.1137/0217079

M. Spitzer, G. Fuellen, P. Cullen, and S. Lorkowsk, Viscose: Visualisation and comparison of consensus sequences, Bioinformatics

J. Wang and W. Wang, A computational approach to simplifying the protein folding alphabet, Nat. Struct. Biol, vol.11, pp.1033-1038, 1999.