D. Adjeroh, T. Bell, and A. Mukherjee, The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching, 2008.
DOI : 10.1007/978-0-387-78909-5

A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

S. F. Altschul, W. Gish, W. Miller, E. W. Myers, and D. J. Lipman, Basic local alignment search tool, Journal of Molecular Biology, vol.215, issue.3, pp.403-410, 1990.
DOI : 10.1016/S0022-2836(05)80360-2

C. Barton, M. Giraud, C. Iliopoulos, T. Lecroq, L. Mouchard et al., Querying highly similar sequences, International Journal of Computational Biology and Drug Design, vol.6, issue.1/2, p.2012
DOI : 10.1504/IJCBDD.2013.052206
URL : https://hal.archives-ouvertes.fr/hal-01523079

F. Claude, A. Farina, M. A. Martínez-prieto, and G. Navarro, Compressed q-Gram Indexing for Highly Repetitive Biological Sequences, 2010 IEEE International Conference on BioInformatics and BioEngineering, pp.86-91, 2010.
DOI : 10.1109/BIBE.2010.22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.162.2851

S. Dori and G. M. Landau, Construction of Aho Corasick automaton in linear time for integer alphabets, Information Processing Letters, vol.98, issue.2, pp.66-72, 2006.
DOI : 10.1016/j.ipl.2005.11.019

P. Ferragina and G. Manzini, Indexing compressed text, Journal of the ACM, vol.52, issue.4, pp.552-581, 2005.
DOI : 10.1145/1082036.1082039

K. Frousios, C. S. Iliopoulos, L. Mouchard, S. P. Pissis, and G. Tischler, REAL, Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, BCB '10, pp.154-159, 2010.
DOI : 10.1145/1854776.1854801
URL : https://hal.archives-ouvertes.fr/hal-00480850

S. Huang, T. W. Lam, W. K. Sung, S. L. Tam, and S. M. Yiu, Indexing Similar DNA Sequences, Proceedings of the 6th international conference on Algorithmic aspects in information and management, AAIM'10, pp.180-190, 2010.
DOI : 10.1007/978-3-642-14355-7_19

J. Kärkkäinen, P. Sanders, and S. Burkhardt, Linear work suffix array construction, Journal of the ACM, vol.53, issue.6, pp.918-936, 2006.
DOI : 10.1145/1217856.1217858

R. Lippert, Space-Efficient Whole Genome Comparisons with Burrows???Wheeler Transforms, Journal of Computational Biology, vol.12, issue.4, pp.407-415, 2005.
DOI : 10.1089/cmb.2005.12.407

W. R. Pearson, [5] Rapid and sensitive sequence comparison with FASTP and FASTA, Methods in enzymology, vol.183, pp.63-98, 1990.
DOI : 10.1016/0076-6879(90)83007-V

S. J. Puglisi, W. F. Smyth, and A. H. Turpin, A taxonomy of suffix array construction algorithms, ACM Computing Surveys, vol.39, issue.2, 2007.
DOI : 10.1145/1242471.1242472

C. Xia, C. L. Shuai, and K. H. Anthony, Indexing DNA sequences using q-grams, Proceedings of the 10th International Conference on Database Systems for Advanced Applications, pp.4-16, 2005.