title: A graph theoretic approach to the analysis of DNA sequencing data.
abstract: The analysis of data from automated DNA sequencing instruments has been a limiting factor in the development of new sequencing technology. A new base-calling algorithm that is intended to be independent of any particular sequencing technology has been developed and shown to be effective with data from the Applied Biosystems 373 sequencing system. This algorithm makes use of a nonlinear deconvolution filter to detect likely oligomer events and a graph theoretic editing strategy to find the subset of those events that is most likely to correspond to the correct sequence. Metrics evaluating the quality and accuracy of the resulting sequence are also generated and have been shown to be predictive of measured error rates. Compared to the Applied Biosystems Analysis software, this algorithm generates 18% fewer insertion errors, 80% more deletion errors, and 4% fewer mismatches. The tradeoff between different types of errors can be controlled through a secondary editing step that inserts or deletes base calls depending on their associated confidence values.
authors.affiliation: Department of Biochemistry B403, Stanford University School of Medicine, California 94305-5307, USA. aberno@genome.stanford.edu
authors.forename: A J
authors.initials: AJ
authors.lastname: Berno
mesh_terms: D000465:Algorithms; D004247:DNA; D017421:Sequence Analysis
chemical_list: D004247:DNA