T. V. Aardenne-ehrenfest and N. De-bruijn, Circuits and Trees in Oriented Linear Graphs, pp.203-217, 1951.
DOI : 10.1007/978-0-8176-4842-8_12

D. Aldous, The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees, SIAM Journal on Discrete Mathematics, vol.3, issue.4, pp.450-465, 1990.
DOI : 10.1137/0403039

S. Altschul and B. Erickson, Signifiance of nucleotide sequence alignments: a methode for random sequence permutation that preserves dinucleotide and codon usage, Mol. Biol. Evol, vol.2, pp.256-538, 1985.

S. Altschul, T. Madden, A. Schäffer, J. Zhang, Z. Zhang et al., Gapped BLAST and PSI-BLAST: a new generation of protein database search programs, Nucleic Acids Research, vol.25, issue.17, pp.3389-3402, 1997.
DOI : 10.1093/nar/25.17.3389

E. Balas and C. Yu, On graphs with polynomially solvable maximum-weight clique problem, Networks, vol.10, issue.2, pp.247-253, 1989.
DOI : 10.1002/net.3230190206

E. Beaudoing, S. Freier, J. Wyatt, J. Claverie, and D. Gautheret, Patterns of Variant Polyadenylation Signal Usage in Human Genes, Genome Research, vol.10, issue.7, pp.1001-1010, 2000.
DOI : 10.1101/gr.10.7.1001

A. Broder, Generating random spanning trees, 30th Annual Symposium on Foundations of Computer Science, pp.442-447, 1989.
DOI : 10.1109/SFCS.1989.63516

A. Denise, M. Régnier, and M. Vandenbogaert, Assessing the Statistical Significance of Overrepresented Oligonucleotides, Proceedings of WABI'01, pp.85-97, 2001.
DOI : 10.1007/3-540-44696-6_7

W. Fitch, Random sequences, Journal of Molecular Biology, vol.163, issue.2, pp.171-176, 1983.
DOI : 10.1016/0022-2836(83)90002-5

M. R. Garey and D. S. Johnson, Computers and intractability : a guide to the theory of NP-completeness, 1979.

M. Grotschel, L. Lovasz, and A. Schrijver, Polynomial Algorithms for Perfect Graphs, Annals of Discrete Mathematics, vol.21, pp.322-356, 1984.
DOI : 10.1016/S0304-0208(08)72943-8

D. Kandel, Y. Matias, R. Unger, and P. Winkler, Shuffling biological sequences, Discrete Applied Mathematics, vol.71, issue.1-3, pp.171-185, 1996.
DOI : 10.1016/S0166-218X(97)81456-4
URL : http://doi.org/10.1016/s0166-218x(97)81456-4

D. Lipman, W. Wilbur, T. Smith, and M. Waterman, On the statistical significance of nucleic add similarities, Nucleic Acids Research, vol.12, issue.1Part1, pp.215-226, 1984.
DOI : 10.1093/nar/12.1Part1.215

J. Propp and D. Wilson, How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph, Journal of Algorithms, vol.27, issue.2, pp.170-217, 1998.
DOI : 10.1006/jagm.1997.0917

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

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

J. Van-helden, Metrics for comparing regulatory sequences on the basis of pattern counts, Bioinformatics, vol.20, issue.3, pp.399-406, 2004.
DOI : 10.1093/bioinformatics/btg425

J. Van-helden, B. André, and J. Collado-vides, Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies 1 1Edited by G. von Heijne, Journal of Molecular Biology, vol.281, issue.5, pp.827-842, 1998.
DOI : 10.1006/jmbi.1998.1947

A. Vanet, L. Marsan, and M. Sagot, Promoter sequences and algorithmical methods for identifying them, Research in Microbiology, vol.150, issue.9-10, pp.779-799, 1999.
DOI : 10.1016/S0923-2508(99)00115-1
URL : https://hal.archives-ouvertes.fr/hal-00428461

D. Wilson, Generating random spanning trees more quickly than the cover time, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.296-303, 1996.
DOI : 10.1145/237814.237880