1. Efficiently mining frequent trees in a forest: algorithms and applications
2. Gärtner T. , Flach P. , Wrobel S. 2003. On graph kernels: hardness results and efficient alternatives. In Proceedings of the 16th Annual Conference on Learning Theory (COLT'03), 129–143.
3. Biological networks
4. A Tree Projection Algorithm for Generation of Frequent Item Sets
5. Fatta G. D. , Berthold M. R. 2005. High performance subgraph mining in molecular compounds. In Proceedings of the 2005 International Conference on High Performance Computing and Communications (HPCC'05), 866–877.