English

Parallelization of Weighted Sequence Comparison by using EBWT

Distributed, Parallel, and Cluster Computing 2011-02-02 v3 Data Structures and Algorithms

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

@article{arxiv.1011.0597,
  title  = {Parallelization of Weighted Sequence Comparison by using EBWT},
  author = {Shashank Srikant},
  journal= {arXiv preprint arXiv:1011.0597},
  year   = {2011}
}

Comments

This paper has been withdrawn by the authors. Extended Burrows Wheeler transform; CUDA; Molecular Weighted Sequence; arXiv Admin note: Author list truncated due to authorship dispute

R2 v1 2026-06-21T16:37:42.934Z