Ph.D DISSERTATION: “Accelerating the understanding of life\u2019s code through better algorithms and hardware design”<\/p>\n
Mohammed H.K. Alser
\nPh.D Candidate
\n(Supervisor: Asst. Prof. Dr. Can Alkan)
\nComputer Engineering Department<\/p>\n
Our understanding of human genomes today is affected by the ability of modern computing technology to quickly and accurately determine an individual\u2019s entire genome. Over the past decade, high throughput sequencing (HTS) technologies have opened the door to remarkable biomedical discoveries through its ability to generate hundreds of millions to billions of DNA segments per run along with a substantial reduction in time and cost. However, this flood of sequencing data continues to overwhelm the processing capacity of existing algorithms and hardware. To analyze a patient\u2019s genome, each of these segments – called reads \u2013 must be mapped to a reference genome based on the similarity between a read and \u201ccandidate\u201d locations in that reference genome. The similarity measurement, called alignment, formulated as an approximate string matching problem, is the computational bottleneck because: (1) it is implemented using quadratic-time dynamic programming algorithms, and (2) the majority of candidate locations in the reference genome do not align with a given read due to high dissimilarity. Calculating the alignment of such incorrect candidate locations consumes an overwhelming majority of a modern read mapper\u2019s execution time. Therefore, it is crucial to develop a fast and effective filter that can detect incorrect candidate locations and eliminate them before invoking computationally costly alignment algorithms.<\/p>\n
In this thesis, we introduce four new algorithms that function as a pre-alignment step and aim to filter out most incorrect candidate locations. The first key idea of our proposed pre-alignment filters is to provide high filtering accuracy by correctly detecting all similar segments shared between two sequences. The second key idea is to exploit the massively parallel architecture of modern FPGAs for accelerating three of our proposed filtering algorithms, GateKeeper, SLIDER, and MAGNET. We call our fourth algorithm SneakySnake and we mainly develop it for commodity desktops and servers, which are largely available to bioinformaticians without the hassle of handling hardware complexity. We evaluate the benefits and downsides of our pre-alignment filtering approach in detail using 12 real datasets across different read length and edit distance thresholds. In our evaluation, we demonstrate that our hardware pre-alignment filters show, on average, 170x – 7000x speedup over their equivalent CPU implementations. We also demonstrate that integrating our hardware pre-alignment filters with the state-of-the-art read aligners reduces the aligner\u2019s execution time by 4x to 217x depending on the edit distance threshold. Finally, we show that efficient CPU implementation of pre-alignment filtering still provides significant benefits. We show that SneakySnake on average reduces the execution time of the best performing CPU-based read aligner, by up to 77x. The key conclusion of this thesis is that developing a fast and efficient filtering heuristic, and developing a better understanding of its accuracy together leads to significant reduction in read alignment\u2019s execution time, without sacrificing any of the aligner\u2019 capabilities. We hope and believe that our new architectures and algorithms catalyze their adoption in existing and future genome analysis pipelines.<\/p>\n
DATE: 08 June 2018, Friday @ 10:00
\nPLACE: EA-409 <\/p>\n","protected":false},"excerpt":{"rendered":"
Ph.D DISSERTATION: “Accelerating the understanding of life\u2019s code through better algorithms and hardware design” Mohammed H.K. Alser Ph.D Candidate (Supervisor: Asst. Prof. Dr. Can Alkan) Computer Engineering Department Our understanding of human genomes today is affected by the ability of modern computing technology to quickly and accurately determine an individual\u2019s [\u2026] <\/p>\n