Sciweavers

253
Voted
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
15 years 11 months ago
Tight Bounds for String Reconstruction Using Substring Queries
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
Dekel Tsur