Log In Sign Up

Approximate Trace Reconstruction from a Single Trace

by   Xi Chen, et al.

The well-known trace reconstruction problem is the problem of inferring an unknown source string x ∈{0,1}^n from independent "traces", i.e. copies of x that have been corrupted by a δ-deletion channel which independently deletes each bit of x with probability δ and concatenates the surviving bits. The current paper considers the extreme data-limited regime in which only a single trace is provided to the reconstruction algorithm. In this setting exact reconstruction is of course impossible, and the question is to what accuracy the source string x can be approximately reconstructed. We give a detailed study of this question, providing algorithms and lower bounds for the high, intermediate, and low deletion rate regimes in both the worst-case (x is arbitrary) and average-case (x is drawn uniformly from {0,1}^n) models. In several cases the lower bounds we establish are matched by computationally efficient algorithms that we provide. We highlight our results for the high deletion rate regime: roughly speaking, they show that - Having access to a single trace is already quite useful for worst-case trace reconstruction: an efficient algorithm can perform much more accurate reconstruction, given one trace that is even only a few bits long, than it could given no traces at all. But in contrast, - in the average-case setting, having access to a single trace is provably not very useful: no algorithm, computationally efficient or otherwise, can achieve significantly higher accuracy given one trace that is o(n) bits long than it could with no traces.


page 1

page 2

page 3

page 4


Polynomial-time trace reconstruction in the smoothed complexity model

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

Polynomial-time trace reconstruction in the low deletion rate regime

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

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces

In the standard trace reconstruction problem, the goal is to exactly rec...

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

Several recent works have considered the trace reconstruction problem, i...

Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel

Mean-based reconstruction is a fundamental, natural approach to worst-ca...

Average-Case to (shifted) Worst-Case Reduction for the Trace Reconstruction Problem

The insertion-deletion channel takes as input a binary string x ∈{0, 1}^...

Coded trace reconstruction in a constant number of traces

The coded trace reconstruction problem asks to construct a code C⊂{0,1}^...