S. Altschul, W. Gish, W. Miller, E. Myers, and D. 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. Altschul, T. Madden, A. Schäffer, 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

B. Brejova, D. Brown, and T. Vinar, Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions, Proceedings of the 14th Symposium on Combinatorial Pattern Matching, pp.42-54, 2003.
DOI : 10.1007/3-540-44888-8_4

B. Brejova, D. Brown, and T. Vinar, Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specificity, Proceedings of the 3rd International Workshop in Algorithms in Bioinformatics (WABI), Budapest (Hungary), volume 2812 of Lecture Notes in Computer Science, 2003.
DOI : 10.1007/978-3-540-39763-2_4

J. Buhler, Efficient large-scale sequence comparison by locality-sensitive hashing, Bioinformatics, vol.17, issue.5, pp.419-428, 2001.
DOI : 10.1093/bioinformatics/17.5.419
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.1356

J. Buhler, U. Keich, and Y. Sun, Designing seeds for similarity search in genomic DNA, Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB), pp.67-75, 2003.

S. Burkhardt and J. Kärkkäinen, Better Filtering with Gapped q-Grams, Preliminary version in Combinatorial Pattern Matching, pp.51-70, 2001.
DOI : 10.1007/3-540-48194-X_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.5942

A. Califano and I. Rigoutsos, FLASH: a fast look-up algorithm for string homology, Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, pp.56-64, 1993.
DOI : 10.1109/CVPR.1993.341106

K. Choi, F. Zeng, and L. Zhang, Good spaced seeds for homology search, Bioinformatics, vol.20, issue.7, 2003.
DOI : 10.1093/bioinformatics/bth037

K. Choi and L. Zhang, Sensitivity analysis and efficient method for identifying optimal spaced seeds, Journal of Computer and System Sciences, vol.68, issue.1, 2003.
DOI : 10.1016/j.jcss.2003.04.002
URL : http://doi.org/10.1016/j.jcss.2003.04.002

A. Denise, G??n??ration al??atoire uniforme de mots de langages rationnels, Theoretical Computer Science, vol.159, issue.1, pp.43-63, 1996.
DOI : 10.1016/0304-3975(95)00200-6
URL : http://doi.org/10.1016/0304-3975(95)00200-6

T. Hickey and J. Cohen, Uniform Random Generation of Strings in a Context-Free Language, SIAM Journal on Computing, vol.12, issue.4, pp.645-655, 1983.
DOI : 10.1137/0212044

S. Karlin and S. , Applications and statistics for multiple high-scoring segments in molecular sequences., Proceedings of the National Academy of Sciences, vol.90, issue.12, pp.5873-5877, 1993.
DOI : 10.1073/pnas.90.12.5873

S. Karlin and V. Brendel, Chance and statistical significance in protein and DNA sequence analysis, Science, vol.257, issue.5066, pp.39-49, 1992.
DOI : 10.1126/science.1621093

U. Keich, M. Li, B. Ma, and J. Tromp, On spaced seeds for similarity search, Discrete Applied Mathematics, vol.138, issue.3, 2002.
DOI : 10.1016/S0166-218X(03)00382-2
URL : http://doi.org/10.1016/s0166-218x(03)00382-2

W. J. Kent, BLAT---The BLAST-Like Alignment Tool, Genome Research, vol.12, issue.4, pp.656-664, 2002.
DOI : 10.1101/gr.229202

D. Lipman and W. Pearson, Improved tools for biological sequence comparison, Proc. Natl. Acad. Sci. USA, pp.2444-2448, 1988.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.8001

L. Noé and G. Kucherov, YASS: Similarity search in DNA sequences, 2003.

P. Pevzner and M. Waterman, Multiple filtration and approximate pattern matching, Preliminary version in Combinatorial Pattern Matching, pp.135-154, 1993.
DOI : 10.1007/BF01188584
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.4723

W. Ruzzo and M. Tompa, A linear time algorithm for finding all maximal scoring subsequences, Seventh International Conference on Intelligent Systems for Molecular Biology (ISMB), pp.234-241, 1999.

S. Schwartz, J. Kent, A. Smit, Z. Zhang, R. Baertsch et al., Human-Mouse Alignments with BLASTZ, Genome Research, vol.13, issue.1, pp.103-107, 2003.
DOI : 10.1101/gr.809403
URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC430961

T. Smith and M. Waterman, Identification of common molecular subsequences, Journal of Molecular Biology, vol.147, issue.1, pp.195-197, 1981.
DOI : 10.1016/0022-2836(81)90087-5

H. Wilf, A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects, Advances in Mathematics, vol.24, issue.2, pp.281-291, 1977.
DOI : 10.1016/S0001-8708(77)80046-7