## Abstract

The insertion-deletion channel takes as input a bit string x ∊ {0; 1}^{n}, and outputs a string where bits have been deleted and inserted independently at random. The trace reconstruction problem is to recover x from many independent outputs (called “traces”) of the insertion-deletion channel applied to x. We show that if x is chosen uniformly at random, then exp.O.log^{1=3} n// traces suffice to reconstruct x with high probability. For the deletion channel with deletion probability q < 1=2 the earlier upper bound was exp.O.log^{1=2} n//. The case of q > 1=2 or the case where insertions are allowed has not been previously analyzed, and therefore the earlier upper bound was as for worst-case strings, i.e., exp.O.n^{1=3} //. We also show that our reconstruction algorithm runs in n^{1+o.1/} time. A key ingredient in our proof is a delicate two-step alignment procedure where we estimate the location in each trace corresponding to a given bit of x. The alignment is done by viewing the strings as random walks and comparing the increments in the walk associated with the input string and the trace, respectively.

Original language | English (US) |
---|---|

Pages (from-to) | 275-309 |

Number of pages | 35 |

Journal | Mathematical Statistics and Learning |

Volume | 2 |

Issue number | 3-4 |

DOIs | |

State | Published - 2019 |

## Keywords

- deletion channel
- Trace reconstruction

## ASJC Scopus subject areas

- Computational Theory and Mathematics
- Signal Processing
- Statistics and Probability
- Theoretical Computer Science