Journal ArticleOPEN ACCESS

Parallelization of Weighted Sequence Comparision By Using EBWT

  • Pandey B
  • Niyogi R
  • Mittal A
International Journal of Distributed and Parallel systems (2011) 2(1) 12-31
DOI: 10.5121/ijdps.2011.2102
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Pandey, B. K., Niyogi, R., & Mittal, A. (2011). Parallelization of Weighted Sequence Comparision By Using EBWT. International Journal of Distributed and Parallel Systems, 2(1), 12–31. https://doi.org/10.5121/ijdps.2011.2102

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free