Probabilistic nucleotide assembling method for sequencing by hybridization

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

[1]  Eran Halperin,et al.  Handling Long Targets and Errors in Sequencing by Hybridization , 2003, J. Comput. Biol..

[2]  R. Drmanac,et al.  DNA sequencing by hybridization: 100 bases read by a non-gel-based method. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Janusz Kaczmarek,et al.  Sequential and parallel algorithms for DNA sequencing , 1997, Comput. Appl. Biosci..

[5]  W. Bains,et al.  A novel method for nucleic acid sequence determination. , 1988, Journal of theoretical biology.

[6]  Alan M. Frieze,et al.  Optimal Reconstruction of a Sequence from its Probes , 1999, J. Comput. Biol..

[7]  Jacek Blazewicz,et al.  A heuristic managing errors for DNA sequencing , 2002, Bioinform..

[8]  P. Pevzner,et al.  Improved chips for sequencing by hybridization. , 1991, Journal of biomolecular structure & dynamics.

[9]  Martin E. Dyer,et al.  The Probability of Unique Solutions of Sequencing by Hybridization , 1994, J. Comput. Biol..

[10]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[11]  Jacek Blazewicz,et al.  DNA Sequencing With Positive and Negative Errors , 1999, J. Comput. Biol..

[12]  Xiang-Sun Zhang,et al.  Reconstruction of DNA sequencing by hybridization , 2003, Bioinform..

[13]  Jacek Blazewicz,et al.  Tabu search for DNA sequencing with false negatives and false positives , 2000, Eur. J. Oper. Res..

[14]  William J. Cook,et al.  TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[15]  K. Doi,et al.  Sequencing by hybridization in the presence of hybridization errors. , 2000, Genome informatics. Workshop on Genome Informatics.

[16]  Eli Upfal,et al.  Sequencing-by-Hybridization at the Information-Theory Bound: An Optimal Algorithm , 2000, J. Comput. Biol..

[17]  R. Drmanac,et al.  Sequencing of megabase plus DNA by hybridization: theory of the method. , 1989, Genomics.