Fast and accurate read alignment for resequencing

Bioinformatics

Volumn 28, Issue 18, 2012, Pages 2366-2373

  Mu, John C ^a   Jiang, Hui ^b   Kiani, Amirhossein ^c   Mohiyuddin, Marghoob ^c   Asadi, Narges Bani ^c   Wong, Wing H ^d  

^a Stanford University   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Bina Technologies Inc   (United States)

^d STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; 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; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84866441562     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts450     Document Type: Article

References (20)

1. Baeza-yates,R.A. and Perleberg,C.H. (1992) Fast and practical approximate string matching. In Combinatorial Pattern Matching, Third Annual Symposium. Springer-Verlag, pp. 185-192.
2. Burrows,M. and Wheeler,D.J. (1994) A block-sorting lossless data compression algorithm. HP Labs Technical Reports, SRC-RR-124.
3. David,M. et al. (2011) SHRiMP2: sensitive yet practical short read mapping. Bioinformatics, 27, 1011-1012.
4. DePristo,M.A. et al. (2011) A framework for variation discovery and genotyping using next-generation dna sequencing data. Nat. Genet., 43, 491-498.
5. Ferragina,P. and Manzini,G. (2000) Opportunistic data structures with applications. In Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS). Redondo, Beach, CA, USA.
6. Homer,N., Merriman,B. and Nelson,S.F. (2009) BFAST: an alignment tool for large scale genome resequencing. PLoS One, 4, e7767.
7. Huang,W., Li,L.,Myers,J.R. and Marth,G.T. (2012) Art: a next-generation sequencing read simulator. Bioinformatics, 28, 593-594.
8. Jiang,H. andWong,W.H. (2008) SeqMap: mapping massive amount of oligonucleotides to the genome. Bioinformatics, 24, 2395-2396.
9. Konagurthu,A.S. et al. (2010) Design of an efficient out-of-core read alignment algorithm. In Proceedings of the 10th International Conference on Algorithms in Bioinformatics. pp. 189-201.
10. Langmead,B.S. and Steven,L. (2012) Fast gapped-read alignment with bowtie 2. Nat. Methods, 9, 357-359.
11. Li,H. (2011) A statistical framework for SNP calling, mutation discovery, association mapping and population genetical parameter estimation from sequencing data. Bioinformatics, 27, 2987-2993.
12. Li,H. and Durbin,R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1754-1760.
13. Li,H. and Durbin,R. (2010) Fast and accurate long-read alignment with Burrows-Wheeler transform. Bioinformatics, 26, 589-595.
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,R. et al. (2009) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
16. Lunter,G. and Goodson,M. (2011) Stampy: a statistical algorithm for sensitive and fast mapping of illumina sequence reads. Genome Res., 21, 936-939.
17. Malhis,N. et al. (2009) Slidermaximum use of probability information for alignment of short sequence reads and snp detection. Bioinformatics, 25, 6-13.
18. Rizk,G. and Lavenier,D. (2010) GASSST: global alignment short sequence search tool. Bioinformatics, 26, 2534-2540.
19. The 1000 Genomes Project Consortium (2010) A map of human genome variation from population-scale sequencing. Nature, 467, 1061-1073.
20. Zaharia,M. et al. (2011) Faster and more accurate sequence alignment with snap. arXiv, arXiv:1111.5572v1.