An algorithm reconstructs spider graphs with high probability from exp(O((n q^d)^{1/3} d^{-1/3} (log n)^{2/3})) deletion traces when leg length d is at most log base 1/q of n.
Improved string reconstruction over insertion-deletion channels
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The trace reconstruction problem for spider graphs
An algorithm reconstructs spider graphs with high probability from exp(O((n q^d)^{1/3} d^{-1/3} (log n)^{2/3})) deletion traces when leg length d is at most log base 1/q of n.