10 search results - page 1 / 2 » Tight Bounds for String Reconstruction Using Substring Queri... |
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
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...
FOCS
1995
IEEE
13 years 8 months ago
1995
IEEE
We establish a variety of combinatorial bounds on the tradeo s inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results ...
ESA
2003
Springer
13 years 10 months ago
2003
Springer
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
ALMOB
2006
13 years 5 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...