Base Calling for High-Throughput Short-Read Sequencing: Dynamic Programming Solutions

Access full-text files

Date

2013-04

Authors

Das, Shreepriya
Vikalo, Haris

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Next-generation DNA sequencing platforms are capable of generating millions of reads in a matter of days at rapidly reducing costs. Despite its proliferation and technological improvements, the performance of next-generation sequencing remains adversely affected by the imperfections in the underlying biochemical and signal acquisition procedures. To this end, various techniques, including statistical methods, are used to improve read lengths and accuracy of these systems. Development of high performing base calling algorithms that are computationally efficient and scalable is an ongoing challenge. Results: We develop model-based statistical methods for fast and accurate base calling in Illumina's next-generation sequencing platforms. In particular, we propose a computationally tractable parametric model which enables dynamic programming formulation of the base calling problem. Forward-backward and soft-output Viterbi algorithms are developed, and their performance and complexity are investigated and compared with the existing state-of-the-art base calling methods for this platform. A C code implementation of our algorithm named Softy can be downloaded from https://sourceforge.net/projects/dynamicprog. Conclusion: We demonstrate high accuracy and speed of the proposed methods on reads obtained using Illumina's Genome Analyzer II and HiSeq2000. In addition to performing reliable and fast base calling, the developed algorithms enable incorporation of prior knowledge which can be utilized for parameter estimation and is potentially beneficial in various downstream applications.

Description

LCSH Subject Headings

Citation

Das, Shreepriya, and Haris Vikalo. "Base calling for high-throughput short-read sequencing: dynamic programming solutions." BMC bioinformatics, Vol. 14, No. 1 (Apr., 2013): 129.