Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Efficient solutions for bioinformatics applications using GPUs

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • معلومة اضافية
    • بيانات النشر:
      The University of Hong Kong (Pokfulam, Hong Kong)
    • الموضوع:
      2015
    • Collection:
      University of Hong Kong: HKU Scholars Hub
    • نبذة مختصرة :
      Over the past few years, DNA sequencing technology has been advancing at such a fast pace that computer hardware and software can hardly meet the ever-increasing demand for sequence analysis. A natural approach to boost analysis efficiency is parallelization, which divides the problem into smaller ones that are to be solved simultaneously on multiple execution units. Common architectures such as multi-core CPUs and clusters can increase the throughput to some extent, but the hardware setup and maintenance costs are prohibitive. Fortunately, the newly emerged general-purpose GPU programming paradigm gives us a low-cost alternative for parallelization. This thesis presents GPU-accelerated algorithms for several problems in bioinformatics, along with implementations to demonstrate their power in handling enormous totally different limitations and optimization techniques than the CPU. The first tool presented is SOAP3-dp, which is a DNA short-read aligner highly optimized for speed. Prior to SOAP3-DP, the fastest short-read aligner was its predecessor SOAP2, which was capable of aligning 1 million 100-bp reads in 5 minutes. SOAP3-dp beats this record by aligning the same volume in only 10 seconds. The key to unlocking this unprecedented speed is the revamped BWT engine underlying SOAP3-dp. All data structures and associated operations have been tailor made for the GPU to achieve optimized performance. Experiments show that SOAP3-dp not only excels in speed, but also outperforms other aligners in both alignment sensitivity and accuracy. The next tools are for constructing data structures, namely Burrows-Wheeler transform (BWT) and de Bruijn graphs (DBGs), to facilitate genome assembly of short reads, especially large metagenomics data. The BWT index for a set of short reads has recently found its use in string-graph assemblers [44], as it provides a succinct way of representing huge string graphs which would otherwise exceed the main memory limit. Constructing the BWT index for a million reads is by itself not an ...
    • Relation:
      HKU Theses Online (HKUTO); Liu, C. [廖志敏]. (2015). Efficient solutions for bioinformatics applications using GPUs. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5481889; b5481889; http://hdl.handle.net/10722/211138
    • الدخول الالكتروني :
      http://hdl.handle.net/10722/211138
    • Rights:
      This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. ; The author retains all proprietary rights, (such as patent rights) and the right to use in future works.
    • الرقم المعرف:
      edsbas.62C29373