On the power of universal bases in sequencing by hybridization
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Border Length Minimization in DNA Array Design
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Optimal probing patterns for sequencing by hybridization
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
DNA sequencing by hybridization is potentially a powerful alternative to standard gel electrophoresis techniques.An important aspect of the approach is the design of the probing scheme and of the associated sequence reconstruction algorithm.Recen tly a novel probing scheme, whose performance is within a constant factor of the information theory bound, has settled the issue of asymptotic optimality.Th us, the research focus has shifted to the fine tuning of actual performance, with enormous potential for the life sciences.In this paper we discuss a new algorithmic device, called voting upon failure, which, exploiting the knowledge acquired in the course of the sequence reconstruction process, achieves typically a 20% performance improvement over the previous best technique, and comes at 90%-confidence within a factor 0.5 of the information-theory bound.