DeepAI
Log In Sign Up

Polynomial-time trace reconstruction in the low deletion rate regime

12/04/2020
by   Xi Chen, et al.
0

In the trace reconstruction problem, an unknown source string x ∈{0,1}^n is transmitted through a probabilistic deletion channel which independently deletes each bit with some fixed probability δ and concatenates the surviving bits, resulting in a trace of x. The problem is to reconstruct x given access to independent traces. Trace reconstruction of arbitrary (worst-case) strings is a challenging problem, with the current state of the art for poly(n)-time algorithms being the 2004 algorithm of Batu et al. <cit.>. This algorithm can reconstruct an arbitrary source string x ∈{0,1}^n in poly(n) time provided that the deletion rate δ satisfies δ≤ n^-(1/2 + ε) for some ε > 0. In this work we improve on the result of <cit.> by giving a poly(n)-time algorithm for trace reconstruction for any deletion rate δ≤ n^-(1/3 + ε). Our algorithm works by alternating an alignment-based procedure, which we show effectively reconstructs portions of the source string that are not "highly repetitive", with a novel procedure that efficiently determines the length of highly repetitive subwords of the source string.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/27/2020

Polynomial-time trace reconstruction in the smoothed complexity model

In the trace reconstruction problem, an unknown source string x ∈{0,1}^n...
10/19/2022

Substring Density Estimation from Traces

In the trace reconstruction problem, one seeks to reconstruct a binary s...
11/07/2022

Approximate Trace Reconstruction from a Single Trace

The well-known trace reconstruction problem is the problem of inferring ...
07/12/2019

Efficient average-case population recovery in the presence of insertions and deletions

Several recent works have considered the trace reconstruction problem, i...
09/16/2022

The trace reconstruction problem for spider graphs

We study the trace reconstruction problem for spider graphs. Let n be th...
04/11/2019

Beyond trace reconstruction: Population recovery from the deletion channel

Population recovery is the problem of learning an unknown distribution o...
04/14/2020

Population Recovery from the Deletion Channel: Nearly Matching Trace Reconstruction Bounds

The population recovery problem asks one to recover an unknown distribut...