返回
SeedHit: A GPU Friendly Pre-Align Filtering Algorithm
DOI:10.1109/TCBB.2024.3417517.png)
摘要
En 中文
The amount of genetic data generated by Next Generation Sequencing (NGS) technologies grows faster than Moore's law. This necessitates the development of efficient NGS data processing and analysis algorithms. A filter before the computationally-costly analysis step can significantly reduce the run time of the NGS data analysis. As GPUs are orders of magnitude more powerful than CPUs, this paper proposes a GPU-friendly pre-align filtering algorithm named SeedHit for the fast processing of NGS data. Inspired by BLAST, SeedHit counts seed hits between two sequences to determine their similarity. In SeedHit, a nucleic acid in a gene sequence is presented in binary format. By packaging data and generating a lookup table that fits into the L1 cache, SeedHit is GPU-friendly and high-throughput. Using three 16 s rRNA datasets from Greengenes as input SeedHit can reject 84%-89% dissimilar sequence pairs on average when the similarity is 0.9-0.99. The throughput of SeedHit achieved 1 T/s (Tera base per second) on 3080 Ti. Compared with the other two GPU-based filtering algorithms, GateKeeper and SneakySnake, SeedHit has the highest rejection rate and throughput. By incorporating SeedHit into our in-house clustering algorithm nGIA, the modified nGIA achieved a 1.6-2.1 times speedup compared to the original version.
Keyword:
Filtering algorithms
Graphics processing units
Throughput
Logic gates
Filtering
Clustering algorithms
Buildings
GPU
pre-align filter
seed hit
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
Characterization of polymer matrix and low melting point solder for anisotropic conductive film各向异性导电膜用聚合物基体及低熔点焊料的表征
nGIA: A novel Greedy Incremental Alignment based algorithm for gene sequence clusteringnGIA: 一种新的基于贪婪增量对齐的基因序列聚类算法

