A. Apostolico, G. , and R. , The Boyer???Moore???Galil String Searching Strategies Revisited, SIAM Journal on Computing, vol.15, issue.1, pp.98-105, 1986.
DOI : 10.1137/0215007

M. B. Baer, Coding for General Penalties, 2003.

R. Baeza-yates, C. Choffrut, G. Gonnet, and . Boyer-moore-automata, On Boyer-Moore automata, Algorithmica, vol.8, issue.1, pp.268-292, 1994.
DOI : 10.1007/BF01185428

H. Bannai, S. Inenaga, A. Shinohara, and M. Takeda, Inferring Strings from Graphs and Arrays, In Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.2747, pp.208-217, 2003.
DOI : 10.1007/978-3-540-45138-9_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.684

F. Bassino, M. Béal, and D. Perrin, A Finite State Version of the Kraft--McMillan Theorem, SIAM Journal on Computing, vol.30, issue.4, pp.1211-1230, 2000.
DOI : 10.1137/S0097539798343908
URL : https://hal.archives-ouvertes.fr/hal-00619334

F. Bassino, L. Giambruno, and C. Nicaud, THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES, International Journal of Foundations of Computer Science, vol.21, issue.04, pp.495-516, 2010.
DOI : 10.1142/S0129054110007398
URL : https://hal.archives-ouvertes.fr/hal-00452751

T. Bedford, M. Keane, and C. Series, Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces, 1991.

E. A. Bender and F. Kochman, The Distribution of Subword Counts is Usually Normal, European Journal of Combinatorics, vol.14, issue.4, pp.265-275, 1993.
DOI : 10.1006/eujc.1993.1030

J. Bentley and R. Sedgewick, Fast algorithms for sorting and searching strings, Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.360-369, 1997.

J. Berstel and L. Boasson, The set of Lyndon words is not contextfree, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, vol.63, pp.139-140, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00619462

J. Berstel and D. Perrin, Theory of codes, 1985.
URL : https://hal.archives-ouvertes.fr/hal-00619780

J. Berstel and D. Perrin, Algorithms on words, Applied combinatorics on words of Encyclopedia of Mathematics and its Applications, pp.1-105, 2005.

J. Berstel and M. Pocchiola, Average cost of Duval's algorithm for generating Lyndon words, Theoretical Computer Science, vol.132, issue.1-2, pp.1-2, 1994.
DOI : 10.1016/0304-3975(94)00013-1

J. Bourdon and B. Vallée, Generalized Pattern Matching Statistics, Proc. Colloquium on Mathematics and Computer Science : Algorithms, Trees, Combinatorics and Probabilities, pp.249-265, 2002.
DOI : 10.1007/978-3-0348-8211-8_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.7805

J. Bourdon and B. Vallée, Pattern Matching Statistics on Correlated Sources, Proc. of LATIN'06, pp.224-237, 2006.
DOI : 10.1007/11682462_24
URL : https://hal.archives-ouvertes.fr/hal-00461975

R. S. Boyer, M. , and J. S. , A fast string searching algorithm, Communications of the ACM, vol.20, issue.10, pp.762-772, 1977.
DOI : 10.1145/359842.359859

N. Broutin and L. Devroye, An Analysis of the Height of Tries with Random Weights on the Edges, Combinatorics, Probability and Computing, vol.7, issue.02, pp.161-202, 2008.
DOI : 10.1214/aoms/1177729330

P. Chassaing, Z. Azad, and E. , Asymptotic behavior of some factorizations of random words
URL : https://hal.archives-ouvertes.fr/hal-00475379

K. Chen, R. Fox, L. , and R. , Free differential calculus IV : The quotient groups of the lower central series, Ann. Math, vol.58, pp.81-95, 1958.

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

H. A. Clampett, Randomized binary searching with tree structures, Communications of the ACM, vol.7, issue.3, pp.163-165, 1964.
DOI : 10.1145/363958.363987

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
DOI : 10.1017/CBO9780511546853
URL : https://hal.archives-ouvertes.fr/hal-00470109

M. Crochemore and L. Ilie, Computing Longest Previous Factor in linear time and applications, Information Processing Letters, vol.106, issue.2, pp.75-80, 2008.
DOI : 10.1016/j.ipl.2007.10.006
URL : https://hal.archives-ouvertes.fr/hal-00619691

M. Crochemore, L. Ilie, and W. Smyth, A Simple Algorithm for Computing the Lempel Ziv Factorization, Data Compression Conference (dcc 2008), pp.482-488, 2008.
DOI : 10.1109/DCC.2008.36
URL : https://hal.archives-ouvertes.fr/hal-00620138

M. Crochemore and T. Lecroq, Tight bounds on the complexity of the Apostolico-Giancarlo algorithm, Information Processing Letters, vol.63, issue.4, pp.195-203, 1997.
DOI : 10.1016/S0020-0190(97)00107-5
URL : https://hal.archives-ouvertes.fr/hal-00619574

M. Crochemore and W. Rytter, Jewels of Stringology, p.310, 2002.
DOI : 10.1142/4838
URL : https://hal.archives-ouvertes.fr/hal-00619795

L. Devroye, A probabilistic analysis of the height of tries and of the complexity of triesort, Acta Informatica, vol.11, issue.3, pp.229-237, 1984.
DOI : 10.1007/BF00264248

L. Devroye, Probabilistic Methods for Algorithmic Discrete Mathematics, ch. Branching Processes and Their Applications in the Analysis of Tree Structures and Tree Algorithms, 1998.

J. Duval, Factorizing words over an ordered alphabet, Journal of Algorithms, vol.4, issue.4, pp.363-381, 1983.
DOI : 10.1016/0196-6774(83)90017-2

J. Duval, T. Lecroq, and A. Lefebvre, Border array on bounded alphabet, Journal of Automata, Languages and Combinatorics, vol.10, issue.1, pp.51-60, 2005.

J. Duval, T. Lecroq, and A. Lefebvre, Efficient validation and construction of border arrays, Proceedings of 11th Mons Days of Theoretical Computer Science, pp.179-189, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00516728

W. Feller, An Introduction to Probability Theory and Its Applications, 1971.

J. A. Fill and S. Janson, The number of bit comparisons used by Quicksort: an average-case analysis, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA04), pp.293-300, 2001.
DOI : 10.1214/EJP.v17-1812

J. A. Fill and T. Nakama, Analysis of the Expected Number of Bit Comparisons Required by Quickselect, Algorithmica, vol.25, issue.3, pp.730-769, 2010.
DOI : 10.1007/s00453-009-9294-3

P. Flajolet, X. Gourdon, and D. Panario, The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields, Journal of Algorithms, vol.40, issue.1, pp.37-81, 2001.
DOI : 10.1006/jagm.2001.1158
URL : https://hal.archives-ouvertes.fr/inria-00073319

P. Flajolet, M. Roux, and B. Vallée, Digital trees and memoryless sources : from arithmetics to analysis, DMTCS Proceedings, vol.0, p.1, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01083405

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

F. Franek, S. Gao, W. Lu, P. J. Ryan, W. F. Smyth et al., Verifying a Border array in linear time, J. Combinatorial Math. and Combinatorial Computing, vol.42, pp.223-236, 2002.

H. Fredricksen and J. Maiorana, Necklaces of beads in k colors and k-ary de Bruijn sequences. Discrete Math, pp.207-210, 1978.

R. G. Gallager and D. C. Voorhis, Optimal source codes for geometrically distributed integer alphabets (Corresp.), IEEE Transactions on Information Theory, vol.21, issue.2, pp.228-230, 1975.
DOI : 10.1109/TIT.1975.1055357

M. J. Golin, M. , and K. K. , Algorithms for constructing infinite huffman codes, 2004.

S. Golomb, Irreducible polynomials, synchronizing codes, primitive necklaces and cyclotomic algebra, Proc. Conf Combinatorial Math. and Its Appl. (Chapel Hill, pp.358-370, 1969.

S. W. Golomb, Run-length encodings (Corresp.), IEEE Transactions on Information Theory, vol.12, issue.3, pp.399-401, 1966.
DOI : 10.1109/TIT.1966.1053907

S. W. Golomb, Sources which maximize the choice of a Huffman coding tree, Information and Control, vol.45, issue.3, pp.263-272, 1980.
DOI : 10.1016/S0019-9958(80)90648-8

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

I. Goulden, J. , and D. , An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences, Journal of the London Mathematical Society, vol.2, issue.3, pp.20-567, 1979.
DOI : 10.1112/jlms/s2-20.3.567

I. P. Goulden, J. , and D. M. , Combinatorial enumeration, 1983.

P. J. Grabner and H. Prodinger, On a Constant Arising in the Analysis of Bit Comparisons in Quickselect, Quaestiones Mathematicae, vol.31, issue.4, pp.303-306, 2008.
DOI : 10.2989/QM.2008.31.4.1.605

L. Guibas and A. Odlyzko, Periods in strings, Journal of Combinatorial Theory, Series A, vol.30, issue.1, pp.19-42, 1981.
DOI : 10.1016/0097-3165(81)90038-8

L. Guibas and A. Odlyzko, Strings overlaps, pattern matching, and non-transitive games, J. Combin. Theory A, pp.30-108, 1981.
DOI : 10.1016/0097-3165(81)90005-4
URL : http://doi.org/10.1016/0097-3165(81)90005-4

D. Gusfield, Algorithms on strings, trees and sequences : computer science and computational biology, 1997.
DOI : 10.1017/CBO9780511574931

D. A. Huffman, A method for the construction of minimumredundancy codes, Proceedings of the IRE, pp.1098-1101, 1952.

I. , T. Inenaga, S. Bannai, H. Takeda, and M. , Verifying and enumerating parameterized border arrays, Theoretical Computer Science, p.0, 2011.

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

P. Jacquet and W. Szpankowski, Analytic approach to pattern matching of Encyclopedia of Mathematics and its Applications, pp.329-398, 2005.

A. Kato, T. S. Han, and H. Nagaoka, Huffman coding with an infinite alphabet, IEEE Transactions on Information Theory, vol.42, issue.3, pp.977-984, 1996.
DOI : 10.1109/18.490559

D. E. Knuth, The average time for carry propagation, Indagationes Mathematicae, vol.40, pp.238-242, 1978.

D. E. Knuth, The Art of Computer Programming Sorting and Searching, 1998.

D. E. Knuth, J. H. Jr, and V. R. Pratt, Fast Pattern Matching in Strings, SIAM Journal on Computing, vol.6, issue.2, pp.323-350, 1977.
DOI : 10.1137/0206024

Y. Kong, Extension of Goulden???Jackson cluster method on pattern occurrences in random sequences and comparison with R??gnier???Szpankowski method, Journal of Difference Equations and Applications, vol.11, issue.15, pp.1265-1271, 2005.
DOI : 10.1137/1023004

T. Linder, V. Tarokh, and K. Zeger, Existence of optimal prefix codes for infinite source alphabets, IEEE Transactions on Information Theory, vol.43, issue.6, pp.2026-2028, 1997.
DOI : 10.1109/18.641571

. Lothaire, Combinatorics on Words, 1983.
DOI : 10.1017/CBO9780511566097
URL : https://hal.archives-ouvertes.fr/hal-00620607

M. Lothaire, Applied combinatorics on words of Encyclopedia of Mathematics and its Applications, 2005.

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

R. Marchand and E. Azad, Limit Law of the Length of the Standard Right Factor of a Lyndon Word, Combinatorics, Probability and Computing, vol.16, issue.03, pp.417-434, 2007.
DOI : 10.1017/S0963548306008315

C. Martínez, R. , and S. , Randomized binary search trees, Journal of the ACM, vol.45, issue.2, pp.288-323, 1998.
DOI : 10.1145/274787.274812

N. Merhav, G. Seroussi, and M. J. Weinberger, Optimal prefix codes for sources with two-sided geometric distributions, IEEE Transactions on Information Theory, vol.46, issue.1, pp.229-236, 2000.
DOI : 10.1109/18.817513

P. Nicodème, Regexpcount, a symbolic package for counting problems on regular expressions and words, Fundamenta Informaticae, vol.56, issue.12, pp.71-88, 2003.

P. Nicodème, B. Salvy, and P. Flajolet, Motif Statistics, Algorithms , ESA'99, pp.194-211, 1999.
DOI : 10.1007/3-540-48481-7_18

P. Nicodème, B. Salvy, and P. Flajolet, Motif statistics, Motif statistics, pp.593-618, 2002.
DOI : 10.1016/S0304-3975(01)00264-X

D. Panario, R. , and B. , Smallest components in decomposable structures: Exp-log class, Algorithmica, vol.14, issue.2, pp.205-226, 2001.
DOI : 10.1007/BF02679619

B. Prum, F. Rodolphe, and E. De-turckheim, Finding words with unexpected frequencies in deoxyribonucleic acid sequences, J. R. Statist . Soc. B, vol.57, issue.1, pp.205-220, 1995.

M. Régnier, A unified approach to word occurrence probabilities, Discrete Applied Mathematics, vol.104, issue.1-3, pp.259-280, 2000.
DOI : 10.1016/S0166-218X(00)00195-5

M. Régnier and W. Szpankowski, On the approximate pattern occurrences in a text, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), p.253, 1997.
DOI : 10.1109/SEQUEN.1997.666920

M. Régnier and W. Szpankowski, On pattern frequency occurrences in a markovian sequence ? Algorithmica, This paper was presented in part at the 1997 International Symposium on Information Theory, pp.631-649, 1998.

G. Reinert and S. , Compound Poisson and Poisson Process Approximations for Occurrences of Multiple Words in Markov Chains, Journal of Computational Biology, vol.5, issue.2, pp.223-253, 1998.
DOI : 10.1089/cmb.1998.5.223

G. Reinert, S. Schbath, and M. Waterman, Probabilistic and Statistical Properties of Words: An Overview, Journal of Computational Biology, vol.7, issue.1-2, pp.1-46, 2000.
DOI : 10.1089/10665270050081360

G. Reinert, S. Schbath, and M. S. Waterman, Statistics on words with applications to biological sequences, Applied combinatorics on words, M. Lothaire of Encyclopedia of Mathematics and its Applications, pp.251-328, 2005.

C. Reutenauer, Free lie algebras, 1993.
DOI : 10.1016/S1570-7954(03)80075-X

R. F. Rice, Some practical universal noiseless coding techniques, 1979.
DOI : 10.1117/12.958253

R. L. Rivest, Partial-Match Retrieval Algorithms, SIAM Journal on Computing, vol.5, issue.1, pp.19-50, 1976.
DOI : 10.1137/0205003

E. Roquain and S. Schbath, Improved compound poisson approximation for the number of occurrences of multiple words in a stationary markov chain, Adv. Appl. Prob, vol.39, pp.1-13, 2007.

M. Roux, Séries de Dirichet et analyse en moyenne d'algorithmes de réduction des réseaux, 2011.

D. Ruelle, Dynamical Zeta Functions for Piecewise Monotone Maps of the Interval of CRM Monograph Series, 1994.

S. Schbath, Compound Poisson approximation of word counts in DNA sequences, ESAIM: Probability and Statistics, vol.1, pp.1-16, 1995.
DOI : 10.1051/ps:1997100

R. Sedgewick, Algorithms in C : Fundamentals, Data Structures, Sorting, Searching, 1988.

R. Sedgewick, Algorithms in C, Parts 1?4, 1998.

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

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, Series in Discrete Mathematics and Optimization, 2001.
DOI : 10.1002/9781118032770

M. Tompa, N. Li, T. Bailey, G. Church, B. De-moor et al., Assessing computational tools for the discovery of transcription factor binding sites, Nature Biotechnology, vol.5, issue.1, pp.137-144, 2005.
DOI : 10.1002/prot.10556

T. Pardo and L. , Set representation and set intersection, Tech. rep, 1978.

B. Vallée, Dynamical sources in information theory: Fundamental intervals and word prefixes, Algorithmica, vol.81, issue.2, pp.262-306, 2001.
DOI : 10.1007/BF02679622

B. Vallée, Euclidean dynamics. Discrete and Continuous Dynamical Systems 1, pp.281-352, 2006.

M. J. Weinberger, G. Seroussi, and G. Sapiro, The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS, IEEE Transactions on Image Processing, vol.9, issue.8, pp.1309-1324, 2000.
DOI : 10.1109/83.855427