The paper deals with the problem of DNA (deoxyribonucleic acid) sequencing by hybridization. A computational phase of this approach, i.e. a construction of a DNA sequence from oligonucleotides, is NP-hard in the strong sense in case of errors. Thus, since the last problem does not admit a polynomial time solution, a need arises to construct efficient heuristics solving the problem. In the paper, such a heuristic algorithm based on tabu search is proposed. Computational tests have proved its low complexity and high accuracy for both types of errors: false negatives and false positives.
['Jacek Blazewicz', 'Piotr Formanowicz', 'Marta Kasprzak', 'Wojciech T. Markiewicz', 'Jan Weglarz']
Tabu search for DNA sequencing with false negatives and false positives