Reconstructing Trees from Traces

02/13/2019
by   Sami Davies, et al.
0

We study the problem of learning a node-labeled tree given independent traces from an appropriately defined deletion channel. This problem, tree trace reconstruction, generalizes string trace reconstruction, which corresponds to the tree being a path. For many classes of trees, including complete trees and spiders, we provide algorithms that reconstruct the labels using only a polynomial number of traces. This exhibits a stark contrast to known results on string trace reconstruction, which require exponentially many traces, and where a central open problem is to determine whether a polynomial number of traces suffice. Our techniques combine novel combinatorial and complex analytic methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/02/2021

Tree trace reconstruction using subtraces

Tree trace reconstruction aims to learn the binary node labels of a tree...
research
02/05/2021

Reconstructing Arbitrary Trees from Traces in the Tree Edit Distance Model

In this paper, we consider the problem of reconstructing trees from trac...
research
09/10/2022

SampleHST: Efficient On-the-Fly Selection of Distributed Traces

Since only a small number of traces generated from distributed tracing h...
research
08/17/2021

Reconstruction of Worm Propagation Path Using a Trace-back Approach

Worm origin identification and propagation path reconstruction are essen...
research
09/16/2022

The trace reconstruction problem for spider graphs

We study the trace reconstruction problem for spider graphs. Let n be th...
research
07/13/2017

Parsing with Traces: An O(n^4) Algorithm and a Structural Representation

General treebank analyses are graph structured, but parsers are typicall...
research
05/06/2019

Estimating the inverse trace using random forests on graphs

Some data analysis problems require the computation of (regularised) inv...

Please sign up or login with your details

Forgot password? Click here to reset