Article ID: | iaor20002823 |
Country: | United States |
Volume: | 6 |
Issue: | 1 |
Start Page Number: | 113 |
End Page Number: | 123 |
Publication Date: | Mar 1999 |
Journal: | Journal of Computational Biology |
Authors: | Blazewicz J., Kasprzak M., Formanowicz P., Markiewicz W. |
Keywords: | programming: dynamic |
The problem addressed in this paper is concerned with DNA sequencing by hybridization. An algorithm is proposed that solves a computational phase of this approach in the presence of both positive and negative errors resulting from the hybridization experiment. No a priori knowledge of the nature and source of these errors is required. An extensive set of computational experiments showed that the algorithm behaves suprisingly well if only positive errors appear. The general case, where positive and negative errors occur, can be also solved satisfactorily for an error rate up to 10%.