title: GPU-based cloud service for Smith-Waterman algorithm using frequency distance filtration scheme.
abstract: 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.
authors: Department of Computer Science and Information Engineering, Chang Gung University, No. 259 Sanmin Road, Guishan, Taoyuan 33302, Taiwan.
authors: Sheng-Ta
authors: ST
authors: Lee
authors: Chun-Yuan
authors: CY
authors: Lin
authors: Che Lun
authors: CL
authors: Hung
mesh_terms: D000465:Algorithms; D003196:Computer Graphics; D030562:Databases, Protein; D006801:Humans; D020407:Internet; D013997:Time Factors
references: Proc Natl Acad Sci U S A. 1992 Nov 15;89(22):10915-9
references: 1438297
references: BMC Bioinformatics. 2008 Mar 26;9 Suppl 2:S10
references: 18387198
references: Comput Appl Biosci. 1997 Apr;13(2):145-50
references: 9146961
references: Bioinformatics. 2005 Aug 15;21(16):3431-2
references: 15919726
references: Bioinformatics. 2000 Aug;16(8):699-706
references: 11099256
references: J Mol Biol. 1990 Oct 5;215(3):403-10
references: 2231712
references: Bioinformatics. 2004 Sep 1;20(13):2122-34
references: 15073002
references: BMC Res Notes. 2010 Apr 06;3:93
references: 20370891
references: BMC Res Notes. 2009 May 06;2:73
references: 19416548
references: BMC Bioinformatics. 2008 Sep 17;9:377
references: 18798993
references: Proc Natl Acad Sci U S A. 1988 Apr;85(8):2444-8
references: 3162770
references: J Mol Biol. 1982 Dec 15;162(3):705-8
references: 7166760
references: Nucleic Acids Res. 1997 Sep 1;25(17):3389-402
references: 9254694
references: J Mol Biol. 1981 Mar 25;147(1):195-7
references: 7265238
references: Bioinformatics. 2007 Jan 15;23(2):156-61
references: 17110365
references: BMC Res Notes. 2008 Oct 29;1:107
references: 18959793
references: BMC Bioinformatics. 2007 Jun 07;8:185
references: 17555593