CUSHAW3: Sensitive and accurate base-space and color-space short-read alignment with hybrid seeding

PLoS ONE

Volumn 9, Issue 1, 2014, Pages

  Liu, Yongchao ^a   Popp, Bernt ^b   Schmidt, Bertil ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTICAL ERROR; ARTICLE; COMPUTER PROGRAM; CONTROLLED STUDY; GENETIC PROCEDURES; HUMAN; HUMAN GENOME; HYBRID SEEDING; INTERMETHOD COMPARISON; INTERNET; NEXT GENERATION SEQUENCING; SENSITIVITY ANALYSIS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; SIMULATION; STATISTICAL PARAMETERS;

BASE SEQUENCE; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 84899539925     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0086869     Document Type: Article

References (26)

1. Smith AD, Xuan Z, Zhang MQ (2008) Using quality scores and longer reads improves accuracy of Solexa read mapping. BMC Bioinformatics, 9: 128.
2. Li H, Ruan J, Durbin R (2008) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18: 1851-1858.
3. Homer N, Merriman B, Nelson SF (2009) BFAST: an alignment tool for large scale genome resequencing. Plos One, 4: e7767.
4. Langmead B, Trapnell C, Pop M, Salzberg SL (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10: R25.
5. Li H, Durbin R (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25: 1755-1760.
6. Liu Y, Schmidt B, Maskell DL (2012) CUSHAW: a CUDA compatible short read aligner to large genomes based on the Burrows-Wheeler transform. Bioinformatics, 28: 1830-1837.
7. Liu CM, Wong T, Wu E, Luo R, Yiu SM, et al. (2012) SOAP3: ultra-fast GPU-based parallel alignment tool for short reads. Bioinformatics, 28: 878-879.
8. Li H, Durbin R (2010) Fast and accurate long-read alignment with Burrows-Wheeler transform. Bioinformatics, 26: 589-595.
9. Rizk G, Lavenier D (2010) GASSST: global alignment short sequence search tool. Bioinformatics, 26: 2534-2540.
10. Langmead B, Salzberg S (2012) Fast gapped-read alignment with Bowtie 2. Nature Methods, 9: 357-359.
11. Liu Y, Schmidt B (2012) Long read alignment based on maximal exact match seeds. Bioinformatics, 28, i318-i324.
12. Marco-Sola S, Sammeth M, Guigó R, Ribeca P (2012) The GEM mapper: fast, accurate and versatile alignment by filtration. Nature Methods, 9: 1885-1888.
13. Mu JC, Jiang H, Kiani A, Mohiyuddin M, Bani Asadi N, et al. (2012) Fast and accurate read alignment for resequencing. Bioinformatics, 28: 2366-2373.
14. Luo R, Wong T, Zhu J, Liu CM, Zhu X, et al. (2013) SOAP3-dp: fast, accurate and sensitive GPU-based short-read aligner. PLOS One, 8: e65632.
15. Li H (2013) Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM. arXiv: 1303.3997 [q-bio.GN].
16. Li H, Homer N (2010) A survey of sequence alignment algorithms for next-generation sequencing. Brief Bioinform., 11: 473-483.
17. Lunter G, Goodson M (2011) Stampy: a statistical algorithm for sensitive and fast mapping of Illumina sequence reads. Genome Res., 21: 936-939.
18. Ning Z, Cox AJ, Mullikin JC (2001) SSAHA: a fast search method for large DNA databases. Genome Res., 11: 1725-1729. (Pubitemid 33040499)
19. David M, Dzamba M, Lister D, Ilie L, Brudno M (2011) SHRiMP2: sensitive yet practical short read mapping. Bioinformatics, 27: 1011-1012.
20. Li H, Handsaker B, Wysoker A, Fennell T, Ruan J, et al. (2009) The sequence alignment/map format and SAMtools. Bioinformatics, 25: 2078-2079.
21. Huang W, Li L, Myers JR, Marth GT (2012) ART: a next-generation sequencing read simulator. Bioinformatics, 28: 593-594.
22. Ewing B, Green P (1998) Base-calling of automated sequencer traces using phred. II. Error probabilities. Genome Res 8: 186-194. (Pubitemid 28177230)
23. McKenna A, Hanna M, Banks E, Sivachenko A, Cibulskis K, et al. (2010) The Genome Analysis Toolkit: a MapReduce framework for analyzing next generation DNA sequencing data. Genome Res 20: 1297-1303.
24. Burrows M, Wheeler DJ (1994) A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, Palo Alto, CA.
25. Ferragina P, Manzini G (2005) Indexing compressed text. Journal of the ACM, 52: 4.
26. Smith TF, Waterman MS (1981) Identification of common molecular subsequences. J. Mol. Biol., 147: 195-197.