treex: a Python package for manipulating rooted trees. - Romain Azaïs; Guillaume Cerutti; Didier Gemmerlé; Florian Ingels (J. Open Source Softw., 2019)

Enumeration of Unordered Forests. - Florian Ingels; Romain Azaïs (CoRR, 2020)

The weight function in the subtree kernel is decisive. - Romain Azaïs; Florian Ingels (J. Mach. Learn. Res., 2020)

Isomorphic Unordered Labeled Trees up to Substitution Ciphering. - Florian Ingels; Romain Azaïs (IWOCA, 2021)

Enumeration of irredundant forests. - Florian Ingels; Romain Azaïs (Theor. Comput. Sci., 2022)

On the similarities of trees: the interest of enumeration and compression methods. (Sur la similarité des arbres : l'intérêt des méthodes d'énumération et de compression). - Florian Ingels (2022)

Revisiting Tree Isomorphism: AHU Algorithm with Primes Numbers. - Florian Ingels (CoRR, 2023)

On the number of k-mers admitting a given lexicographical minimizer. - Florian Ingels; Camille Marchet; Mikaël Salson (CoRR, 2024)

Detection of common subtrees with identical label distribution. - Romain Azaïs; Florian Ingels (Theor. Comput. Sci., 2024)

Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform. - Florian Ingels; Anaïs Denis; Bastien Cazaux (CoRR, 2025)