Approximation of trees by self-nested trees

Romain Azaïs (1, 2) , Jean-Baptiste Durand (3) , Christophe Godin (1, 2)

1 MOSAIC - Simulation et Analyse de la morphogenèse in siliCo
2 RDP - Reproduction et développement des plantes
3 MISTIS - Modelling and Inference of Complex and Structured Stochastic Systems

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 combinatorial characterization of this specific family of trees. In particular, we show from both theoretical and practical viewpoints that complex queries can be quickly answered in self-nested trees compared to general trees. We also present an approximation algorithm of a tree by a self-nested one that can be used in fast prediction of edit distance between two trees.

Mots clés: Approximation class; Directed acyclic graphs; Unordered trees; Self-nested trees

Domaines: Algorithme et structure de données [cs.DS]

Romain Azaïs, Jean-Baptiste Durand, Christophe Godin. Approximation of trees by self-nested trees. ALENEX 2019 - Algorithm Engineering and Experiments, Jan 2019, San Diego, United States. pp.39-53, ⟨10.1137/1.9781611975499.4⟩. ⟨hal-01294013v3⟩