Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Trace Reconstruction with Bounded Edit Distance (2102.05372v2)

Published 10 Feb 2021 in cs.IT, math.CO, math.IT, and math.PR

Abstract: The trace reconstruction problem studies the number of noisy samples needed to recover an unknown string $\boldsymbol{x}\in{0,1}n$ with high probability, where the samples are independently obtained by passing $\boldsymbol{x}$ through a random deletion channel with deletion probability $q$. The problem is receiving significant attention recently due to its applications in DNA sequencing and DNA storage. Yet, there is still an exponential gap between upper and lower bounds for the trace reconstruction problem. In this paper we study the trace reconstruction problem when $\boldsymbol{x}$ is confined to an edit distance ball of radius $k$, which is essentially equivalent to distinguishing two strings with edit distance at most $k$. It is shown that $n{O(k)}$ samples suffice to achieve this task with high probability.

Citations (14)

Summary

We haven't generated a summary for this paper yet.