Approximation of trees by self-nested trees

10/25/2018
by   Romain Azaïs, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/02/2019

A rearrangement distance for fully-labelled trees

The problem of comparing trees representing the evolutionary histories o...
research
03/02/2020

Bridging the Gap Between Theory and Practice on Insertion-Intensive Database

With the prevalence of online platforms, today, data is being generated ...
research
02/06/2013

Nested Junction Trees

The efficiency of inference in both the Hugin and, most notably, the Sha...
research
10/01/2017

Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs

A square-contact representation of a planar graph G=(V,E) maps vertices ...
research
06/12/2023

Fuzzy linear codes based on nested linear codes

In this paper, we describe a correspondence between a fuzzy linear code ...
research
09/15/2021

A Characterization of Individualization-Refinement Trees

Individualization-Refinement (IR) algorithms form the standard method an...
research
10/23/2019

Nested Conformal Prediction and the Generalized Jackknife+

We provide an alternate unified framework for conformal prediction, whic...

Please sign up or login with your details

Forgot password? Click here to reset