Parallelization of Weighted Sequence Comparison by using EBWT
classification
💻 cs.DC
cs.DS
keywords
algorithmebwtimplementationsequencesamountarchitectureaverageburrows
read the original abstract
The Extended Burrows Wheeler transform (EBWT) helps to find the distance between two sequences. Implementation of an existing algorithm takes considerable amount of time for small size sequences. In this paper, we give a parallel implementation of this algorithm using NVIDIA Compute Unified Device Architecture (CUDA). We have obtained, on an average, a 2X improvement in the performance.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.