Probabilistic nucleotide assembling method for sequencing by hybridization

Gespeichert in:

Bibliographische Detailangaben
Zeitschriftentitel:	Bioinformatics
Personen und Körperschaften:	Endo, Takaho A.
In:	Bioinformatics, 20, 2004, 14, S. 2181-2188
Format:	E-Article
Sprache:	Englisch
veröffentlicht:	Oxford University Press (OUP)
Schlagwörter:	Computational Mathematics Computational Theory and Mathematics Computer Science Applications Molecular Biology Biochemistry Statistics and Probability

Details
Zusammenfassung:	<jats:title>Abstract</jats:title> <jats:p>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.</jats:p> <jats:p>Results: The present method outperforms those described in previous studies, in terms of both time and accuracy.</jats:p> <jats:p>Availability: http://kamit.med.u-tokai.ac.jp/~takaho/sbh/index.html</jats:p>
Umfang:	2181-2188
ISSN:	1367-4811 1367-4803
DOI:	10.1093/bioinformatics/bth202