Answers are grounded in this paper and cite their sources.
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. AVAILABILITY: http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html
No takes yet. Share an insight, caveat, or question.
Takaho A. Endo (2004) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: