Base calling for high-throughput short-read sequencing: dynamic programming solutions

dc.creatorDas, Shreepriyaen
dc.creatorVikalo, Harisen
dc.descriptionShreepriya Das and Haris Vikalo are with the Electrical and Computer Engineering Department, The University of Texas at Austin, Austin, Texas 78712, USAen
dc.description.abstractBackground: 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 webcite. Conclusions: 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.en
dc.description.departmentElectrical and Computer Engineeringen
dc.identifier.citationDas, Shreepriya, and Haris Vikalo. “Base Calling for High-Throughput Short-Read Sequencing: Dynamic Programming Solutions.” BMC Bioinformatics 14, no. 1 (April 15, 2013): 129. doi:10.1186/1471-2105-14-129.en
dc.publisherBMC Bioinformaticsen
dc.rightsAdministrative deposit of works to UT Digital Repository: This works author(s) is or was a University faculty member, student or staff member; this article is already available through open access at The public license is specified as CC-BY: The library makes the deposit as a matter of fair use (for scholarly, educational, and research purposes), and to preserve the work and further secure public access to the works of the University.en
dc.subjectDNA sequencingen
dc.subjectnext-generation sequencingen
dc.subjectbiochemical and signal acquistions proceduruesen
dc.subjectbase calling algorithmsen
dc.titleBase calling for high-throughput short-read sequencing: dynamic programming solutionsen
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
619.15 KB
Adobe Portable Document Format