The well-known Smith–Waterman (SW) algorithm is the most commonly used method for local sequence alignments, but its acceptance is limited by the computational requirements for large protein databases. Although the acceleration of SW has already been studied on many parallel platforms, there are hardly any studies which take advantage of the latest Intel architectures based on AVX-512 vector extensions. This SIMD set is currently supported by Intel’s Knights Landing (KNL) accelerator and Intel’s Skylake (SKL) general purpose processors. In this paper, we present an SW version that is optimized for both architectures: the renowned SWIMM 2.0. The novelty of this vector instruction set requires the revision of previous programming and optimiza...
Precision medicine holds promise for improving healthcare by leveraging genomic information. Due to ...
Biological sequence comparison is one of the most important tasks in Bioinformatics. Due to the grow...
The well-known Smith–Waterman algorithm is a high-sensitivity method for local sequence alignment. U...
The well-known Smith–Waterman (SW) algorithm is the most commonly used method for local sequence ali...
Alignment is essential in many areas such as biological, chemical and criminal forensics. The well‐k...
Summary Alignment is essential in many areas such as biological, chemical and criminal forensics. Th...
Abstract: Efficient sequence alignment is one of the most important and challenging activities in bi...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. Unfo...
Abstract Background We present swps3, a vectorized implementation of the Smith-Waterman local alignm...
The comparison and alignment of DNA and protein sequences are important tasks in molecular biology a...
Bioinformatics is one of the areas affected by current HPC problems due to the exponential growth of...
With the greater importance of parallel architectures such as GPUs or Xeon Phi accelerators, the sci...
The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. Howe...
Precision medicine holds promise for improving healthcare by leveraging genomic information. Due to ...
Biological sequence comparison is one of the most important tasks in Bioinformatics. Due to the grow...
The well-known Smith–Waterman algorithm is a high-sensitivity method for local sequence alignment. U...
The well-known Smith–Waterman (SW) algorithm is the most commonly used method for local sequence ali...
Alignment is essential in many areas such as biological, chemical and criminal forensics. The well‐k...
Summary Alignment is essential in many areas such as biological, chemical and criminal forensics. Th...
Abstract: Efficient sequence alignment is one of the most important and challenging activities in bi...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
Background: The Smith-Waterman (SW) algorithm is the best choice for searching similar regions betwe...
The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. Unfo...
Abstract Background We present swps3, a vectorized implementation of the Smith-Waterman local alignm...
The comparison and alignment of DNA and protein sequences are important tasks in molecular biology a...
Bioinformatics is one of the areas affected by current HPC problems due to the exponential growth of...
With the greater importance of parallel architectures such as GPUs or Xeon Phi accelerators, the sci...
The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. Howe...
Precision medicine holds promise for improving healthcare by leveraging genomic information. Due to ...
Biological sequence comparison is one of the most important tasks in Bioinformatics. Due to the grow...
The well-known Smith–Waterman algorithm is a high-sensitivity method for local sequence alignment. U...