GPU-Based Cloud Service for Smith-Waterman Algorithm Using Frequency Distance Filtration Scheme
As the conventional means of analyzing the similarity between a query sequence and database sequences, the Smith-Waterman algorithm is feasible for a database search owing to its high sensitivity. However, this algorithm is still quite time consuming. CUDA programming can improve computations effici...
Main Authors: | Sheng-Ta Lee, Chun-Yuan Lin, Che Lun Hung |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2013-01-01
|
Series: | BioMed Research International |
Online Access: | http://dx.doi.org/10.1155/2013/721738 |
Similar Items
-
Accelerating Smith-Waterman Alignment for Protein Database Search Using Frequency Distance Filtration Scheme Based on CPU-GPU Collaborative System
by: Yu Liu, et al.
Published: (2015-01-01) -
Efficient Parallel Smith-Waterman Algorithm with the Filtration by using CUDA and Frequency Distance
by: Jen Cheng Huang, et al.
Published: (2012) -
MR-CUDASW - GPU accelerated Smith-Waterman algorithm for medium-length (meta)genomic data
Published: (2015) -
Sequence Alignment With An Improved Smith-Waterman Algorithm
by: Ying-Chuan Chen, et al.
Published: (2003) -
An Improved Smith-Waterman Algorithm Based on Spark Parallelization
by: Yanfeng Liu, et al.
Published: (2019-03-01)