henhaobio
Sign in

GigabyteBioinformaticsPeer-reviewed journal article

TSTA: Thread and SIMD-Based Trapezoidal Pairwise/Multiple Sequence Alignment Method

Peiyu Zong, Wenpeng Deng, Jian Liu, Jue RuaniD

PDFDOIPreprintCode

Abstract

AbstractsThe rapid advancements in sequencing length necessitate the adoption of increasingly efficient sequence alignment algorithms. The Needleman-Wunsch method introduces the foundational dynamic programming (DP) matrix calculation for global alignment, which evaluates the overall alignment of sequences. However, this method is known to be highly time-consuming. The proposed TSTA algorithm leverages both vector-level and thread-level parallelism to accelerate pairwise and multiple sequence alignments. Availability & ImplementationSource code are available at https://github.com/bxskdh/TSTA.

Citations
3
FWCI
0.41
Field percentile
top 45%

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISLiu '21Kallenborn '26Shao '24Doblas '25Koerkamp '24López‐Ville '26
68% semantic matchBioinformatics
Daniel Liu, Martin Steinegger·bioRxiv·Nov 8, 2021· 6 citations