Department of Computer Science and Information Engineering, Chang Gung University, No. 259 Sanmin Road, Guishan, Taoyuan 33302, Taiwan.
Biomed Res Int. 2013;2013:721738. doi: 10.1155/2013/721738. Epub 2013 Apr 3.
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 efficiently by using the computational power of massive computing hardware as graphics processing units (GPUs). This work presents a novel Smith-Waterman algorithm with a frequency-based filtration method on GPUs rather than merely accelerating the comparisons yet expending computational resources to handle such unnecessary comparisons. A user friendly interface is also designed for potential cloud server applications with GPUs. Additionally, two data sets, H1N1 protein sequences (query sequence set) and human protein database (database set), are selected, followed by a comparison of CUDA-SW and CUDA-SW with the filtration method, referred to herein as CUDA-SWf. Experimental results indicate that reducing unnecessary sequence alignments can improve the computational time by up to 41%. Importantly, by using CUDA-SWf as a cloud service, this application can be accessed from any computing environment of a device with an Internet connection without time constraints.
作为分析查询序列和数据库序列之间相似性的传统方法,Smith-Waterman 算法由于其高灵敏度,适用于数据库搜索。然而,该算法仍然非常耗时。CUDA 编程可以通过利用大量计算硬件(图形处理单元,GPU)的计算能力来有效地提高计算效率。本工作在 GPU 上提出了一种基于频率的过滤方法的新型 Smith-Waterman 算法,而不是仅仅加速比较,而是消耗计算资源来处理这些不必要的比较。还为具有 GPU 的潜在云服务器应用程序设计了一个用户友好的界面。此外,选择了两个数据集,H1N1 蛋白序列(查询序列集)和人类蛋白数据库(数据库集),然后对 CUDA-SW 和具有过滤方法的 CUDA-SW(称为 CUDA-SWf)进行了比较。实验结果表明,减少不必要的序列比对可以将计算时间提高高达 41%。重要的是,通过将 CUDA-SWf 用作云服务,此应用程序可以从具有 Internet 连接的任何设备的任何计算环境访问,而不受时间限制。