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

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

L. Gravano, P. Ipeirotis, H. Jagadish, N. Koudas, S. Muthukrishnan et al., Approximate String Joins in a Database (Almost) for Free, Proc. of 27th Int'l Conf. on Very Large DataBases, pp.491-500, 2001.

G. Navarro, E. Sutinen, J. Tanninen, and J. Tarhio, Indexing Text with Approximate q-Grams, 11th Annual Symposium on Combinatorial Pattern Matching, pp.1848-350, 2000.
DOI : 10.1007/3-540-45123-4_29

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

E. Sutinen and J. Tarhio, On using q-gram locations in approximate string matching, Third Annual European SymposiumESA 95), 979 of LNCS, pp.327-340, 1995.
DOI : 10.1007/3-540-60313-1_153

M. Brudno, C. B. Do, G. M. Cooper, M. F. Kim, E. Davydov et al., LAGAN and Multi-LAGAN: Efficient Tools for Large-Scale Multiple Alignment of Genomic DNA, Genome Research, vol.13, issue.4, pp.721-731, 2003.
DOI : 10.1101/gr.926603

M. Brudno, M. Chapman, B. Göttgens, S. Batzoglou, and B. Morgenstern, Fast and Sensitive Multiple Alignment of Large Genomic Sequences, BMC Bioinformatics, p.66, 2003.

R. C. Edgar, MUSCLE: multiple sequence alignment with high accuracy and high throughput, Nucleic Acids Research, vol.32, issue.5, pp.1792-1797, 2004.
DOI : 10.1093/nar/gkh340

URL : http://doi.org/10.1093/nar/gkh340

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

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

M. Michael, C. Dieterich, and M. Vingron, SITEBLAST-rapid and sensitive local alignment of genomic sequences employing motif anchors, Bioinformatics, vol.21, issue.9, pp.2093-2094, 2005.
DOI : 10.1093/bioinformatics/bti224

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, pp.77-83, 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

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

S. Burkhardt and J. Karkkainen, One-Gapped q-Gram Filters for Levenshtein Distance, 13th Annual Symposium on Combinatorial Pattern Matching, pp.2373-225, 2002.
DOI : 10.1007/3-540-45452-7_19

G. Kucherov, L. Noé, 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

P. Peterlongo, N. Pisanti, F. Boyer, and M. Sagot, Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array, String Processing and Information Retrieval, pp.3772-179, 2005.
DOI : 10.1007/11575832_20

URL : https://hal.archives-ouvertes.fr/inria-00328129

P. A. Pevzner and M. Waterman, Multiple filtration and approximate pattern matching, Algorithmica, vol.35, issue.10, pp.135-154, 1995.
DOI : 10.1007/BF01188584

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

K. R. Rasmussen, J. Stoye, and E. W. Myers, Efficient q-Gram Filters for Finding All ??-Matches over a Given Length, 9th Annual International Conference, pp.3678-189, 2005.
DOI : 10.1007/11415770_15

J. Kärkkäinen, Computing the Threshold for q-Gram Filters, Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, pp.2368-348, 2002.
DOI : 10.1007/3-540-45471-3_36

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

E. M. Mccreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, vol.23, issue.2, pp.262-272, 1976.
DOI : 10.1145/321941.321946

J. Allali and M. F. Sagot, The at Most k-deep Factor Tree, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00627813

E. Ukkonen, On-line construction of suffix trees, Algorithmica, vol.10, issue.3, pp.249-260, 1995.
DOI : 10.1007/BF01206331

J. C. Na, A. Apostolico, C. S. Iliopoulos, and K. Park, Truncated suffix trees and their application to data compression, Theoretical Computer Science, vol.304, issue.1-3, pp.1-387, 2003.
DOI : 10.1016/S0304-3975(03)00053-7

URL : http://doi.org/10.1016/s0304-3975(03)00053-7

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

J. C. Na and K. Park, Data Compression with Truncated Suffix Trees, Data Compression Conference, 2000.