S. Needleman and C. Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, Journal of Molecular Biology, vol.48, issue.3, pp.443-53, 1970.
DOI : 10.1016/0022-2836(70)90057-4

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

O. Gotoh, An improved algorithm for matching biological sequences, Journal of Molecular Biology, vol.162, issue.3, pp.705-708, 1982.
DOI : 10.1016/0022-2836(82)90398-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.204.203

W. R. Pearson and D. J. Lipman, Improved tools for biological sequence comparison., Proceedings of the National Academy of Sciences, vol.85, issue.8, pp.2444-2452, 1988.
DOI : 10.1073/pnas.85.8.2444
URL : https://www.ncbi.nlm.nih.gov/pmc/articles/PMC280013/pdf

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

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

S. F. Altschul, T. L. Madden, A. A. Schffer, 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-402, 1997.
DOI : 10.1093/nar/25.17.3389

M. Li, B. Ma, D. Kisman, and J. Tromp, PatternHunterII : Highly Sensitive and Fast Homology Search Bioinformatics, pp.18440-445, 2002.

W. J. Kent, BLAT: The BLAST-Like Alignment Too, Genome Research, vol.12, issue.4, 2002.

S. Schwartz, W. 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

L. Noe and G. Kucherov, YASS: enhancing the sensitivity of DNA similarity search, Nucleic Acids Research, vol.33, issue.Web Server, 2005.
DOI : 10.1093/nar/gki478
URL : https://hal.archives-ouvertes.fr/inria-00100004

G. Kucherov, L. No, and M. Roytberg, A UNIFYING FRAMEWORK FOR SEED SENSITIVITY AND ITS APPLICATION TO SUBSET SEEDS, Journal of Bioinformatics and Computational Biology, vol.04, issue.02, 2006.
DOI : 10.1142/S0219720006001977
URL : https://hal.archives-ouvertes.fr/inria-00001164

J. Xu, D. Brown, M. Li, and B. Ma, Optimizing Multiple Spaced Seeds for Homology Search, Journal of Computational Biology, vol.13, issue.7, pp.1355-1358, 2006.
DOI : 10.1089/cmb.2006.13.1355
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.2079

]. A. Morgulis, E. M. Gertz, A. A. Schaffer, and R. Agarwala, A Fast and Symmetric DUST Implementation to Mask Low-Complexity DNA Sequences, Journal of Computational Biology, vol.13, issue.5, pp.1028-1040, 2006.
DOI : 10.1089/cmb.2006.13.1028

P. Peterlongo, L. Noe, D. Lavenier, G. Georges, J. Jacques et al., Protein similarity search with subset seeds on a dedicated reconfigurable hardware Workshop on, Parallel Computational Biology, 2007.