The DOI matches its Crossref record; 22 of the 24 references it cites were found in a registry or an index.
Fast and accurate long-read alignment with Burrows-Wheeler transform.
Open accessAbstract
Motivation: Many programs for aligning short sequencing reads to a reference genome have been developed in the last 2 years. Most of them are very efficient for short reads but inefficient or not applicable for reads >200 bp because the algorithms are heavily and specifically tuned for short queries with low sequencing error rate. However, some sequencing platforms already produce longer reads and others are expected to become available soon. For longer reads, hashing-based software such as BLAT and SSAHA2 remain the only choices. Nonetheless, these methods are substantially slower than short-read aligners in terms of aligned bases per unit time. Results: We designed and implemented a new algorithm, Burrows-Wheeler Aligner's Smith-Waterman Alignment (BWA-SW), to align long sequences up to 1 Mb against a large sequence database (e.g. the human genome) with a few gigabytes of memory. The algorithm is as accurate as SSAHA2, more accurate than BLAT, and is several to tens of times faster than both. Availability: http://bio-bwa.sourceforge.net Contact: rd@sanger.ac.uk
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Software confirmed to be working for this approach include (but are not limited to) Bowtie2 11, BWA 12, HISAT2 13, STAR 14 or any tool wrapping one of these aligners.”
From SNPsplit: Allele-specific splitting of alignments between genomes with known SNP genotypes (2016) · cites this paper as [12]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Mapping reads to specific genes is relatively straightforward with the bioinformatics tools available today [10-13], but using these tools to distinguish between reads derived from alternative alleles of the same gene remains challenging [9].”
From Sources of bias in measures of allele-specific expression derived from RNA-seq data aligned to a single reference genome (2013) · cites this paper as [11]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302 · cited 1×
“Cambridge, CB10 1SA, UK such as FASTA (Pearson and Lipman, 1988) and BLAST (Altschul MegaBLAST (Morgulis et al ., 2008; Zhang et al ., 2000), SSAHA2 (Ning et al ., 2001), BLAT (Kent, 2002) and PatternHunter (Ma et al ., 2002), greatly speeding up matching capillary sequencing technologies arrived…”
The Sequence Alignment/Map format and SAMtools
Li, H., Handsaker, B., Wysoker, A., Fennell, T., Ruan, J., Homer, N., Marth, G., Abecasis, G., Durbin, R., & 1000 Genome Project Data Processing Subgroup (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp352 · Cited by 62,041
Self-citationFast and accurate short read alignment with Burrows-Wheeler transform
Li, H., & Durbin, R. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp324 · Cited by 58,607
Self-citationUltrafast and memory-efficient alignment of short DNA sequences to the human genome.
Langmead, B., Trapnell, C., Pop, M., & Salzberg, S. L. (2009) · Genome Biology · doi:10.1186/gb-2009-10-3-r25 · Cited by 21,849
Improved tools for biological sequence comparison.
Pearson, W. R., & Lipman, D. J. (1988) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.85.8.2444 · Cited by 11,227 · cited 4×
“Cambridge, CB10 1SA, UK such as FASTA (Pearson and Lipman, 1988) and BLAST (Altschul MegaBLAST (Morgulis et al ., 2008; Zhang et al ., 2000), SSAHA2 (Ning et al ., 2001), BLAT (Kent, 2002) and PatternHunter (Ma et al ., 2002), greatly speeding up matching capillary sequencing technologies arrived…”
Influential<tt>BLAT</tt> —The <tt>BLAST</tt> -Like Alignment Tool
Kent, W. J. (2002) · Genome Research · doi:10.1101/gr.229202 · Cited by 8,480 · cited 1×
“…and PatternHunter (Ma et al ., 2002), greatly speeding up matching capillary sequencing technologies arrived that generated millions of short (<100bp) reads, a variety of new algorithms were developed which were 10–1000 times faster, including SOAP (Li,R. et al 2008), MAQ (Li,H. et al ., 2009).”
A Greedy Algorithm for Aligning DNA Sequences
Zhang, Z., Schwartz, S., Wagner, L., & Miller, W. (2000) · Journal of Computational Biology · doi:10.1089/10665270050081478 · Cited by 5,459 · cited 1×
“…SSAHA2 (Ning et al ., 2001), BLAT (Kent, 2002) and PatternHunter (Ma et al ., 2002), greatly speeding up matching capillary sequencing technologies arrived that generated millions of short (<100bp) reads, a variety of new algorithms were developed which were 10–1000 times faster, including…”
SOAP: Short oligonucleotide alignment program
Li, R., Li, Y., Kristiansen, K., & Wang, J. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn025 · Cited by 3,597
Mapping short DNA sequencing reads and calling variants using mapping quality scores
Li, H., Ruan, J., & Durbin, R. (2008) · Genome Research · doi:10.1101/gr.078212.108 · Cited by 2,638 · cited 1×
“Memory required for each query is roughly proportional to <4GB; on one query sequence with 1 million base pairs (Mbp), peak memory is”
Self-citationReal-time DNA sequencing from single polymerase molecules.
Korlach, J., Bjornson, K., Chaudhuri, B., Cicero, R., Flusberg, B., Gray, J., Holden, D., Saxena, R., Wegener, J., & Turner, S. (2010) · Methods in Enzymology · doi:10.1016/s0076-6879(10)72001-2 · Cited by 1,847
Database indexing for production MegaBLAST searches
Morgulis, A. O., Coulouris, G., Raytselis, Y., Madden, T., Agarwala, R., & Schäffer, A. A. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn322 · Cited by 1,395
Opportunistic data structures with applications
Ferragina, P., & Manzini, G. (2000) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892127 · Cited by 1,325 · cited 6×
“FM-index (Ferragina and Manzini, 2000) is a compressed representation of the three arrays, consisting of the compressed BWT string B, auxiliary arrays for calculating O, and part of the suffix array S.”
InfluentialSSAHA: A Fast Search Method for Large DNA Databases
Ning, Z., Cox, A. J., & Mullikin, J. C. (2001) · Genome Research · doi:10.1101/gr.194201 · Cited by 965 · cited 1×
“…BLAT (Kent, 2002) and PatternHunter (Ma et al ., 2002), greatly speeding up matching capillary sequencing technologies arrived that generated millions of short (<100bp) reads, a variety of new algorithms were developed which were 10–1000 times faster, including SOAP (Li,R. et al 2008), MAQ…”
PatternHunter: faster and more sensitive homology search
Ma, B., Tromp, J., & Li, M. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.3.440 · Cited by 837
SHRiMP: Accurate Mapping of Short Color-space Reads
Rumble, S. M., Lacroute, P., Dalca, A. V., Fiume, M., Sidow, A., & Brudno, M. (2009) · PLoS Comput. Biol. · doi:10.1371/journal.pcbi.1000386 · Cited by 639 · cited 2×
“Secondly, many short-read aligners are only efficient when doing ungapped alignment or allowing limited gaps, e.g. a maximum of however, must be permissive about alignment gaps because indels more frequently in long reads and may be the dominant source sequencing errors for some technologies such as 454 and Pacific When…”
SeqMap: mapping massive amount of oligonucleotides to the genome
Jiang, H., & Wong, W. H. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn429 · Cited by 479
The Smallest Automaton Recognizing the Subwords of a Text
Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.-T., & Seiferas, J. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90157-4 · Cited by 379 · cited 1×
“It implicitly represents the reference sequence in a prefix trie and represents the query sequence in a prefix directed acyclic word graph (prefix DAWG; the trie and the DAWG, by traversing the reference prefix trie and the query DAWG, respectively.”
Using quality scores and longer reads improves accuracy of Solexa read mapping
Smith, A. D., Xuan, Z., & Zhang, M. Q. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-128 · Cited by 336 · cited 1×
“…or allowing limited gaps, e.g. a maximum of however, must be permissive about alignment gaps because indels more frequently in long reads and may be the dominant source sequencing errors for some technologies such as 454 and Pacific Whenconsidering table indexing as is used in most current…”
ZOOM! Zillions of oligos mapped
Lin, H., Zhang, Z., Zhang, M. Q., Ma, B., & Li, M. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn416 · Cited by 210
RazerS--fast read mapping with sensitivity control.Preprint
Weese, D., Emde, A., Rausch, T., Döring, A., & Reinert, K. (2009) · Genome Research · doi:10.1101/gr.088823.108 · Cited by 178 · cited 1×
“…gaps, e.g. a maximum of however, must be permissive about alignment gaps because indels more frequently in long reads and may be the dominant source sequencing errors for some technologies such as 454 and Pacific Whenconsidering table indexing as is used in most current software is not the only .”
Compressed indexing and local alignment of DNA
Lam, T.-W., Sung, W.-K., Tam, S.-L., Wong, C., & Yiu, S.-M. (2008) · Bioinform. · doi:10.1093/bioinformatics/btn032 · Cited by 159 · cited 2×
“= max { D uv (cid”
OASIS: An Online and Accurate Technique for Local-alignment Searches on Biological Sequences
Meek, C., Patel, J. M., & Kasetty, S. (2003) · Very Large Data Bases Conference · doi:10.1016/b978-012722442-8/50085-9 · Cited by 107 · cited 1×
“H.Li and R.Durbin BWA-SW finds seeds by dynamic programming between two FM-indices seed when the seed has few occurrences in the reference sequence.”
Flagged first, then by citations
2 of the 24 references couldn’t be matched to a known paper.
Research works printed but not linked: 1
- Burrows, 1994, A block-sorting lossless data compression algorithm
Cited by
Sorted by citations
Fast gapped-read alignment with Bowtie 2
Langmead, B., & Salzberg, S. L. (2012) · Nature Methods · doi:10.1038/nmeth.1923 · Cited by 56,400
Structure, function and diversity of the healthy human microbiome
The Human Microbiome Project Consortium (2012) · Nature · doi:10.1038/nature11234 · Cited by 11,726
A 3D Map of the Human Genome at Kilobase Resolution Reveals Principles of Chromatin Looping
Rao, S. S. P., Huntley, M. H., Durand, N. C., Stamenova, E. K., Bochkov, I. D., Robinson, J. T., Sanborn, A. L., Machol, I., Omer, A. D., Lander, E. S., et al. (2014) · Cell · doi:10.1016/j.cell.2014.11.021 · Cited by 9,212
Van der Auwera, G. A., Carneiro, M. O., Hartl, C., Poplin, R., del Angel, G., Levy‐Moonshine, A., Jordan, T., Shakir, K., Roazen, D., Thibault, J., et al. (2013) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi1110s43 · Cited by 6,687
Comprehensive Analysis of mRNA Methylation Reveals Enrichment in 3′ UTRs and near Stop Codons
Meyer, K. D., Saletore, Y., Zumbo, P., Elemento, O., Mason, C. E., & Jaffrey, S. R. (2012) · Cell · doi:10.1016/j.cell.2012.05.003 · Cited by 4,223
Metadata
- Authors
- Li, H., & Durbin, R.
- Affiliations
- Wellcome Sanger Institute (GB)
- Corresponding author
- Durbin, Richard
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2010-01-15
- Volume
- 26
- Issue
- 5
- Pages
- 589-595
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- PMC
- PMC2828108
- OpenAlex
- W4247053599
- Cited by
- 12,063
- References
- 24
- Citations by year
- 2026: 639 · 2025: 972 · 2024: 1129 · 2023: 1067 · 2022: 1203 · 2021: 1245 · 2020: 1176 · 2019: 941 · 2018: 826 · 2017: 747 · 2016: 574 · 2015: 498 · 2014: 419 · 2013: 301 · 2012: 203
- FWCI
- 80.44
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Bioinformatics (publishedVersion, cc-by-nc)
- Funders
- Wellcome Trust (077192/Z/05/Z)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
- Keywords
- long-read alignment, Burrows-Wheeler transform, Smith-Waterman alignment, sequence alignment, reference genome, blat, alignment speed, alignment accuracy, human genome
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
