T. Beller, S. Gog, E. Ohlebusch, and T. Schnattinger, Computing the longest common prefix array based on the Burrows???Wheeler transform, Journal of Discrete Algorithms, vol.18, pp.22-31, 2013.
DOI : 10.1016/j.jda.2012.07.007

R. Chikhi and P. Medvedev, Informed and automated k-mer size selection for genome assembly, Bioinformatics, vol.30, issue.1, p.337, 2014.
DOI : 10.1093/bioinformatics/btt310
URL : https://hal.archives-ouvertes.fr/hal-01477511

H. Devillers and S. Schbath, Separating Significant Matches from Spurious Matches in DNA Sequences, Journal of Computational Biology, vol.19, issue.1, pp.1-12, 2012.
DOI : 10.1089/cmb.2011.0070

R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, Extendible hashing---a fast access method for dynamic files, ACM Transactions on Database Systems, vol.4, issue.3, pp.315-344, 1979.
DOI : 10.1145/320083.320092

R. Fagin, J. Nievergelt, N. Pippenger, and R. Strong, Extendible hashing---a fast access method for dynamic files, ACM Transactions on Database Systems, vol.4, issue.3, pp.315-344, 1979.
DOI : 10.1145/320083.320092

Z. Gu, H. Wang, A. Nekrutenko, L. , and W. H. , Densities, length proportions, and other distribu- 347 tional features of repetitive sequences in the human genome estimated from 430 megabases of genomic 348 sequence, Gene, vol.259, pp.1-2, 2000.

A. L. Hartman, C. Norais, J. H. Badger, S. Delmas, S. Haldenby et al., The 350 complete genome sequence of haloferax volcanii ds2, a model archaeon, PLoS One, vol.5, 2010.

P. Jacquet and W. Szpankowski, Autocorrelation on words and its applications, Journal of Combinatorial Theory, Series A, vol.66, issue.2, pp.237-2690097, 1994.
DOI : 10.1016/0097-3165(94)90065-5
URL : https://hal.archives-ouvertes.fr/inria-00075453

S. Janson, S. Lonardi, and W. Szpankowski, On the average sequence complexity, Data Compression Conference, 2004. Proceedings. DCC 2004, pp.74-88, 2004.
DOI : 10.1109/DCC.2004.1281518

D. Knuth, The art of computer programming, volume two, seminumerical algorithms, p.360, 1998.

A. Magner, C. Knessl, and W. Szpankowski, Expected External Profile of PATRICIA Tries, 361 Proceedings of the Meeting on Analytic Algorithmics and Combinatorics (Society for Industrial and 362, 2014.
DOI : 10.1137/1.9781611973204.2

H. Mahmoud, Evolution of Random Search Trees, 1992.

U. Manber and G. Myers, 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

P. Nicodème, Average profiles, from tries to suffix-trees, 2005.

G. Rizk, D. Lavenier, C. , and R. , DSK: k-mer counting with very low memory usage, Bioinformatics, vol.29, issue.5, p.372, 2013.
DOI : 10.1093/bioinformatics/btt020
URL : https://hal.archives-ouvertes.fr/hal-00778473

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770

T. J. Treangen and S. L. Salzberg, Repetitive dna and next-generation sequencing: computational 377 challenges and solutions, Nat Rev Genet, vol.13, issue.1, pp.36-4610, 2012.

E. Ukkonen, On-line construction of suffix trees, Algorithmica, pp.249-260, 1995.