HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Approximation of trees by self-nested trees

Romain Azaïs 1, 2 Jean-Baptiste Durand 3 Christophe Godin 1, 2
3 MISTIS - Modelling and Inference of Complex and Structured Stochastic Systems
Inria Grenoble - Rhône-Alpes, Grenoble INP - Institut polytechnique de Grenoble - Grenoble Institute of Technology, LJK - Laboratoire Jean Kuntzmann
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

Contributor : Romain Azaïs Connect in order to contact the contributor
Submitted on : Friday, October 26, 2018 - 9:04:28 AM
Last modification on : Monday, May 16, 2022 - 3:20:01 PM
Long-term archiving on: : Sunday, January 27, 2019 - 12:53:08 PM


Files produced by the author(s)




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⟩



Record views


Files downloads