A Parallel Algorithm for Error Correction in High-Throughput Short-Read Data on CUDA-Enabled Graphics Hardware

摘要

Abstract Emerging DNA sequencing technologies open up exciting new opportunities for genome sequencing by generating read data with a massive throughput. However, produced reads are significantly shorter and more error-prone compared to the traditional Sanger shotgun sequencing method. This poses challenges for de novo DNA fragment assembly algorithms in terms of both accuracy (to deal with short, error-prone reads) and scalability (to deal with very large input data sets). In this article, we present a scalable parallel algorithm for correcting sequencing errors in high-throughput short-read data so that error-free reads can be available before DNA fragment assembly, which is of high importance to many graph-based short-read assembly tools. The algorithm is based on spectral alignment and uses the Compute Unified Device Architecture (CUDA) programming model. To gain efficiency we are taking advantage of the CUDA texture memory using a space-efficient Bloom filter data structure for spectrum membership qu..." /> rel="meta" type="application/atom+xml" href="http://dx.doi.org/10.1089%2Fcmb.2009.0062" /> rel="meta" type="application/rdf+json" href="http://dx.doi.org/10.1089%2Fcmb.2009.0062" /> rel="meta" type="application/unixref+xml" href="http://dx.doi.org/10.1089%2Fcmb.2009.0062" /> 展开▼