# Polynomial-time trace reconstruction in the smoothed complexity model

@inproceedings{Chen2021PolynomialtimeTR,
title={Polynomial-time trace reconstruction in the smoothed complexity model},
author={Xianmiao Chen and Anindya De and Chin Ho Lee and R. Servedio and S. Sinha},
booktitle={SODA},
year={2021}
}
In the \emph{trace reconstruction problem}, an unknown source string $x \in \{0,1\}^n$ is sent through a probabilistic \emph{deletion channel} which independently deletes each bit with probability $\delta$ and concatenates the surviving bits, yielding a \emph{trace} of $x$. The problem is to reconstruct $x$ given independent traces. This problem has received much attention in recent years both in the worst-case setting where $x$ may be an arbitrary string in $\{0,1\}^n$ \cite{DOS17… Expand
14 Citations

#### Figures from this paper

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces
• Xi Chen, Sandip Sinha
• Computer Science
• ArXiv
• 2021
An efficient algorithm is given, and a near-matching lower bound is proved, for approximate reconstruction of a random source string x ∈ {0, 1}n from few traces and it is proved that given M ≤ Θ(1/δ) traces from Delδ(x) for a random n-bit string x, the smallest possible expected edit distance that any algorithm can achieve, regardless of its running time, is n · (δM). Expand
New Upper Bounds for Trace Reconstruction
The lower bound on average case trace reconstruction from Omega's log 9/4 n to Omega's n 3/2 n is improved. Expand
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance
• Computer Science, Mathematics
• 2021 IEEE International Symposium on Information Theory (ISIT)
• 2021
A connection to the famous Prouhet-Tarry-Escott (PTE) problem is described, which shows a barrier to finding explicit hard-to-distinguish strings that would imply explicit short solutions to the PTE problem, a well-known difficult problem in number theory. Expand
Approximate Trace Reconstruction via Median String (in Average-Case)
An approximate version of the trace reconstruction problem, where the goal is to recover an unknown string s ∈ {0, 1} from m traces is considered, and a deterministic near-linear time algorithm for the average-case model that uses only three traces is presented. Expand
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel
• Computer Science, Mathematics
• 2021 IEEE International Symposium on Information Theory (ISIT)
• 2021
This work uses a simple extension of the original complex-analytic approach to show that exp(O(n)) traces suffice for mean-based worst-case trace reconstruction over any memoryless channel that maps each input bit to an arbitrarily distributed sequence of replications and insertions of random bits, provided the length of this sequence follows a subexponential distribution. Expand
Approximate trace reconstruction of random strings from a constant number of traces
• Mathematics
• 2021
In the trace reconstruction problem, the goal is to reconstruct an unknown string x of length n from multiple traces obtained by passing x through the deletion channel. In the relaxed problem ofExpand
Tree trace reconstruction using subtraces
• Computer Science, Mathematics
• ArXiv
• 2021
In these proofs, the notion of a subtrace is introduced, which enables us to connect with and generalize recent mean-based complex analytic algorithms for string trace reconstruction. Expand
Trace Reconstruction Problems in Computational Biology
• Medicine, Computer Science
• IEEE Transactions on Information Theory
• 2021
Several new trace generation models and open questions relevant to trace reconstruction for immunogenomics and DNA data storage are introduced, theoretical results on trace reconstruction are surveyed, and their connections to computational biology are surveyed. Expand
Separating words and trace reconstruction
It is proved that for any distinct x,y ∈ {0,1}n, there is a deterministic finite automaton with O(n1/3) states that accepts x but not y, and the upper bound on worst case trace reconstruction is improved. Expand
PR ] 7 S ep 2 02 0 NEW UPPER BOUNDS FOR TRACE RECONSTRUCTION
We improve the upper bound on worst case trace reconstruction from exp(O(n)) to exp(Õ(n)) for any deletion probability q ≤ 1 2 .

#### References

SHOWING 1-10 OF 24 REFERENCES
Lower bounds for trace reconstruction
• Mathematics, Computer Science
• ArXiv
• 2018
It is proved that there exist x, y such that at least $c\, n^{5/4}/\sqrt{\log n}$ traces are required to distinguish between x and y for some absolute constant $c, improving the previous lower bound of c. Expand Trace reconstruction with varying deletion probabilities • Mathematics, Computer Science • ANALCO • 2018 An upper bound is extended to the setting where the deletion probabilities vary, assuming certain regularity conditions and each letter of the contracted string is associated with some possibly unknown deletion probability$q_\zeta$. Expand Efficient average-case population recovery in the presence of insertions and deletions • Mathematics, Computer Science • APPROX-RANDOM • 2019 The algorithm efficiently recovers${\cal D}$up to total variation distance$\epsilon$with high probability, given access to independent traces of independent draws from$\cal{D}$. Expand Trace Reconstruction: Generalized and Parameterized • Mathematics, Computer Science • ESA • 2019 It is proved that$\exp(O(n^{1/4} \sqrt{\log n}))$traces suffice for reconstructing arbitrary matrices and it is shown that$\Theta(\log n)$traces are necessary and sufficient. Expand Subpolynomial trace reconstruction for random strings and arbitrary deletion probability • Computer Science, Mathematics • COLT • 2018 If$\bf x$is chosen uniformly at random, then$\exp(O(\log^{1/3} n))$traces suffice to reconstruct$\BF x$with high probability, and the reconstruction algorithm runs in$n^{1+o(1)}$time. Expand Population Recovery from the Deletion Channel: Nearly Matching Trace Reconstruction Bounds This work provides an algorithm that learns the distribution using only$\exp\big(\tilde{O}(n^{1/3}) \cdot \ell^2\big)\$ samples, by developing a higher-moment analog of the algorithms of [DOS17, NP17]. Expand
New Upper Bounds for Trace Reconstruction
The lower bound on average case trace reconstruction from Omega's log 9/4 n to Omega's n 3/2 n is improved. Expand
Optimal mean-based algorithms for trace reconstruction
• Computer Science, Mathematics
• STOC
• 2017
For any constant deletion rate 0 < Ω < 1, a mean-based algorithm is given that uses exp(O(n1/3) time and traces; it is proved that any mean- based algorithm must use at least exp(Ω(n 1/3)) traces; and a surprising result is found: for deletion probabilities δ > 1/2, the presence of insertions can actually help with trace reconstruction. Expand
Trace Reconstruction Revisited
• Mathematics, Computer Science
• ESA
• 2014
This work implies the first sub-polynomial upper bound (when the alphabet is polylogn) and super-logarithmic lower bound on the number of traces required when x is random and p is constant. Expand
Trace reconstruction with exp(O(n1/3)) samples
• Computer Science, Mathematics
• STOC
• 2017
The best upper bound, due to Holenstein, Mitzenmacher, Panigrahy, and Wieder (2008), is improved to exp(O(n1/3)) using statistics of individual bits in the output and it is shown that this bound is sharp in the restricted model where this is the only information used. Expand