Year: 2024
Type: article
Abstract: The rapid advancements in sequencing length necessitate the adoption of increasingly efficient sequence alignment algorithms. The Needleman-Wunsch method introduces the foundational dynamic-programming 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 and implementation: Source codes are available at https://github.com/bxskdh/TSTA.
Source: Gigabyte
Authors: Peiyu Zong, Wenpeng Deng, Jian Liu, Jue Ruan
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: gold
Estimated APC paid: $350
Award: G8160189100
OpenAlex ID: W4404071015
