Lossy compression of unordered rooted trees

Romain Azaïs 1, 2 Jean-Baptiste Durand 3 Christophe Godin 4, 5
1 BIGS - Biology, genetics and statistics
Inria Nancy - Grand Est, IECL - Institut Élie Cartan de Lorraine
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
4 VIRTUAL PLANTS - Modeling plant morphogenesis at different scales, from genes to phenotype
CRISAM - Inria Sophia Antipolis - Méditerranée , INRA - Institut National de la Recherche Agronomique, Centre de coopération internationale en recherche agronomique pour le développement [CIRAD] : UMR51
Abstract : A classical compression method for trees is to represent them by directed acyclic graphs. This approach exploits subtree repeats in the structure and is ecient only for trees with a high level of redundancy. The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees. In this paper, we introduce a lossy compression method that consists in computing the reduction of a self-nested structure that closely approximates the initial data. We compare two versions of our algorithm and a competitive approach of the literature on a simulated dataset.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Contributeur : Romain Azaïs <>
Soumis le : mardi 1 décembre 2015 - 11:32:55
Dernière modification le : vendredi 19 octobre 2018 - 15:22:02


  • HAL Id : hal-01236088, version 1



Romain Azaïs, Jean-Baptiste Durand, Christophe Godin. Lossy compression of unordered rooted trees. 2015. 〈hal-01236088〉



Consultations de la notice