Substring Density Estimation from Traces

10/19/2022
by   Kayvon Mazooji, et al.
0

In the trace reconstruction problem, one seeks to reconstruct a binary string s from a collection of traces, each of which is obtained by passing s through a deletion channel. It is known that exp(Õ(n^1/5)) traces suffice to reconstruct any length-n string with high probability. We consider a variant of the trace reconstruction problem where the goal is to recover a "density map" that indicates the locations of each length-k substring throughout s. We show that ϵ^-2·poly(n) traces suffice to recover the density map with error at most ϵ. As a result, when restricted to a set of source strings whose minimum "density map distance" is at least 1/poly(n), the trace reconstruction problem can be solved with polynomially many traces.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2020

Polynomial-time trace reconstruction in the low deletion rate regime

In the trace reconstruction problem, an unknown source string x ∈{0,1}^n...
research
01/15/2018

Subpolynomial trace reconstruction for random strings and arbitrary deletion probability

The deletion-insertion channel takes as input a bit string x∈{0,1}^n, a...
research
08/29/2023

On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction

The goal of the trace reconstruction problem is to recover a string x∈{0...
research
09/02/2020

Circular Trace Reconstruction

Trace Reconstruction is the problem of learning an unknown string x from...
research
07/20/2021

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

We consider an approximate version of the trace reconstruction problem, ...
research
06/28/2019

Inversion of trace formulas for a Sturm-Liouville operator

This paper revisits the classical problem "Can we hear the density of a ...
research
09/16/2022

The trace reconstruction problem for spider graphs

We study the trace reconstruction problem for spider graphs. Let n be th...

Please sign up or login with your details

Forgot password? Click here to reset