Probabilistic nucleotide assembling method for sequencing by hybridization

Abstract

Motivation: Developing a new method of assembling small sequences based on sequencing by hybridization with many positive and negative faults. First, an interpretation of a generic traveling salesman problem is provided (i.e. finding the shortest route for visiting many cities), using genetic algorithms. Second, positive errors are excluded before assembly by a sanitization process. Results: The present method outperforms those described in previous studies, in terms of both time and accuracy. © Oxford University Press 2004; all rights reserved.