Access the full text.
Sign up today, get DeepDyve free for 14 days.
Ben Langmead, C. Trapnell, Mihai Pop, S. Salzberg (2009)
Ultrafast and memory-efficient alignment of short DNA sequences to the human genomeGenome Biology, 10
Hui Jiang, W. Wong (2008)
SeqMap: mapping massive amount of oligonucleotides to the genomeBioinformatics, 24 20
R. Grossi, S. Vitter (2000)
Compressed SuÆx Arrays and SuÆx Trees with Applications to Text Indexing and String Matching
A. Blumer, J. Blumer, D. Haussler, A. Ehrenfeucht, M. Chen, J. Seiferas (1985)
The Smallest Automaton Recognizing the Subwords of a TextTheor. Comput. Sci., 40
You Kim, Nikhil Teletia, Victor Ruotti, C. Maher, A. Chinnaiyan, R. Stewart, J. Thomson, J. Patel (2009)
ProbeMatch: rapid alignment of oligonucleotides to genome allowing both gaps and mismatchesBioinformatics, 25 11
Heng Li, Jue Ruan, Richard Durbin (2008)
Mapping short DNA sequencing reads and calling variants using mapping quality scores.Genome research, 18 11
Z. Ning, A. Cox, J. Mullikin (2001)
SSAHA: a fast search method for large DNA databases.Genome research, 11 10
Heng Li, R. Handsaker, Alec Wysoker, T. Fennell, Jue Ruan, Nils Homer, Gabor Marth, G. Abecasis, R. Durbin (2009)
The Sequence Alignment/Map format and SAMtoolsBioinformatics, 25
Bin Ma, J. Tromp, Ming Li (2002)
PatternHunter: faster and more sensitive homology searchBioinformatics, 18 3
M. Schatz (2009)
CloudBurst: highly sensitive read mapping with MapReduceBioinformatics, 25
J. Eid, Adrian Fehr, J. Gray, K. Luong, J. Lyle, G. Otto, P. Peluso, D. Rank, P. Baybayan, B. Bettman, A. Bibiłło, K. Bjornson, Bidhan Chaudhuri, F. Christians, R. Cicero, Sonya Clark, Ravindra Dalal, A. deWinter, John Dixon, M. Foquet, A. Gaertner, P. Hardenbol, C. Heiner, K. Hester, David Holden, G. Kearns, Xiangxu Kong, R. Kuse, Yves Lacroix, Steven Lin, P. Lundquist, Congcong Ma, Patrick Marks, M. Maxham, Devon Murphy, Insil Park, Thang Pham, M. Phillips, Joy Roy, R. Sebra, Gene Shen, J. Sorenson, A. Tomaney, K. Travers, M. Trulson, John Vieceli, Jeffrey Wegener, Dawn Wu, Alicia Yang, D. Zaccarin, Peter Zhao, F. Zhong, J. Korlach, S. Turner (2009)
Real-Time DNA Sequencing from Single Polymerase MoleculesScience, 323
D. Weese, Anne-Katrin Emde, T. Rausch, Andreas Döring, K. Reinert (2009)
RazerS--fast read mapping with sensitivity control.Genome research, 19 9
Hao Lin, Zefeng Zhang, Michael Zhang, B. Ma, Ming Li (2008)
ZOOM! Zillions of oligos mappedBioinformatics, 24 21
W. Kent (2002)
BLAT--the BLAST-like alignment tool.Genome research, 12 4
(2007)
Ultra high throughput alignment of short sequence tags
D. Campagna, A. Albiero, A. Bilardi, E. Caniato, C. Forcato, Svetlin Manavski, N. Vitulo, G. Valle (2009)
PASS: a program to align short sequencesBioinformatics, 25 7
S. Altschul, Thomas Madden, A. Schäffer, Jinghui Zhang, Zheng Zhang, W. Miller, D. Lipman (1997)
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.Nucleic acids research, 25 17
Nawar Malhis, Y. Butterfield, M. Ester, Steven Jones (2008)
Slider—maximum use of probability information for alignment of short sequence reads and SNP detectionBioinformatics, 25
Zheng Zhang, S. Schwartz, L. Wagner, W. Miller (2000)
A Greedy Algorithm for Aligning DNA SequencesJournal of computational biology : a journal of computational molecular cell biology, 7 1-2
(2009)
ProbeMatch : a tool for aligning oligonucleotide sequences
Stephen Rumble, P. Lacroute, Adrian Dalca, M. Fiume, A. Sidow, M. Brudno (2009)
SHRiMP: Accurate Mapping of Short Color-space ReadsPLoS Computational Biology, 5
A. Morgulis, G. Coulouris, Yan Raytselis, Thomas Madden, R. Agarwala, A. Schäffer (2008)
Database indexing for production MegaBLAST searchesBioinformatics, 24
R. Grossi, J. Vitter (2000)
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)SIAM J. Comput., 35
T. Lam, K. Sadakane, W. Sung, S. Yiu (2002)
A Space and Time Efficient Algorithm for Constructing Compressed Suffix ArraysAlgorithmica, 48
Andrew Smith, Zhenyu Xuan, Michael Zhang (2008)
Using quality scores and longer reads improves accuracy of Solexa read mappingBMC Bioinformatics, 9
Hugh Eaves, Yuan Gao (2009)
MOM: maximum oligonucleotide mappingBioinformatics, 25 7
Colin Meek, J. Patel, Shruti Kasetty (2003)
OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences
T. Lam, W. Sung, Siu-Lung Tam, C. Wong, S. Yiu (2008)
Compressed indexing and local alignment of DNABioinformatics, 24 6
P. Ferragina, G. Manzini (2000)
Opportunistic data structures with applicationsProceedings 41st Annual Symposium on Foundations of Computer Science
R. Lippert (2005)
Space-Efficient Whole Genome Comparisons with BurrowsWheeler TransformsJournal of computational biology : a journal of computational molecular cell biology, 12 4
W. Pearson, D. Lipman (1988)
Improved tools for biological sequence comparison.Proceedings of the National Academy of Sciences of the United States of America, 85 8
Ruiqiang Li, Yingrui Li, K. Kristiansen, Jun Wang (2008)
SOAP: short oligonucleotide alignment programBioinformatics, 24 5
M. Burrows, D. L, R. Taylor, D. Wheeler, D. Wheeler (1994)
A Block-sorting Lossless Data Compression Algorithm
Motivation: The enormous amount of short reads generated by the new DNA sequencing technologies call for the development of fast and accurate read alignment programs. A first generation of hash table-based methods has been developed, including MAQ, which is accurate, feature rich and fast enough to align short reads from a single individual. However, MAQ does not support gapped alignment for single-end reads, which makes it unsuitable for alignment of longer reads where indels may occur frequently. The speed of MAQ is also a concern when the alignment is scaled up to the resequencing of hundreds of individuals.Results: We implemented Burrows-Wheeler Alignment tool (BWA), a new read alignment package that is based on backward search with Burrows–Wheeler Transform (BWT), to efficiently align short sequencing reads against a large reference sequence such as the human genome, allowing mismatches and gaps. BWA supports both base space reads, e.g. from Illumina sequencing machines, and color space reads from AB SOLiD machines. Evaluations on both simulated and real data suggest that BWA is ∼10–20× faster than MAQ, while achieving similar accuracy. In addition, BWA outputs alignment in the new standard SAM (Sequence Alignment/Map) format. Variant calling and other downstream analyses after the alignment can be achieved with the open source SAMtools software package.Availability: http://maq.sourceforge.netContact: rd@sanger.ac.uk
Bioinformatics – Oxford University Press
Published: May 18, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.