Sciweavers

3 search results - page 1 / 1
» Reconstructing Strings from Substrings in Rounds
Sort
View
FOCS
1995
IEEE
13 years 11 months ago
Reconstructing Strings from Substrings in Rounds
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 ...
Dimitris Margaritis, Steven Skiena
APPROX
2005
Springer
90views Algorithms» more  APPROX 2005»
14 years 1 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
ESA
2003
Springer
95views Algorithms» more  ESA 2003»
14 years 1 months ago
Sequencing by Hybridization in Few Rounds
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
Dekel Tsur