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, A. Ehrenfeucht, D. Haussler, and R. M. Mcconnell, Linear size finite automata for the set of all subwords of a word -an outline of results, Bulletin of the EATCS, vol.21, pp.12-20, 1983.

A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. 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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms and Java CD-ROM, 2003.

M. Crochemore, Transducers and repetitions, Theoretical Computer Science, vol.45, issue.1, pp.63-86, 1986.
DOI : 10.1016/0304-3975(86)90041-1

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

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

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on strings, 2007.
DOI : 10.1017/CBO9780511546853

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

C. Epifanio, A. Gabriele, and F. Mignosi, Languages with Mismatches and an Application to Approximate Indexing, Proceedings of 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, vol.385, issue.1-3, pp.152-166, 2007.
DOI : 10.1016/j.tcs.2007.06.006

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, Proceedings 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, Proceedings of CPM 2004, pp.434-444
DOI : 10.1016/j.tcs.2005.11.022

URL : http://doi.org/10.1016/j.tcs.2005.11.022

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

G. M. Landau and U. Vishkin, Efficient string matching with k mismatches, Theoretical Computer Science, vol.43, issue.23, pp.239-249, 1986.
DOI : 10.1016/0304-3975(86)90178-7

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

D. Sankoff and J. B. , Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, 1983.

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770