Parallel Position Weight Matrices Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Parallel Position Weight Matrices Algorithms


Position Weight Matrices (PWMs) are broadly used in computation biology. The basic problem, Scan, aims to find the occurrences of a given PWM in large sequences. A number of other PWMs tasks share a common subproblem, ScoreDistribution, that has been shown to be NP-hard. The existing algorithms rely on the enumeration on a large set of scores or words, and they are mostly not suitable for parallelization. We propose a new algorithm, BucketScoreDistribution, that is both very efficient and suitable for parallelization. We bound the error induced by this algorithm. We realized a GPU prototype for Scan and BucketScoreDistribution with the CUDA libraries, and report for the different problems speedups of 21x and 77x on a Nvidia GTX 280.
Fichier principal
Vignette du fichier
ispdc09-final.pdf (285.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00438215 , version 1 (03-12-2009)



Mathieu Giraud, Jean-Stéphane Varré. Parallel Position Weight Matrices Algorithms. International Symposium on Parallel and Distributed Computing (ISPDC 2009), Jul 2009, Lisboa, Portugal. pp.65-69, ⟨10.1109/ISPDC.2009.31⟩. ⟨inria-00438215⟩
394 View
250 Download



Gmail Facebook X LinkedIn More