Trace reconstruction is the problem of recovering an unknown string from independently generated copies in which each symbol is independently deleted
with a specified probability. Each resulting trace
gives the surviving symbols in their original order but not their original positions.
The original length and the channel's retention probability
are assumed known, and the recovery
guarantee must hold separately for every input string.
Trace Reconstruction
See also
Quasipolynomial Time, String, SubsequenceExplore with Wolfram|Alpha
References
De, A.; O'Donnell, R.; and Servedio, R. A. "Optimal Mean-Based Algorithms for Trace Reconstruction." Ann. Appl. Probab. 29, 851-874, 2019. https://doi.org/10.1214/18-AAP1394.Cite this as:
Weisstein, Eric W. "Trace Reconstruction." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TraceReconstruction.html