SW#-GPU-enabled exact alignments on genome scale

53Citations
Citations of this article
55Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Summary: We propose SW#, a new CUDA graphical processor unit-enabled and memory-efficient implementation of dynamic programming algorithm, for local alignment. It can be used as either a stand-alone application or a library. Although there are other graphical processor unit implementations of the Smith-Waterman algorithm, SW# is the only one publicly available that can produce sequence alignments on genome-wide scale. For long sequences, it is at least a few hundred times faster than a CPU version of the same algorithm. © The Author 2013.

Cite

CITATION STYLE

APA

Korpar, M., & Šikić, M. (2013). SW#-GPU-enabled exact alignments on genome scale. Bioinformatics, 29(19), 2494–2495. https://doi.org/10.1093/bioinformatics/btt410

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