title: Sequencing by Hybridization with Positive Faults.
abstract: The paper is concerned with a computational phase of the sequencing DNA chains by hybridization. It is assumed that positive faults can occur in the hybridization experiment. An approach based on a reduction of the problem to a variant of a Selective Traveling Salesman Problem and an algorithm for solving the latter, have been proposed. The algorithm behaves extremely well, even for a fault rate exceeding 50%.
authors.initials: J
authors.lastname: Blazewicz
authors.initials: P
authors.lastname: Formanowicz
authors.initials: M
authors.lastname: Kasprzak
authors.initials: WT
authors.lastname: Markiewicz
authors.initials: J
authors.lastname: Weglarz