R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, Proceedings of the 20th VLDB Conference, 1994.

T. Asai, K. Abe, S. Kawasoe, H. Arimura, and H. Sakamoto, Efficient substructure discovery from large semi-structure data, 2nd Annual SIAM Symposium on Data Mining, SDM2002, 2002.

Y. Chi, Y. Yang, and R. Muntz, Cmtreeminer: Mining both closed and maximal frequent subtrees, The Eighth Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'04), 2004.

Y. Chi, Y. Yang, and R. R. Muntz, Indexing and mining free trees, International Conference on Data Mining 2003 (ICDM2003), 2003.

M. Kuramochi and G. Karypis, Frequent subgraph discovery, IEEE International Conference on Data Mining (ICDM), 2001.

A. Laurent and P. Poncelet, Teisseire, Fuzzy data mining for the semantic web: Building XML mediator schemas, in Fuzzy Logic and the Semantic Web, E. Sanchez,éd., Capturing Intelligence, 2005.

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

J. Tranier, R. Baraer, Z. Bellahsene, and M. Teisseire, Where's Charlie: Family based heuristics for peer-to-peer schema integration, Proceedings of the 8th International Database Engineering and Applications Symposium (IDEAS '04), pp.7-9, 2004.

C. Wang, Q. Yuan, H. Zhou, W. Wang, and B. Shi, Chopper: An efficient algorithm for tree mining, Journal of Computer Science and Technology, vol.19, pp.309-319, 2004.

M. A. Weiss, Data Structures And Algorithm Analysis In C, 1998.

L. Xyleme, A dynamic warehouse for xml data of the web, IEEE Data Engineering Bulletin, 2001.

X. Yan and J. Han, gspan: Graph-based substructure pattern mining, IEEE Conference on Data Mining (ICDM), 2002.

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