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, pp.553-569, 2009.
DOI : 10.1142/S0219720006001977
URL : https://hal.archives-ouvertes.fr/inria-00001164

Z. Qian, L. Lu, L. Qi, and Y. Li, An efficient method for statistical significance calculation of transcription factor binding sites, Bioinformation, vol.2, issue.5, pp.169-174, 2007.
DOI : 10.6026/97320630002169

B. Berman, B. Pfeiffer, T. Laverty, S. Salzberg, G. Rubin et al., Computational identification of developmental enhancers: conservation and function of transcription factor binding-site clusters in Drosophila melanogaster and Drosophila pseudoobscura

K. Cartharius, K. Frech, K. Grote, B. Klocke, M. Haltmeier et al., MatInspector and beyond: promoter analysis based on transcription factor binding sites, Bioinformatics, vol.21, issue.13, pp.2933-2942, 2005.
DOI : 10.1093/bioinformatics/bti473
URL : http://bioinformatics.oxfordjournals.org/cgi/content/short/21/13/2933

J. Helden, M. Olmo, and J. Perez-ortin, Statistical analysis of yeast genomic downstream sequences reveals putative polyadenylation signals, Nucleic Acids Research, vol.28, issue.4, pp.1000-1010, 2000.
DOI : 10.1093/nar/28.4.1000

M. Roytberg, Computation of the probabilities of families of biological sequences, Biophysics, vol.54, issue.5, pp.569-573, 2009.
DOI : 10.1134/S0006350909050029

T. Marschal, I. Herms, H. Kaltenbach, and S. Rahmann, Probabilistic Arithmetic Automata and Their Applications, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, issue.6, pp.1737-1750
DOI : 10.1109/TCBB.2012.109

G. Reinert and S. Schbath, 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. Nuel, Numerical Solutions for Patterns Statistics on Markov Chains, Statistical Applications in Genetics and Molecular Biology, vol.5, issue.1
DOI : 10.2202/1544-6115.1219
URL : https://hal.archives-ouvertes.fr/hal-00271482

M. Lladser, M. Betterton, and R. Knight, Multiple pattern matching: a Markov chain approach, Journal of Mathematical Biology, vol.7, issue.10, pp.51-92, 2008.
DOI : 10.1007/s00285-007-0109-3

L. Guibas and A. Odlyzko, String overlaps, pattern matching, and nontransitive games, Journal of Combinatorial Theory, Series A, vol.30, issue.2, pp.183-208, 1981.
DOI : 10.1016/0097-3165(81)90005-4
URL : http://doi.org/10.1016/0097-3165(81)90005-4

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

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

M. Régnier and D. A. , Rare events and Conditional Events on random strings, Discrete Mathematics and Theoretical Computer Science, vol.6, issue.2, pp.191-214, 2004.

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.

M. Régnier, A. Lifanov, and V. Makeev, Three variations on word counting, Proceedings German Conference on Bioinformatics, pp.75-82, 2000.

B. Prum, R. F. Turckheim, and E. , Finding words with unexpected frequencies in DNA sequences, J. R. Statist. Soc. B, vol.11, pp.190-192, 1995.

E. 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

R. Cowan, Expected frequencies of DNA patterns using whittle's formula, Journal of Applied Probability, vol.17, issue.04, pp.886-892, 1991.
DOI : 10.1007/BF01732761

A. Godbole, Poisson approximations for runs and patterns of rare events, Advances in Applied Probability, vol.46, issue.04, pp.851-865, 1991.
DOI : 10.1214/aop/1176994578

M. Geske, A. Godbole, A. Schaffner, A. Skrolnick, and G. Wallstrom, Compound Poisson approximations for word patterns under Markovian hypotheses, Journal of Applied Probability, vol.35, issue.04, pp.877-892, 1995.
DOI : 10.1214/aop/1176993517

G. Reinert and S. Schbath, 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. Nuel, Pattern Markov Chains: Optimal Markov Chain Embedding Through Deterministic Finite Automata, Journal of Applied Probability, vol.1, issue.01, pp.226-243, 2008.
DOI : 10.1214/aoap/1034801248
URL : https://hal.archives-ouvertes.fr/hal-00271298

L. Mr, J. Spouge, G. Kanga, and D. Landsman, Statistical analysis of over-represented words in human promoter sequences, Nucleic Acids Research, vol.32, issue.3, pp.949-958, 2004.

M. Regnier and M. Vandenbogaert, COMPARISON OF STATISTICAL SIGNIFICANCE CRITERIA, Journal of Bioinformatics and Computational Biology, vol.04, issue.02, pp.537-551, 2006.
DOI : 10.1142/S0219720006002028

A. Denise, M. Regnier, and M. Vandenbogaert, Assessing the Statistical Significance of Overrepresented Oligonucleotides, Lecture Notes in Computer Science, vol.2149, pp.85-97, 2001.
DOI : 10.1007/3-540-44696-6_7

G. Nuel, LD-SPatt: Large Deviations Statistics for Patterns on Markov Chains, Journal of Computational Biology, vol.11, issue.6, pp.1023-1033, 2004.
DOI : 10.1089/cmb.2004.11.1023
URL : https://hal.archives-ouvertes.fr/hal-00271507

L. Hertzberg, O. Zuk, G. Getz, and E. Domany, Finding Motifs in Promoter Regions, Journal of Computational Biology, vol.12, issue.3, pp.314-330, 2005.
DOI : 10.1089/cmb.2005.12.314

V. Boeva, J. Clément, M. Régnier, M. Roytberg, and V. Makeev, Exact p-value calculation for heterotypic clusters of regulatory motifs and its application in computational annotation of cis-regulatory modules. Algorithms for molecular biology, p.25, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00784463

G. Nuel, Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics, Algorithms for molecular biology, vol.1, issue.5115, p.14, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00271494

J. Zhang, B. Jiang, M. Li, J. Tromp, X. Zhang et al., Computing exact P-values for DNA motifs, Bioinformatics, vol.23, issue.5, pp.531-537, 2006.
DOI : 10.1093/bioinformatics/btl662

M. Regnier, Z. Kirakossian, E. Furletova, M. Roytberg, and . Graph, Theory and Practice (Texts in Algorithmics), 2008.

S. Karlin, C. Burge, and A. Campbell, Statistical analyses of counts and distributions of restriction sites in DNA sequences, Nucleic Acids Research, vol.20, issue.6, pp.1363-1370, 1992.
DOI : 10.1093/nar/20.6.1363

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

R. Durbin, S. Eddy, A. Krogh, and G. Mitchison, Biological sequence analysis: probabilistic models of proteins and nucleic acids. Cambridge: Cambridge University, 1998.
DOI : 10.1017/CBO9780511790492

M. Rabin and . Automata, Information and control, pp.230-245, 1963.

L. Rabiner, A tutorial on hidden Markov models and selected applications in speech recognition, Proceedings of the IEEE 1989, pp.257-286