Cushaw: A cuda compatible short read aligner to large genomes based on the burrows-wheeler transform

Bioinformatics

Volumn 28, Issue 14, 2012, Pages 1830-1837

  Liu, Yongchao ^a,b   Schmidt, Bertil ^b   Maskell, Douglas L ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ESCHERICHIA COLI;

ALGORITHM; ARTICLE; BIOLOGY; COMPARATIVE STUDY; COMPUTER PROGRAM; DNA SEQUENCE; GENOMICS; HUMAN; HUMAN GENOME; METHODOLOGY; SEQUENCE ALIGNMENT; SINGLE NUCLEOTIDE POLYMORPHISM;

ALGORITHMS; COMPUTATIONAL BIOLOGY; GENOME, HUMAN; GENOMICS; HUMANS; POLYMORPHISM, SINGLE NUCLEOTIDE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84864136658     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts276     Document Type: Article

References (28)

1. Blom, J. et al. (2011) Exact and complete short read alignment to microbial genomes using GPU programming. Bioinformatics, 27, 1351-1358.
2. Burrows, M. and Wheeler, D. J. (1994) A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, CA.
3. Campagna, D. et al. (2009) PASS: a program to align short sequences. Bioinformatics, 25, 967-968.
4. Ewing, B. and Green, P. (1998) Base-calling of automated sequencer traces using phred. II. Error probabilities. Genome Res., 8, 186-194.
5. Ferragina, P. and Manzini, G. (2000) Opportunistic data structures with applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society, p. 390.
6. Ferragina, P. and Manzini, G. (2005) Indexing compressed text. J. ACM, 52, 4.
7. Grossi, R. and Vitter, J. S. (2005) Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput., 35, 2.
8. Homer, N. et al. (2009) BFAST: an alignment tool for large scale genome resequencing. PLoS One, 4, e7767.
9. Hon, W. K. et al. (2007)Aspace and time efficient algorithm for constructing compressed suffix arrays. Algorithmica, 48, 23-36.
10. Kurtz, S. et al. (2004)Versatile and open software for comparing large genomes. Genome Biol., 5, R12.
11. Kuttippurathu, L. et al. (2011) CompleteMOTIFs: DNA motif discovery platform for transcription factor binding experiments. Bioinformatics, 27, 715-717.
12. Lam, T. W. et al. (2008) Compressed indexing and local alignment of DNA. Bioinformatics, 24, 791-797.
13. Langmead, B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25.
14. Li, H. et al. (2008) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18, 1851-1858.
15. Li, H. et al. (2009) The sequence alignment/map format and SAMtools. Bioinformatics, 25, 2078-2079.
16. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with Burrows- Wheeler transform. Bioinformatics, 25, 1755-1760.
17. Li, H. and Durbin, R. (2010) Fast and accurate long-read alignment with Burrows- Wheeler transform. Bioinformatics, 26, 589-595.
18. Li, R. et al. (2008) SOAP: short oligonucleotide alignment program. Bioinformatics, 24, 713-714.
19. Li, R. et al. (2009) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
20. Lindholm, E. et al. (2008) NVIDIATesla: a unified graphics and computing architecture. IEEE Micro, 28, 39-55.
21. Liu, Y. et al. (2009) CUDASW++: optimizing Smith-Waterman sequence database searches for CUDA-enabled graphics processing units. BMC Res. Notes, 2, 73.
22. Liu, Y. et al. (2010) CUDA-MEME: accelerating motif discovery in biological sequences using CUDA-enabled graphics processing units. Pattern Recognit. Lett., 31, 2170-2177.
23. Liu, Y. et al. (2011) DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI. BMC Bioinformatics, 12, 85.
24. NVIDIA (2009) NVIDIA's next generation CUDA compute architecture: Fermi. NVIDIA Corporation Whitepaper. http://www.nvidia.com/content/PDF/fermi_white_papers/NVIDIA_Fermi_Compute_Architecture_Whitepaper pdf
25. Rumble, S. M. et al. (2009) SHRiMP: accurate mapping of short color-space reads. PLoS Comput. Biol., 5, e1000386.
26. Smith, A. D. et al. (2008) Using quality scores and longer reads improves accuracy of Solexa read mapping. BMC Bioinformatics, 9, 128.
27. Smith, T. F. and Waterman, M. S. (1998) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
28. Vouzis, P. D. and Sahinidis, N. V. (2010) GPU-BLAST: using graphics processors to accelerate protein sequence alignment. Bioinformatics, 27, 182-188.