Pages that link to "Item:Q2035747"
From MaRDI portal
The following pages link to Subpolynomial trace reconstruction for random strings and arbitrary deletion probability (Q2035747):
Displaying 10 items.
- Optimal mean-based algorithms for trace reconstruction (Q1737958) (← links)
- New lower bounds for trace reconstruction (Q2041812) (← links)
- Reconstructing trees from traces (Q2075329) (← links)
- The trace reconstruction problem for spider graphs (Q2092331) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q4978045) (← links)
- On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions (Q5032564) (← links)
- Information-Theoretic Foundations of DNA Data Storage (Q5863762) (← links)
- (Q5875500) (← links)
- Tree trace reconstruction using subtraces (Q6102057) (← links)
- Reconstruction of hypermatrices from subhypermatrices (Q6637145) (← links)