Jacek Blazewicz (email@example.com)
Piotr Formanowicz (firstname.lastname@example.org)
Marta Kasprzak (email@example.com)
Wojciech T. Markiewicz (firstname.lastname@example.org)
Jan Weglarz (email@example.com)
 Institute of Computing Science, Poznan University of Technology, Piotrowo 3A, 60-965 Poznan, Poland
 Institute of Bioorganic Chemistry, Polish Academy of Sciences, Noskowskiego 12/14, 61-704 Poznan, Poland
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%.