K. B?inda, Laser method on-line. Available at http://brinda.cz/laser-method, 2013.

K. B?inda, Lossless seeds for approximate string matching Master's thesis , FNSPE Czech Technical University in Prague, Czech Republic, 2013.

S. Burkhardt and &. Kärkkäinen, Better Filtering with Gapped q-Grams, Proceedings of the 12th Symposium on Combinatorial Pattern Matching (CPM), Lecture Notes in Computer Science 2089, pp.73-85, 2001.
DOI : 10.1007/3-540-48194-X_6

S. Burkhardt and &. Kärkkäinen, Better Filtering with Gapped q-Grams, Fundamenta Informaticae, vol.56, issue.12, pp.51-70, 2002.
DOI : 10.1007/3-540-48194-X_6

Y. Chen, T. Souaiaia, and &. Ting-chen, PerM: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds, Bioinformatics, vol.25, issue.19, pp.2514-2521, 2009.
DOI : 10.1093/bioinformatics/btp486

L. Egidi and &. Manzini, Spaced Seeds Design Using Perfect Rulers, Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE), Pisa (Italy), pp.32-43, 2011.
DOI : 10.1016/j.jcss.2007.10.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.6614

L. Egidi and &. Manzini, Better spaced seeds using Quadratic Residues, Journal of Computer and System Sciences, vol.79, issue.7, pp.1144-1155, 2013.
DOI : 10.1016/j.jcss.2013.03.002

L. Egidi and &. Manzini, Design and analysis of periodic multiple seeds, Theoretical Computer Science, vol.522, pp.62-76, 2014.
DOI : 10.1016/j.tcs.2013.12.007

L. Egidi and &. Manzini, Spaced Seeds Design Using Perfect Rulers, Fundamenta Informaticae, vol.38, issue.5, pp.187-20310, 2014.
DOI : 10.1016/j.jcss.2007.10.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.6614

M. Farach-colton, G. M. Landau, S. C. Sahinalp, and &. Tsur, Optimal spaced seeds for faster approximate string matching, Journal of Computer and System Sciences, vol.73, issue.7, pp.1035-1044, 2007.
DOI : 10.1016/j.jcss.2007.03.007
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.6730

G. Kucherov, L. Noé, &. Mikhail, and A. 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

H. Li and &. Homer, A survey of sequence alignment algorithms for next-generation sequencing, Briefings in Bioinformatics, vol.11, issue.5, pp.473-83, 2010.
DOI : 10.1093/bib/bbq015

H. Lin, Z. Zhang, M. Q. Zhang, B. Ma, and M. Li, ZOOM! Zillions of oligos mapped, Bioinformatics, vol.24, issue.21, pp.2431-2437, 2008.
DOI : 10.1093/bioinformatics/btn416

D. Lind and &. Marcus, An Introduction to Symbolic Dynamics and Coding, pp.10-1017, 1995.
DOI : 10.1017/CBO9780511626302

B. Ma, J. Tromp, and &. 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

B. Saul, &. Needleman, D. Christian, and . Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, Journal of Molecular Biology, vol.4870, issue.3, pp.443-45310, 1970.

F. Nicolas and &. Rivals, Hardness of Optimal Spaced Seed Design, Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM), pp.144-15510, 1007.
DOI : 10.1007/11496656_13
URL : https://hal.archives-ouvertes.fr/lirmm-00106448

F. Nicolas and &. Rivals, Hardness of optimal spaced seed design, Journal of Computer and System Sciences, vol.74, issue.5, pp.831-849, 2008.
DOI : 10.1016/j.jcss.2007.10.001
URL : https://hal.archives-ouvertes.fr/lirmm-00106448

L. Noé and &. Gregory-kucherov, YASS: enhancing the sensitivity of DNA similarity search, Nucleic Acids Research, vol.33, issue.Web Server, pp.540-543, 2005.
DOI : 10.1093/nar/gki478

P. Ribeca, Short-Read Mapping, Bioinformatics for High Throughput Sequencing, pp.107-125, 2012.
DOI : 10.1007/978-1-4614-0782-9_7

F. Temple, &. Smith, S. Michael, and . Waterman, Identification of common molecular subsequences, Journal of molecular biology, vol.147, issue.181, pp.195-710, 1981.