Tree trace reconstruction using subtraces

02/02/2021
by   Tatiana Brailovskaya, et al.
0

Tree trace reconstruction aims to learn the binary node labels of a tree, given independent samples of the tree passed through an appropriately defined deletion channel. In recent work, Davies, Rácz, and Rashtchian used combinatorial methods to show that exp(𝒪(k log_k n)) samples suffice to reconstruct a complete k-ary tree with n nodes with high probability. We provide an alternative proof of this result, which allows us to generalize it to a broader class of tree topologies and deletion models. In our proofs, we introduce the notion of a subtrace, which enables us to connect with and generalize recent mean-based complex analytic algorithms for string trace reconstruction.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset