Pith. sign in

REVIEW

Parallelization of Weighted Sequence Comparison by using EBWT

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1011.0597 v3 pith:3YKSZVCE submitted 2010-11-02 cs.DC cs.DS

Shashank Srikant This is my paper · ORCID
classification cs.DCcs.DS
keywords algorithmebwtimplementationsequencesamountarchitectureaverageburrows
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools