A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein et al., Text Indexing and Dictionary Matching with One Error, Journal of Algorithms, vol.37, issue.2, pp.181-190, 1999.
DOI : 10.1006/jagm.2000.1104

A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein et al., Text Indexing and Dictionary Matching with One Error, Journal of Algorithms, vol.37, issue.2, pp.309-325, 2000.
DOI : 10.1006/jagm.2000.1104

R. Baeza-yates, G. Navarro, E. Sutinen, and J. Tarhio, Indexing methods for approximate string matching, Special issue on Managing Text Natively and in DBMSs, pp.19-27, 2001.

A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. T. Chen et al., The smallest automation recognizing the subwords of a text, Theoretical Computer Science, vol.40, pp.31-55, 1985.
DOI : 10.1016/0304-3975(85)90157-4

A. L. Buchsbaum, M. T. Goodrich, and J. Westbrook, Range Searching over Tree Cross Products, pp.120-131, 2000.
DOI : 10.1007/3-540-45253-2_12

A. Carpi and A. De-luca, Words and special factors, Theoretical Computer Science, vol.259, issue.1-2, pp.145-182, 2001.
DOI : 10.1016/S0304-3975(99)00334-5

E. Chávez and G. Navarro, A Metric Index for Approximate String Matching, Theoretical Informatics: 5th Latin American Symposium Proceedings, volume 2286 of LNCS, pp.181-195, 2002.
DOI : 10.1007/3-540-45995-2_20

R. Cole, L. Gottlieb, and M. Lewenstein, Dictionary matching and indexing with errors and don't cares, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, 2004.
DOI : 10.1145/1007352.1007374

M. Crochemore and C. Hancart, Automata for Matching Patterns Handbook of Formal Languages, Linear Modeling: Background and Application, pp.399-462

M. Crochemore, Reducing space for index implementation, Theoretical Computer Science, vol.292, issue.1, pp.185-197, 2003.
DOI : 10.1016/S0304-3975(01)00222-5
URL : https://hal.archives-ouvertes.fr/hal-00619518

C. Epifanio, A. Gabriele, and F. Mignosi, Languages with Mismatches and an Application to Approximate Indexing, Proceedings of the 9th International Conference Developments in Language Theory (DLT05), pp.224-235, 2005.
DOI : 10.1007/11505877_20

C. Epifanio, A. Gabriele, F. Mignosi, A. Restivo, and M. Sciortino, Languages with mismatches. Theoretical Computer Science

A. Gabriele, Combinatorics on words with mismatches, algorithms and data structures for approximate indexing with applications, 2004.

A. Gabriele, F. Mignosi, A. Restivo, and M. Sciortino, Indexing Structures for Approximate String Matching, Proc. of CIAC'03, pp.140-151, 2003.
DOI : 10.1007/3-540-44849-7_20

Z. Galil and R. Giancarlo, Data structures and algorithms for approximate string matching, Journal of Complexity, vol.4, issue.1, pp.33-72, 1988.
DOI : 10.1016/0885-064X(88)90008-8

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

T. N. Huynh, W. K. Hon, T. W. Lam, and W. K. Sung, Approximate string matching using compressed suffix arrays, Proc. of CPM, pp.434-444, 2004.

S. Inenaga, H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa et al., On-line construction of compact directed acyclic word graphs, Discrete Applied Mathematics, vol.146, issue.2, pp.156-179, 2005.
DOI : 10.1016/j.dam.2004.04.012

M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics, vol.17, 1983.
DOI : 10.1017/CBO9780511566097
URL : https://hal.archives-ouvertes.fr/hal-00620607

M. G. Maass and J. Nowak, A new method for approximate indexing and dictionary lookup with one error, Information Processing Letters, vol.96, issue.5, pp.185-191, 2005.
DOI : 10.1016/j.ipl.2005.08.001

M. G. Maass and J. Nowak, Text indexing with errors, Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM 2005), pp.21-32, 2005.

G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys, vol.33, issue.1, pp.31-88, 2001.
DOI : 10.1145/375360.375365