The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. However, SW is expensive in terms of both execution time and ...
Abstract—The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. However, SW is expensive in terms of both execution ...
Jul 31, 2022 · The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. However, SW is expensive in terms of both ...
In this paper we have explored SW acceleration on a heterogeneous platform equipped with an Intel Xeon Phi coprocessor. Our evaluation, using the well-known ...
The well-known Smith-Waterman (SW) algorithm is a high-sensitivity method for local alignments. However, SW is expensive in terms of both execution time and ...
Smith-Waterman algorithm on heterogeneous systems: A case study. Rucci, Enzo, De Giusti, Armando, Naiouf, Marcelo, Botella, Guillermo ...
We compare three accelerated implementations of the widely used BWA-MEM genomic mapping tool as a case study on design-time optimization for heterogeneous ...
Smith-Waterman algorithm on heterogeneous systems: A case study. E Rucci, A De Giusti, M Naiouf, G Botella, C García, M Prieto-Matias. 2014 IEEE international ...
People also ask
What is the Smith-Waterman algorithm used for?
What is the difference between Smith-Waterman algorithm and the Needleman-Wunsch algorithm?
What type of string matching is the Smith-Waterman algorithm commonly used for?
What are the advantages of the Smith-Waterman algorithm?
Three accelerated implementations of the widely used BWA-MEM genomic mapping tool are compared as a case study on design-time optimization for heterogeneous ...
Sep 6, 2021 · This is a process-level parallelization approach that is commonly used to achieve parallels in distributed memory systems. Message-passing ...
Missing: study. | Show results with:study.