Comparative analysis of algorithms for next-generation sequencing read alignment

Bioinformatics

Volumn 27, Issue 20, 2011, Pages 2790-2796

  Ruffalo, Matthew ^a   Laframboise, Thomas ^b   Koyutürk, Mehmet ^a,b  

^a Case Western Reserve University   (United States)

^b CASE WESTERN RESERVE UNIVERSITY SCHOOL OF MEDICINE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECAPODA (CRUSTACEA);

ALGORITHM; ARTICLE; COMPARATIVE STUDY; COMPUTER PROGRAM; EVALUATION; GENOMICS; HIGH THROUGHPUT SEQUENCING; HUMAN; HUMAN GENOME; INDEL MUTATION; METHODOLOGY; SEQUENCE ALIGNMENT;

ALGORITHMS; GENOME, HUMAN; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; INDEL MUTATION; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 80053978849     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btr477     Document Type: Article

References (32)

1. Alkan,C. et al. (2009) Personalized copy number and segmental duplication maps using next-generation sequencing. Nat. Genet., 41, 1061-1067.
2. Auffray,C. et al. (2009) Systems medicine: the future of medical genomics and healthcare. Genome Med., 1, 1-2.
3. Bailey,J.A. et al. (2002) Recent segmental duplications in the human genome. Science, 297, 1003-1007.
4. Burrows,M. et al. (1994)Ablock-sorting lossless data compression algorithm. Technical Report 124. Digital Equipment Corporation.
5. Califano,A. and Rigoutsos,I. (1993) FLASH: a fast look-up algorithm for string homology. In Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, AAAI Press, Palo Alto, CA, pp. 56-64.
6. Cheung,J. et al. (2003) Genome-wide detection of segmental duplications and potential assembly errors in the human genome sequence. Genome Biol., 4, R25.
7. Ewing,B. and Green,P. (1998) Base-calling of automated sequencer traces using Phred. II. error probabilities. Genome Res., 8, 186-194.
8. Ferragina,P. and Manzini,G. (2000) Opportunistic data structures with applications. In Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS 2000), IEEE Computer Society, pp. 390-398.
9. Guffanti,A. et al. (2009) A transcriptional sketch of a primary human breast cancer by 454 deep sequencing. BMC Genomics, 10, 163-179.
10. Hach,F. et al. (2010) mrsFAST: a cache-oblivious algorithm for short-read mapping. Nat. Methods, 7, 576-577.
11. Horner,D.S. et al. (2010) Bioinformatics approaches for genomics and post genomics applications of next-generation sequencing. Brief. Bioinformatics, 11, 181-197.
12. Illumina,I. (2010) Quality scores data. Available at http://www.illumina.com/truseq/truth_in_data/sbl_comparison/quality_scores_data_.ilmn (last accessed date October 29, 2010).
13. International Human Genome Sequencing Consortium (2001) Initial sequencing and analysis of the human genome. Nature, 409, 860-921.
14. Langmead,B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25.
15. Li,H. and Durbin,R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1754-1760.
16. Li,H. and Durbin,R. (2010) Fast and accurate long-read alignment with Burrows-Wheeler transform. Bioinformatics, 26, 589-595.
17. Li,H. and Homer,N. (2010) A survey of sequence alignment algorithms for nextgeneration sequencing. Brief. Bioinformatics, 11, 473-483.
18. Li,H. et al. (2008a) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18, 1851-1858.
19. Li,R. et al. (2008b) SOAP: short oligonucleotide alignment program. Bioinformatics, 24, 713-714.
20. Li,R. et al. (2009) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
21. Medvedev,P. et al. (2009) Computational methods for discovering structural variation with next-generation sequencing. Nat. Methods, 6, S13-S20.
22. Miller,J.R. et al. (2010) Assembly algorithms for next-generation sequencing data. Genomics, 95, 315-327.
23. Novocraft (2010) http://www.novocraft.com/. (last accessed date October 28, 2010).
24. Qin,J. et al. (2010) A human gut microbial gene catalogue established by metagenomic sequencing. Nature, 464, 59-65.
25. Rasmussen,K.R. et al. (2005) Efficient q-gram filters for finding all e-matches over a given length. In Miyano,S. et al. (eds) Research in Computational Molecular Biology, Vol. 3500 of Lecture Notes in Computer Science. Springer, Berlin/Heidelberg, pp. 189-203.
26. Rhead,B. et al. (2010) The UCSC Genome Browser database: update 2010. Nucleic Acids Res., 38 (Suppl. 1), D613-D619.
27. Rumble,S.M. et al. (2009) Shrimp: accurate mapping of short color-space reads. PLoS Comput. Biol., 5, e1000386.
28. Schuster,S.C. (2007) Next-generation sequencing transforms today's biology. Nat. Methods, 5, 16-18.
29. Smith,T.F. and Waterman,M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195-197.
30. Sultan,M. et al. (2008) A global view of gene activity and alternative splicing by deep sequencing of the human transcriptome. Science, 321, 956-960.
31. Taylor,K.H. et al. (2007) Ultradeep bisulfite sequencing analysis of DNA methylation patterns in multiple gene promoters by 454 sequencing. Cancer Res., 67, 8511-8518.
32. Van Tassell,C.P. et al. (2008) SNP discovery and allele frequency estimation by deep sequencing of reduced representation libraries. Nat. Methods, 5, 247-252.