Optimal mean-based algorithms for trace reconstruction
From MaRDI portal
Publication:1737958
DOI10.1214/18-AAP1394zbMath1416.62196WikidataQ128546466 ScholiaQ128546466MaRDI QIDQ1737958
Anindya De, Ryan O'Donnell, Rocco A. Servedio
Publication date: 24 April 2019
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.aoap/1548298932
Density estimation (62G07) Computational learning theory (68Q32) Channel models (including quantum) in information and communication theory (94A40)
Related Items (3)
Tree trace reconstruction using subtraces ⋮ Sharp bounds for population recovery ⋮ Reconstructing trees from traces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global alignment of molecular sequences via ancestral state reconstruction
- A survey of results for deletion channels and related synchronization channels
- Reconstruction of sequences
- On a reconstruction problem for sequences
- Reconstructing sequences
- Reconstruction from subsequences.
- Tail bounds for sums of geometric and exponential variables
- Trace Reconstruction Revisited
- The Mahler measure of algebraic numbers: a survey
- Littlewood-type problems on subarcs of the unit circle
- Littlewood-Type Problems on [0,1]
- Efficient reconstruction of sequences
- Trace reconstruction with exp(O(n 1/3 )) samples
- Optimal mean-based algorithms for trace reconstruction
- Efficient reconstruction of sequences from their subsequences of supersequences
This page was built for publication: Optimal mean-based algorithms for trace reconstruction
