Pages that link to "Item:Q2192732"
From MaRDI portal
The following pages link to Lower bounds for trace reconstruction (Q2192732):
Displaying 12 items.
- Optimal mean-based algorithms for trace reconstruction (Q1737958) (← links)
- Hidden words statistics for large patterns (Q2030762) (← links)
- Subpolynomial trace reconstruction for random strings and arbitrary deletion probability (Q2035747) (← links)
- New lower bounds for trace reconstruction (Q2041812) (← links)
- Reconstructing trees from traces (Q2075329) (← links)
- The trace reconstruction problem for spider graphs (Q2092331) (← links)
- Trace reconstruction with exp(O(n <sup>1/3</sup> )) samples (Q4978044) (← links)
- Optimal mean-based algorithms for trace reconstruction (Q4978045) (← links)
- (Q5075814) (← links)
- (Q5875500) (← links)
- Tree trace reconstruction using subtraces (Q6102057) (← links)
- Pairwise sequence alignment at arbitrarily large evolutionary distance (Q6591584) (← links)