R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proc 20th Int Conf Very Large Data Bases, VLDB, pp.487-499, 1994.

F. and D. Razo-l-´-opez, Tree mining: Equivalence classes for candidate generation 573

T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Satamoto et al., Efficient substructure discovery from large semistructured data, SIAM Int Conf on Data Mining, 2002.

T. Asai, H. Arimura, T. Uno, and S. Nakano, Discovering frequent substructures in large unordered trees, 2003.

Y. Chi, S. Nijssen, R. Muntz, and J. Kok, Frequent subtree mining -an overview, Fundamenta Informaticae, vol.66, issue.1-2, pp.161-198, 2005.

Y. Chi, Y. Xia, Y. Yang, and R. Muntz, Mining closed and maximal frequent subtrees from databases of labeled rooted trees, IEEE Transactions on Knowledge and Data Engineering, vol.17, issue.2, pp.190-202, 2005.

J. D. Knijf, Frequent tree mining with selection constraints, Proc of the 3rd Int Workshop on Mining Graphs, Trees and Sequences (MGTS), 2005.

A. Laurent, P. Poncelet, and M. Teisseire, Fuzzy data mining for the semantic web: Building xml mediator schemas, in: Fuzzy Logic and the Semantic Web, Capturing Intelligence, 2006.

F. D. Lopez, A. Laurent, P. Poncelet, and M. Teisseire, Rsf -a new tree mining approach with an efficient data structure, Proceedings of the joint Conference: 4th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT 2005), 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00106090

J. Pei and J. Han, Constrained frequent pattern mining: A pattern-growth view, ACM SIGKDD, vol.2, issue.2, 2002.

S. Tatikonda, S. Parthasarathy, and T. Kurc, Trips and tides: new algorithms for tree mining, Proc 15th ACM Int Conf on Information and Knowledge Management (CIKM), 2006.

A. Termier, M. Rousset, and M. Sebag, Treefinder, a first step towards XML data mining, IEEE Conference on Data Mining (ICDM), pp.450-457, 2002.

X. Yan and J. Han, gspan: Graph-based substructure pattern mining, Proc of the IEEE International Conference on Data Mining (ICDM), pp.721-724, 2002.

M. Zaki, Efficiently mining frequent trees in a forest, ACM-SIGKDD'02, 2002.

M. J. Zaki, Treeminer code

M. J. Zaki, Efficiently mining frequent embedded unordered trees, Fundamenta Informaticae, vol.65, issue.1-2, pp.33-52, 2005.

M. J. Zaki, Efficiently mining frequent trees in a forest: Algorithms and applications, IEEE Transaction on Knowledge and Data Engineering, vol.17, issue.8, pp.1021-1035, 2005.