A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, 1974.

]. A. Apo85 and . Apostolico, The Myriad Virtues of Suffix Trees, Combinatorial Algorithms on Words, pp.3-12, 1985.

S. Burkhardt, A. Crauser, P. Ferragina, H. Lenhof, E. Rivals et al., Q-gram based database searching using a suffix array (QUASAR) Some applications of the Chen-Stein method for proving Poisson convergence, Third Annual International Conference on Computational Molecular Biology, pp.77-8374, 1989.

]. L. Che75 and . Chen, Poisson approximation for dependent trials, Annals of Probability, vol.3, pp.534-545, 1975.

M. [. Chomsky and . Schützenberger, The algebraic theory of context-free languages, Computer Programming and Formal Languages, pp.118-161, 1963.

J. Clement, B. Vallée, and P. Flajolet, Dynamical sources in information theory: A general analysis of trie structures, Algorithmica, vol.11, issue.4, pp.307-369, 1946.
DOI : 10.1007/BF02679623
URL : https://hal.archives-ouvertes.fr/inria-00073027

M. Drmota, D. Gardy, and B. Gittenberger, A unified presentation of some urn models, Algorithmica, vol.144, issue.1???2, pp.120-147, 2001.
DOI : 10.1007/BF02679616

J. Fayolle, Paramètres des arbres suffixes dans le cas de sources simples, 2002.

J. [. Flajolet, H. Gabarró, and . Pekari, Analytic urns. submitted, 2003.
DOI : 10.1214/009117905000000026

P. Flajolet, L. Danì-ele-gardy, and . Thimonnier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Applied Mathematics, vol.39, issue.3, pp.207-229, 1992.
DOI : 10.1016/0166-218X(92)90177-C
URL : https://hal.archives-ouvertes.fr/inria-00075832

P. Flajolet, P. Kirschenhofer, and R. F. Tichy, Deviations from uniformity in random strings. Probability Theory and Related Fields, pp.139-150, 1988.

R. [. Flajolet and . Sedgewick, Analytic combinatorics
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

G. Gonnet and R. Baeza-yates, Hanbook of Algorithms and Data Structures, 1991.

A. [. Guibas and . Odlyzko, Periods in strings Urn Models and their Applications, J. Combin. Theory, issue.30, pp.19-43, 1977.

P. Jacquet and W. Szpankowski, Analysis of digital tries with Markovian dependency, IEEE Transactions on Information Theory, vol.37, issue.5, pp.1470-1475, 1991.
DOI : 10.1109/18.133271

P. Jacquet and W. Szpankowsli, What can we learn about suffix trees from independent tries?, Workshop on Algorithms and Data Structures, pp.228-229, 1991.
DOI : 10.1007/BFb0028265

P. Jacquet and W. Szpankowsli, Autocorrelation on words and its applications Analysis of Suffix Trees by String Ruler Approach, J. Combin. Theory, A, issue.66, pp.237-269, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00075453

P. Jokinen and E. Ukkonen, Two algorithms for approxmate string matching in static texts, In Proceedings Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.520, pp.240-248, 1991.
DOI : 10.1007/3-540-54345-7_67

]. D. Knu73 and . Knuth, The Art of Computer Programming. Sorting and Searching, 1973.

B. [. Kolchin, Sevast'yanov, and V. Chistyakov. Random Allocations, 1978.

]. P. Nic00 and . Nicodème, Regexpcount, a symbolic package for counting problems on regular expressions and words, German Conference on Bioinformatics GCB, pp.63-73, 2000.

P. Nicodème, B. Salvy, and P. Flajolet, Motif statistics, Extended version of an article published in the proceedings of 7th Annual European Symposium on Algorithms ESA'99, pp.593-618, 1999.
DOI : 10.1016/S0304-3975(01)00264-X

E. [. Rahmann and . Rivals, Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts, 11th Symposium on Combinatorial Pattern Matching, pp.375-387, 2000.
DOI : 10.1007/3-540-45123-4_31

E. [. Rahmann and . Rivals, The number of missing words in random texts, Combinatorics, Probability and Computing, vol.12, pp.73-87, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269581

W. [. Régnier and . Szpankowski, On pattern frequency occurrences in a Markovian sequence, Proceedings of IEEE International Symposium on Information Theory, pp.631-649, 1998.
DOI : 10.1109/ISIT.1997.613234

]. R. Sed88 and . Sedgewick, Algorithms in C: Fundamentals, Data Structures, 1988.

R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, 1996.

W. Szpankowski and E. Sutinen, On the collapse of q-gram filtration, Proc. Int. Conf FUN with Algorithms, pp.178-193, 1998.

]. C. Ste70 and . Stein, A bound for the error in the normal approximation to the distribution of a sum of dependent random variables, 6th Berkeley Symp. Math. Statis. Prob. 2, pp.583-602, 1970.

W. Szpankowski, A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors, SIAM Journal on Computing, vol.22, issue.6, pp.1176-1198, 1993.
DOI : 10.1137/0222070

]. W. Szp01 and . Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.

]. P. Wei73 and . Weiner, Linear Pattern Matching Algorithms, 14-th Annual Symposium on Switching and Automata Theory, pp.1-11, 1973.