. Agrawal, Mining association rules between sets of items in large databases, Proc. of the 1993 ACM SIG- MOD International Conference on Management of Data, pp.207-216, 1993.

. Agrawal, Fast discovery of association rules Advances in Knowledge Discovery and Data Mining, pp.307-328, 1996.

. Bourdon, On the stack-size of general tries. Theoretical informatics ans Applications Size and path-length of patricia tries: Dynamical sources context. Random Structures and Algorithms, pp.163-185, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00442422

. Clément, Dynamical sources in information theory: A general analysis of trie structures, Algorithmica, vol.11, issue.4, pp.307-369, 2001.
DOI : 10.1007/BF02679623

. Geerts, A tight upper bound on the number of candidate patterns Survey on frequent pattern mining Mining frequent patterns without candidate generation: A frequent-pattern tree approach, IEEE International Conference on Data Mining (ICDM'01) ACM SIGMOD International Conference on Management of Data (SIGMOD'00), pp.155-162, 2000.

. Purdom, Average-Case Performance of the Apriori Algorithm, VLDB'95 International Conference on Very Large Data Bases (VLDB'96), pp.1223-1260, 1995.
DOI : 10.1137/S0097539703422881

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

J. Mohammed and . Zaki, Scalable algorithms for association mining, IEEE Trans. Knowl. Data Eng, vol.12, issue.2, pp.372-390, 2000.