title: Sequential and parallel algorithms for DNA sequencing.
abstract: BACKGROUND
  Reconstruction of the original DNA sequence in the sequencing by the hybridization approach (SBH) requires computational support due to a large number of possible combinations. One can notice a lack of algorithms admitting false-negative data and giving in addition all possible solutions.
  
  
  RESULTS
  In this paper, a new method of sequencing has been proposed. An algorithm based on its idea (for the general case, when some data are missing, like in the real experiment) has been implemented and tested. Authentic DNA sequences have been used for testing. A parallel version of the algorithm has also been implemented and tested. The quality of the reconstruction is satisfactory for the library of oligonucleotides of length between 8 and 12, and 100, 200 and 300 bp long sequences. A way to a further decrease in the computation time is also suggested.
authors.affiliation: Institute of Computing Science, Poznan University of Technology, Poland. blazewic@pozn1v.put.poznan.pl
authors.forename: J
authors.initials: J
authors.lastname: Blazewicz
authors.forename: J
authors.initials: J
authors.lastname: Kaczmarek
authors.forename: M
authors.initials: M
authors.lastname: Kasprzak
authors.forename: W T
authors.initials: WT
authors.lastname: Markiewicz
authors.forename: J
authors.initials: J
authors.lastname: Weglarz
mesh_terms: D000465:Algorithms; D001483:Base Sequence; D004247:DNA / Q000235:genetics; D005069:Evaluation Studies as Topic; D005188:False Negative Reactions; D008969:Molecular Sequence Data; D009693:Nucleic Acid Hybridization; D017422:Sequence Analysis, DNA / Q000379:methods* / Q000706:statistics & numerical data
chemical_list: D004247:DNA