output
20182025
most citedEnumeration of Irredundant Forests

6 citations

6 papers

cs.CV2025

Learning to Infer Parameterized Representations of Plants from 3D Scans

Samara Ghrer, Christophe Godin, Stefanie Wuhrer

Plants frequently contain numerous organs, organized in 3D branching systems defining the plant's architecture. Reconstructing the architecture of plants from unstructured observat…

cs.DS2023

Detection of Common Subtrees with Identical Label Distribution

Romain Azaïs, Florian Ingels

Frequent pattern mining is a relevant method to analyse structured data, like sequences, trees or graphs. It consists in identifying characteristic substructures of a dataset. This…

math.AP2023

Multiscale modelling and analysis of growth of plant tissues

Arezki Boudaoud, Annamaria Kiss, Mariya Ptashnyk

How morphogenesis depends on cell properties is an active direction of research. Here, we focus on mechanical models of growing plant tissues, where microscopic (sub)cellular struc…

cs.DM2020★ 6 cited

Enumeration of Irredundant Forests

Florian Ingels, Romain Azaïs

Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has alr…

stat.ML2019★ 5 cited

The Weight Function in the Subtree Kernel is Decisive

Romain Azaïs, Florian Ingels

Tree data are ubiquitous because they model a large variety of situations, e.g., the architecture of plants, the secondary structure of RNA, or the hierarchy of XML files. Neverthe…

cs.DS2018★ 1 cited

Approximation of trees by self-nested trees

Romain Azaïs, Jean-Baptiste Durand, Christophe Godin

The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better co…