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, LJK - Laboratoire Jean Kuntzmann, INPG - Institut National Polytechnique de Grenoble
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.
Type de document :
Communication dans un congrès
ALENEX 2019 - Algorithm Engineering and Experiments, Jan 2019, San Diego, United States. pp.1-24, 2019, 〈10.10860〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01294013
Contributeur : Romain Azaïs <>
Soumis le : vendredi 26 octobre 2018 - 09:04:28
Dernière modification le : jeudi 1 novembre 2018 - 14:23:46

Fichier

paper.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

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.1-24, 2019, 〈10.10860〉. 〈hal-01294013v3〉

Partager

Métriques

Consultations de la notice

49

Téléchargements de fichiers

9