Sciweavers

92 search results - page 1 / 19
» Optimal sequencing by hybridization in rounds
Sort
View
RECOMB
2001
Springer
14 years 7 months ago
Optimal sequencing by hybridization in rounds
Alan M. Frieze, Bjarni V. Halldórsson
ESA
2003
Springer
95views Algorithms» more  ESA 2003»
14 years 20 days 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
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
ANCS
2005
ACM
14 years 1 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
IPPS
2000
IEEE
13 years 12 months ago
Broadcasting in Hypercubes in the Circuit Switched Model
In this paper, we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, -port model. In this mode...
Jean-Claude Bermond, Takako Kodate, Stephane Peren...