Abstract The Needleman-Wunsch (NW) is a dynamic programming algorithm used in the
pairwise global alignment of two biological sequences. In this paper, three sets of parallel …

Graphics processing units (GPUs) are increasingly critical for general-purpose parallel
processing performance. GPU hardware is composed of many streaming multiprocessors …

Sequence alignment is a critical computational problem in various domains, including
genomics, proteomics, and natural language processing. The Needleman‐Wunsch (NW) …

In computational biology, biological database search has been playing a very important role.
Since the COVID-19 outbreak, it has provided significant help in identifying common …

Bioinformatics is a discipline that applies the principles of computer science, mathematics,
and engineering to answer questions related to Biology [1]. Notably, the pairwise sequence …

String matching problems such as sequence alignment is one of the fundamental problems
in many computer since fields such as natural language processing (NLP) and …

Graphic processing units (GPUs) are composed of a group of single-instruction multiple data
(SIMD) streaming multiprocessors (SMs). GPUs are able to efficiently execute highly data …

Sequence comparison problems such as sequence alignment and approximate string
matching are part of the fundamental problems in many fields such as natural language …

We develop novel single-GPU parallelisations of the Smith-Waterman algorithm for pairwise
sequence alignment. Our algorithms, which are suitable for the alignment of a single pair of …

Over the recent decades, bioinformatics has acquired a major concern due to the rapid
growth in biological data that includes protein structures and genome sequences. Many …