Circular trace reconstruction
From MaRDI portal
Cites work
- Average-case reconstruction for the deletion channel: subpolynomially many traces suffice
- Beyond trace reconstruction: population recovery from the deletion channel
- Circular pattern matching with \(k\) mismatches
- Coded Trace Reconstruction
- Coded trace reconstruction in a constant number of traces
- Efficient reconstruction of sequences
- Efficient reconstruction of sequences from their subsequences of supersequences
- Homomorphic fingerprints under misalignments
- scientific article; zbMATH DE number 5764889 (Why is no real title available?)
- scientific article; zbMATH DE number 5764890 (Why is no real title available?)
- scientific article; zbMATH DE number 7650111 (Why is no real title available?)
- Littlewood-Type Problems on [0,1]
- Littlewood-type problems on subarcs of the unit circle
- Lower bounds for trace reconstruction
- Multireference alignment using semidefinite programming
- Number fields
- On a cyclic string-to-string correction problem
- Optimal mean-based algorithms for trace reconstruction
- Optimal rates of estimation for multi-reference alignment
- Reconstructing strings from random traces
- The sample complexity of multireference alignment
- Trace Reconstruction Problems in Computational Biology
- Trace reconstruction revisited
- Trace reconstruction with \(\exp(O(n^{1/3}))\) samples
- Trace reconstruction with varying deletion probabilities
- Trace reconstruction: generalized and parameterized
This page was built for publication: Circular trace reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229303)
