Approximate Trace Reconstruction

12/12/2020
by   Sami Davies, et al.
0

In the usual trace reconstruction problem, the goal is to exactly reconstruct an unknown string of length n after it passes through a deletion channel many times independently, producing a set of traces (i.e., random subsequences of the string). We consider the relaxed problem of approximate reconstruction. Here, the goal is to output a string that is close to the original one in edit distance while using much fewer traces than is needed for exact reconstruction. We present several algorithms that can approximately reconstruct strings that belong to certain classes, where the estimate is within n/polylog(n) edit distance, and where we only use polylog(n) traces (or sometimes just a single trace). These classes contain strings that require a linear number of traces for exact reconstruction and which are quite different from a typical random string. From a technical point of view, our algorithms approximately reconstruct consecutive substrings of the unknown string by aligning dense regions of traces and using a run of a suitable length to approximate each region. To complement our algorithms, we present a general black-box lower bound for approximate reconstruction, building on a lower bound for distinguishing between two candidate input strings in the worst case. In particular, this shows that approximating to within n^1/3 - δ edit distance requires n^1 + 3δ/2/polylog(n) traces for 0< δ < 1/3 in the worst case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2021

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

In the standard trace reconstruction problem, the goal is to exactly rec...
research
11/27/2020

Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance

Trace reconstruction considers the task of recovering an unknown string ...
research
08/04/2018

Lower bounds for trace reconstruction

In the trace reconstruction problem, an unknown bit string x∈{0,1}^n is...
research
07/20/2021

Approximate Trace Reconstruction via Median String (in Average-Case)

We consider an approximate version of the trace reconstruction problem, ...
research
12/23/2019

Reconstruction of Strings from their Substrings Spectrum

This paper studies reconstruction of strings based upon their substrings...
research
04/21/2019

Trace Reconstruction: Generalized and Parameterized

In the beautifully simple-to-state problem of trace reconstruction, the ...
research
02/18/2021

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

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

Please sign up or login with your details

Forgot password? Click here to reset