H. Böckenhauer and D. Bongartz, Algorithmic Aspects of Bioinformatics, 2007.

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
DOI : 10.1017/CBO9780511546853
URL : https://hal.archives-ouvertes.fr/hal-00470109

J. Fischer and V. Heun, A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array, LNCS, vol.4614, pp.459-470, 2007.
DOI : 10.1007/978-3-540-74450-4_41

R. Grossi, A. Gupta, and J. S. Vitter, High-order entropy-compressed text indexes, SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp.841-850, 2003.
DOI : 10.1007/978-3-642-40273-9_14

R. Grossi and J. S. Vitter, Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching, SIAM Journal on Computing, vol.35, issue.2, pp.378-407, 2005.
DOI : 10.1137/S0097539702402354

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

G. M. Landau and U. Vishkin, Fast string matching with k differences, Journal of Computer and System Sciences, vol.37, issue.1, pp.63-78, 1988.
DOI : 10.1016/0022-0000(88)90045-1

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

G. Navarro, R. A. Baeza-yates, E. Sutinen, and J. Tarhio, A New Indexing Method for Approximate String Matching, IEEE Data Eng. Bull, vol.24, issue.4, pp.19-27, 2001.
DOI : 10.1007/3-540-48452-3_13