Sequential algorithms for DNA sequencing

TL;DR: The quality of the reconstruction is satisfactory for the library of oligunucleotides of length 9, and 100, 200 and 300-bp long sequences, and a way to a further decrease of the computation time is suggested.

Abstract: Reconstruction of the original DNA sequence in sequencing by hybridization approach (SBH) due to a large number of possible combinations requires a computational support. In the paper, a new method of sequencing has been proposed. Two algorithms based on its idea have been implemented and tested: for the case of an ideal hybridization experiment (complete data) and for more general case, when some data are missing, like in the real experiment. Authentic DNA sequences have been used for testing. A parallel version of the second algorithm has been also implemented and tested. The quality of the reconstruction is satisfactory for the library of oligunucleotides of length 9, and 100, 200 and 300-bp long sequences. A way to a further decrease of the computation time is also suggested,