S. F. Altschul, W. Gish, W. Miller, E. M. 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

S. F. Altschul, T. L. Madden, A. A. Schaffer, J. Zhang, Z. Zhang et al., Gapped BLAST and PSI-BLAST: a new generation of protein database search programs, Nucleic Acids Research, vol.25, issue.17, pp.3389-3402, 1997.
DOI : 10.1093/nar/25.17.3389

S. Burkhardt, A. Crauser, P. Ferragina, H. P. Lenhof, and M. Vingron, -gram based database searching using a suffix array (QUASAR), Proceedings of the third annual international conference on Computational molecular biology , RECOMB '99, 1999.
DOI : 10.1145/299432.299460
URL : https://hal.archives-ouvertes.fr/hal-00857953

S. Burkhardt and J. Karkkainen, Better Filtering with Gapped q-Grams, 12th Annual Symposium on Combinatorial Pattern Matching, pp.51-70, 2001.
DOI : 10.1007/3-540-48194-X_6

A. M. Carvalho, A. T. Freitas, A. L. Oliveira, and M. Sagot, A HIGHLY SCALABLE ALGORITHM FOR THE EXTRACTION OF CIS-REGULATORY REGIONS, Proceedings of the 3rd Asia-Pacific Bioinformatics Conference, pp.273-282, 2005.
DOI : 10.1142/9781860947322_0027
URL : https://hal.archives-ouvertes.fr/hal-00427723

H. Tettelin, Complete Genome Sequence of Neisseria meningitidis Serogroup B Strain MC58, Science, vol.287, issue.5459, pp.1809-1815, 2000.
DOI : 10.1126/science.287.5459.1809

M. C. Frith, U. Hansen, J. L. Spouge, and Z. Weng, Finding functional sequence elements by multiple local alignment, Nucleic Acids Research, vol.32, issue.1, pp.189-200, 2004.
DOI : 10.1093/nar/gkh169

C. S. Iliopoulos, J. Mchugh, P. Peterlongo, N. Pisanti, W. Rytter et al., A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS, International Journal of Foundations of Computer Science, vol.16, issue.06, pp.1145-1154, 2005.
DOI : 10.1142/S0129054105003716
URL : https://hal.archives-ouvertes.fr/inria-00328042

J. Kärkkäinen and P. Sanders, Simple Linear Work Suffix Array Construction, International Colloquium on Automata, Languages and Programming (ICALP 2003), 2719 of LNCS, pp.943-955, 2003.
DOI : 10.1007/3-540-45061-0_73

T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park, Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications, 12th Annual Symposium on Combinatorial Pattern Matching, pp.2089-181, 2001.
DOI : 10.1007/3-540-48194-X_17

D. K. Kim, J. S. Sim, H. Park, and K. Park, Linear-Time Construction of Suffix Arrays, 14th Annual Symposium on Combinatorial Pattern Matching, pp.2676-186, 2003.
DOI : 10.1007/3-540-44888-8_14

P. Ko and S. Aluru, Space Efficient Linear Time Construction of Suffix Arrays, 14th Annual Symposium on Combinatorial Pattern Matching, pp.2676-203, 2003.

R. Kolpakov, G. Bana, and G. Kucherov, mreps: efficient and flexible detection of tandem repeats in DNA, Nucleic Acids Research, vol.31, issue.13, pp.313672-3678, 2003.
DOI : 10.1093/nar/gkg617
URL : https://hal.archives-ouvertes.fr/inria-00099597

G. Kucherov, L. Noe, and M. Roytberg, Multiseed Lossless Filtration, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.2, issue.1, pp.51-61, 2005.
DOI : 10.1109/TCBB.2005.12
URL : https://hal.archives-ouvertes.fr/inria-00354810

M. Li and B. Ma, PATTERNHUNTER II: HIGHLY SENSITIVE AND FAST HOMOLOGY SEARCH, Journal of Bioinformatics and Computational Biology, vol.02, issue.03, pp.164-175, 2003.
DOI : 10.1142/S0219720004000661

D. J. Lipman and W. R. Pearson, Rapid and sensitive protein similarity searches, Science, vol.227, issue.4693, pp.1435-1441, 1985.
DOI : 10.1126/science.2983426

B. Ma, J. Tromp, and M. Li, PatternHunter: faster and more sensitive homology search, Bioinformatics, vol.18, issue.3, pp.440-445, 2002.
DOI : 10.1093/bioinformatics/18.3.440

U. Manber and G. Meyers, Suffix Arrays: A New Method for On-Line String Searches, SIAM Journal on Computing, vol.22, issue.5, pp.935-948, 1993.
DOI : 10.1137/0222058

L. Marsan and M. Sagot, Algorithms for Extracting Structured Motifs Using a Suffix Tree with an Application to Promoter and Regulatory Site Consensus Identification, Journal of Computational Biology, vol.7, issue.3-4, pp.345-360, 2000.
DOI : 10.1089/106652700750050826

G. Navarro, E. Sutinen, and J. Tarhio, Indexing text with approximate q-grams, Journal of Discrete Algorithms, vol.3, issue.2-4, pp.157-175, 2005.
DOI : 10.1016/j.jda.2004.08.003

I. Ovcharenko, G. G. Loots, B. M. Giardine, M. Hou, J. Ma et al., Mulan: Multiple-sequence local alignment and visualization for studying function and evolution, Genome Research, vol.15, issue.1, pp.184-194, 2005.
DOI : 10.1101/gr.3007205

P. Peterlongo, N. Pisanti, F. Boyer, and M. Sagot, Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bifactor Array, String Processing and Information Retrieval, pp.3772-179, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00328129

K. R. Rasmussen, J. Stoye, and E. W. Myers, Efficient q-Gram Filters for Finding All ?-Matches Over a Given Length, RECOMB'05, pp.189-203, 2005.