SneakySnake: a fast and accurate universal genome pre-alignment filter for CPUs, GPUs and FPGAs

Author:

Alser Mohammed12ORCID,Shahroodi Taha1,Gómez-Luna Juan12,Alkan Can3,Mutlu Onur1234

Affiliation:

1. Department of Computer Science, ETH Zurich, Zurich 8006, Switzerland

2. Department of Information Technology and Electrical Engineering, ETH Zurich, Zurich 8006, Switzerland

3. Department of Computer Engineering, Bilkent University, Ankara 06800, Turkey

4. Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA 15213, USA

Abstract

Abstract 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 matching (ASM) problem to the single net routing (SNR) problem in VLSI chip layout. In the SNR problem, we are interested in finding the optimal path that connects two terminals with the least routing cost on a special grid layout that contains obstacles. The SneakySnake algorithm quickly solves the SNR problem and uses the found optimal path to decide whether or not performing sequence alignment is necessary. Reducing the ASM problem into SNR also makes SneakySnake efficient to implement on CPUs, GPUs and FPGAs. Results SneakySnake significantly improves the accuracy of pre-alignment filtering by up to four orders of magnitude compared to the state-of-the-art pre-alignment filters, Shouji, GateKeeper and SHD. For short sequences, SneakySnake accelerates Edlib (state-of-the-art implementation of Myers’s bit-vector algorithm) and Parasail (state-of-the-art sequence aligner with a configurable scoring function), by up to 37.7× and 43.9× (>12× on average), respectively, with its CPU implementation, and by up to 413× and 689× (>400× on average), respectively, with FPGA and GPU acceleration. For long sequences, the CPU implementation of SneakySnake accelerates Parasail and KSW2 (sequence aligner of minimap2) by up to 979× (276.9× on average) and 91.7× (31.7× on average), respectively. As SneakySnake does not replace sequence alignment, users can still obtain all capabilities (e.g. configurable scoring functions) of the aligner of their choice, unlike existing acceleration efforts that sacrifice some aligner capabilities. Availabilityand implementation https://github.com/CMU-SAFARI/SneakySnake. Supplementary information Supplementary data are available at Bioinformatics online.

Funder

Semiconductor Research Corporation grant

EMBO Installation Grant

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Molecular Biology,Biochemistry,Statistics and Probability

Reference35 articles.

1. GateKeeper: a new hardware architecture for accelerating pre-alignment in DNA short read mapping;Alser;Bioinformatics,2017

2. MAGNET: understanding and improving the accuracy of genome pre-alignment filtering;Alser;Trans. Internet Res,2017

3. Shouji: a fast and efficient pre-alignment filter for sequence alignment;Alser;Bioinformatics,2019

4. Accelerating genome analysis: a primer on an ongoing journey;Alser;IEEE Micro,2020

5. Technology dictates algorithms: recent developments in read alignment;Alser;arXiv Preprint arXiv : 2003.00110,2020

Cited by 37 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. QUETZAL: Vector Acceleration Framework for Modern Genome Sequence Analysis Algorithms;2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA);2024-06-29

2. GateKeeper-GPU: Fast and Accurate Pre-Alignment Filtering in Short Read Mapping;IEEE Transactions on Computers;2024-05

3. TALCO: Tiling Genome Sequence Alignment Using Convergence of Traceback Pointers;2024 IEEE International Symposium on High-Performance Computer Architecture (HPCA);2024-03-02

4. Efficient Memory Layout for Pre-Alignment Filtering of Long DNA Reads Using Racetrack Memory;IEEE Computer Architecture Letters;2024-01

5. GMX: Instruction Set Extensions for Fast, Scalable, and Efficient Genome Sequence Alignment;56th Annual IEEE/ACM International Symposium on Microarchitecture;2023-10-28

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3