2014 · 37 citations · 19 references
ComputingBioinformaticsComputer ScienceComputational BiologyParallel ComputingSequence AnalysisComputational GenomicsData ParallelismGraphics Processing Unit ComputingParallel ArchitecturesParallel Performance AnalysisSequence AlignmentCircular BuffersExecution Time AnalysisMulti-gpu ArchitecturesMulti-gpu ComputingMulti-gpu SystemsSequence ComparisonSmith - Waterman AlgorithmSmith-waterman Algorithm
This paper proposes and evaluates a parallel strategy to execute the exact Smith-Waterman (SW) biological sequence comparison algorithm for huge DNA sequences in multi-GPU platforms. In our strategy, the computation of a single huge SW matrix is spread over multiple GPUs, which communicate border elements to the neighbour, using a circular buffer mechanism. We also provide a method to predict the execution time and speedup of a comparison, given the number of the GPUs and the sizes of the sequences. The results obtained with a large multi-GPU environment show that our solution is scalable when varying the sizes of the sequences and/or the number of GPUs and that our prediction method is accurate. With our proposal, we were able to compare the largest human chromosome with its homologous chimpanzee chromosome (249 Millions of Base Pairs (MBP) x 228 MBP) using 64 GPUs, achieving 1.7 TCUPS (Tera Cells Updated per Second). As far as we know, this is the largest comparison ever done using the Smith-Waterman algorithm.
19
An improved algorithm for matching biological sequences
Osamu Gotoh · Journal of Molecular Biology · 1982 · 1.8K citations
Bioinformatics: sequence and genome analysis
Choice Reviews Online · 2001 · 768 citations
Bioinformatics: Sequence and Genome Analysis
Pedro Romero · Briefings in Bioinformatics · 2004 · 396 citations · Full text