Complexity of DNA sequencing by hybridization
Theoretical Computer Science
Sequencing-by-Hybridization Revisited: The Analog-Spectrum Proposal
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Sequencing by hybridization with isothermic oligonucleotide libraries
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
An ant colony optimization algorithm for DNA sequencing by hybridization
Computers and Operations Research
New constructive heuristics for DNA sequencing by hybridization
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
Sequencing by hybridization is a promising cost-effective technology for high-throughput DNA sequencing via microarray chips. However, due to the effects of spectrum errors rooted in experimental conditions, an accurate and fast reconstruction of original sequences has become a challenging problem. In the last decade, a variety of analyses and designs have been tried to overcome this problem, where different strategies have different trade-offs in speed and accuracy. Motivated by the idea that the errors could be identified by analyzing the interrelation of spectrum elements, this paper presents a constructive heuristic algorithm, featuring an accurate reconstruction guided by a set of well-defined criteria and rules. Instead of directly reconstructing the original sequence, the new algorithm first builds several accurate short fragments, which are then carefully assembled into a whole sequence. The experiments on benchmark instance sets demonstrate that the proposed method can reconstruct long DNA sequences with higher accuracy than current approaches in the literature.