EUVIMEDEUVIMED entdecken
Crossref

SeedHit: A GPU Friendly Pre-Align Filtering Algorithm

Zhen Ju, Jingjing Zhang, Xuelei Li, Jintao Meng, Yanjie Wei

IEEE/ACM Transactions on Computational Biology and Bioinformatics · 2024

DOI: 10.1109/tcbb.2024.3417517 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2024. Verfasst von Zhen Ju und 4 weiteren Autor:innen. Hauptthemen laut MEDLINE: Algorithms, High-Throughput Nucleotide Sequencing, Computer Graphics, Sequence Alignment. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 27 Literaturangaben. Gefördert von: Youth Innovation Promotion Association, CAS, Key Research and Development Project of Guangdong Province.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

AlgorithmsHigh-Throughput Nucleotide SequencingComputer GraphicsSequence AlignmentComputational BiologySequence Analysis, DNASoftware

Förderung

  • Youth Innovation Promotion Association
  • CAS
  • Key Research and Development Project of Guangdong Province
  • National Key Research and Development Program of China
  • Strategic Priority CAS
  • National Natural Science Foundation of China
  • Shenzhen Basic Research Fund
  • Shenzhen Key Laboratory of Intelligent Bioinformatics

Zitieren

APA

Ju, Z., Zhang, J., Li, X., Meng, J., & Wei, Y. (2024). SeedHit: A GPU Friendly Pre-Align Filtering Algorithm. IEEE/ACM Transactions on Computational Biology and Bioinformatics. https://doi.org/10.1109/tcbb.2024.3417517

Vancouver

Ju Z, Zhang J, Li X, Meng J, Wei Y. SeedHit: A GPU Friendly Pre-Align Filtering Algorithm. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2024. doi:10.1109/tcbb.2024.3417517

BibTeX
@article{Ju2024,
  author = {Ju, Zhen and Zhang, Jingjing and Li, Xuelei and Meng, Jintao and Wei, Yanjie},
  title = {SeedHit: A GPU Friendly Pre-Align Filtering Algorithm},
  journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
  year = {2024},
  doi = {10.1109/tcbb.2024.3417517}
}
Kostenlos starten →