1. Discovering frequent substructures in large unordered trees;Asai,2003
2. Reverse search for enumeration;Avis;Discrete Appl. Math.,1996
3. treex: a Python package for manipulating rooted trees;Azaïs;J. Open Sour. Softw.,2019
4. Approximation of trees by self-nested trees;Azaïs,2019
5. The weight function in the subtree kernel is decisive;Azaïs;J. Mach. Learn. Res.,2020