Approximation of trees by self-nested trees - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Approximation of trees by self-nested trees

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.
Fichier principal
Vignette du fichier
paper.pdf (383.63 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01294013 , version 1 (25-03-2016)
hal-01294013 , version 2 (15-09-2016)
hal-01294013 , version 3 (26-10-2018)

Identifiers

Cite

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⟩
906 View
621 Download

Altmetric

Share

Gmail Facebook X LinkedIn More