Lossy Compression of Unordered Rooted Trees

Romain Azaïs, Jean-Baptiste Durand, Christophe Godin

Abstract: A classical compression method for trees is to exploit subtree repeats in the structure by representing them by directed acyclic graphs. We propose a lossy compression method that consists in computing a structure with high redundancy that approximates the initial data.