English
Related papers

Related papers: GateKeeper-GPU: Fast and Accurate Pre-Alignment Fi…

200 papers

Motivation: High throughput DNA sequencing (HTS) technologies generate an excessive number of small DNA segments -- called short reads -- that cause significant computational burden. To analyze the entire genome, each of the billions of…

Genomics · Quantitative Biology 2020-09-29 Mohammed Alser , Hasan Hassan , Hongyi Xin , Oğuz Ergin , Onur Mutlu , Can Alkan

Motivation: Read mapping is a computationally expensive process and a major bottleneck in genomics analyses. The performance of read mapping is mainly limited by the performance of three key computational steps: Index Querying, Seed…

Hardware Architecture · Computer Science 2023-10-02 Julien Eudine , Mohammed Alser , Gagandeep Singh , Can Alkan , Onur Mutlu

Calculating the similarities between a pair of genomic sequences is one of the most fundamental computational steps in genomic analysis. This step -- called sequence alignment -- is the computational bottleneck because: (1) it is…

Genomics · Quantitative Biology 2019-10-10 Mohammed H K Alser

Genome sequencing has become a central focus in computational biology. A genome study typically begins with sequencing, which produces millions to billions of short DNA fragments known as reads. Read mapping aligns these reads to a…

With the recent move towards sequencing of accurate long reads, finding solutions that support efficient analysis of these reads becomes more necessary. The long execution time required for sequence alignment of long reads negatively…

Hardware Architecture · Computer Science 2023-10-25 Taha Shahroodi , Michael Miao , Joel Lindegger , Stephan Wong , Onur Mutlu , Said Hamdioui

The cost of DNA sequencing has dropped exponentially over the past decade, making genomic data accessible to a growing number of scientists. In bioinformatics, localization of short DNA sequences (reads) within large genomic sequences is…

Genomics · Quantitative Biology 2021-06-16 Robin Kobus , André Müller , Daniel Jünger , Christian Hundt , Bertil Schmidt

Sequential models, such as Recurrent Neural Networks and Neural Ordinary Differential Equations, have long suffered from slow training due to their inherent sequential nature. For many years this bottleneck has persisted, as many thought…

Machine Learning · Computer Science 2024-01-17 Yi Heng Lim , Qi Zhu , Joshua Selfridge , Muhammad Firmansyah Kasim

Motivation: The ability to generate massive amounts of sequencing data continues to overwhelm the processing capability of existing algorithms and compute infrastructures. In this work, we explore the use of hardware/software co-design and…

Computational Engineering, Finance, and Science · Computer Science 2020-10-29 Mohammed Alser , Hasan Hassan , Akash Kumar , Onur Mutlu , Can Alkan

The continually increasing volume of DNA sequence data has resulted in a growing demand for fast implementations of core algorithms. Computation of pairwise alignments between candidate haplotypes and sequencing reads using Pair-HMMs is a…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-27 Bertil Schmidt , Felix Kallenborn , Alexander Wichmann , Alejandro Chacon , Christian Hundt

Sequence alignment is a fundamental process in computational biology which identifies regions of similarity in biological sequences. With the exponential growth in the volume of data in bioinformatics databases, the time, processing power,…

Hardware Architecture · Computer Science 2025-07-31 Nasrin Akbari , Mehdi Modarressi , Alireza Khadem

Motivation: We introduce SneakySnake, a highly parallel and highly accurate pre-alignment filter that remarkably reduces the need for computationally costly sequence alignment. The key idea of SneakySnake is to reduce the approximate string…

Genomics · Quantitative Biology 2023-11-21 Mohammed Alser , Taha Shahroodi , Juan Gomez-Luna , Can Alkan , Onur Mutlu

We improve on GenASM, a recent algorithm for genomic sequence alignment, by significantly reducing its memory footprint and bandwidth requirement. Our algorithmic improvements reduce the memory footprint by 24$\times$ and the number of…

Hardware Architecture · Computer Science 2022-03-30 Joël Lindegger , Damla Senol Cali , Mohammed Alser , Juan Gómez-Luna , Onur Mutlu

DNA read mapping is a computationally expensive bioinformatics task, required for genome assembly and consensus polishing. It requires to find the best-fitting location for each DNA read on a long reference sequence. A novel resistive…

Genomics · Quantitative Biology 2019-01-29 Roman Kaplan , Leonid Yavits , Ran Ginosar

With the advance in genome sequencing technology, the lengths of deoxyribonucleic acid (DNA) sequencing results are rapidly increasing at lower prices than ever. However, the longer lengths come at the cost of a heavy computational burden…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-03-12 Seongyeon Park , Junguk Hong , Jaeyong Song , Hajin Kim , Youngsok Kim , Jinho Lee

Subgraph matching, which finds subgraphs isomorphic to a query, is the key to information retrieval from data represented as a graph. To avoid redundant exploration in the data, existing methods restrict the search space by extracting…

Databases · Computer Science 2023-06-13 Junya Arai , Yasuhiro Fujiwara , Makoto Onizuka

In recent years, the rapidly increasing number of reads produced by next-generation sequencing (NGS) technologies has driven the demand for efficient implementations of sequence alignments in bioinformatics. However, current…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-17 André Müller , Bertil Schmidt , Richard Membarth , Roland Leißa , Sebastian Hack

Graph-based Approximate Nearest Neighbor Search (ANNS) is widely adopted in numerous applications, such as recommendation systems, natural language processing, and computer vision. While recent works on GPU-based acceleration have…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-07-24 Sukjin Kim , Seongyeon Park , Si Ung Noh , Junguk Hong , Taehee Kwon , Hunseong Lim , Jinho Lee

Genome sequence analysis has enabled significant advancements in medical and scientific areas such as personalized medicine, outbreak tracing, and the understanding of evolution. Unfortunately, it is currently bottlenecked by the…

The proliferation of high-throughput sequencing machines ensures rapid generation of up to billions of short nucleotide fragments in a short period of time. This massive amount of sequence data can quickly overwhelm today's storage and…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-11-13 Subho S. Banerjee , Mohamed El-Hadedy , Jong Bin Lim , Zbigniew T. Kalbarczyk , Deming Chen , Steve Lumetta , Ravishankar K. Iyer

The advent of next-generation sequencing (NGS) has revolutionized genomic research by enabling cost-effective, high-throughput sequencing of a diverse range of organisms. This breakthrough has unleashed a "Cambrian explosion" in genomic…

‹ Prev 1 2 3 10 Next ›