Florian Ingels

According to our database, Florian Ingels authored at least 11 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Vigemers: on the number of <i>k</i>-mers sharing the same XOR-based minimizer.

Florian Ingels, Antoine Limasset, Camille Marchet, Mikaël Salson

CoRR, February, 2026

2025

Decomposing Words for Enhanced Compression: Exploring the Number of Runs in the Extended Burrows-Wheeler Transform.

Florian Ingels, Anaïs Denis, Bastien Cazaux

CoRR, June, 2025

2024

Detection of common subtrees with identical label distribution.

Romain Azaïs, Florian Ingels

Theor. Comput. Sci., 2024

On the number of <i>k</i>-mers admitting a given lexicographical minimizer.

Florian Ingels, Camille Marchet, Mikaël Salson

CoRR, 2024

2023

Revisiting Tree Isomorphism: AHU Algorithm with Primes Numbers.

Florian Ingels

CoRR, 2023

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

PhD thesis, 2022

Enumeration of irredundant forests.

Florian Ingels, Romain Azaïs

Theor. Comput. Sci., 2022

2021

Isomorphic Unordered Labeled Trees up to Substitution Ciphering.

Florian Ingels, Romain Azaïs

Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020

The weight function in the subtree kernel is decisive.

Romain Azaïs, Florian Ingels

J. Mach. Learn. Res., 2020

Enumeration of Unordered Forests.

Florian Ingels, Romain Azaïs

CoRR, 2020

2019

treex: a Python package for manipulating rooted trees.

Romain Azaïs, Guillaume Cerutti, Didier Gemmerlé, Florian Ingels

J. Open Source Softw., 2019