{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,26]],"date-time":"2026-04-26T19:31:20Z","timestamp":1777231880434,"version":"3.51.4"},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":2452,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0\/uk\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,3,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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 &amp;gt;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.<\/jats:p>\n               <jats:p>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.<\/jats:p>\n               <jats:p>Availability: \u00a0http:\/\/bio-bwa.sourceforge.net<\/jats:p>\n               <jats:p>Contact: \u00a0rd@sanger.ac.uk<\/jats:p>","DOI":"10.1093\/bioinformatics\/btp698","type":"journal-article","created":{"date-parts":[[2010,1,16]],"date-time":"2010-01-16T01:14:00Z","timestamp":1263604440000},"page":"589-595","source":"Crossref","is-referenced-by-count":11231,"title":["Fast and accurate long-read alignment with Burrows\u2013Wheeler transform"],"prefix":"10.1093","volume":"26","author":[{"given":"Heng","family":"Li","sequence":"first","affiliation":[{"name":"Wellcome Trust Sanger Institute, Wellcome Genome Campus, Cambridge, CB10 1SA, UK"}]},{"given":"Richard","family":"Durbin","sequence":"additional","affiliation":[{"name":"Wellcome Trust Sanger Institute, Wellcome Genome Campus, Cambridge, CB10 1SA, UK"}]}],"member":"286","published-online":{"date-parts":[[2010,1,15]]},"reference":[{"key":"2023012511001671300_B1","doi-asserted-by":"crossref","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","article-title":"Gapped BLAST and PSI-BLAST: a new generation of protein database search programs","volume":"25","author":"Altschul","year":"1997","journal-title":"Nucleic Acids Res."},{"key":"2023012511001671300_B2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automaton recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theor. Comput. Sci."},{"key":"2023012511001671300_B3","article-title":"A block-sorting lossless data compression algorithm","volume-title":"Technical report 124","author":"Burrows","year":"1994"},{"key":"2023012511001671300_B4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1126\/science.1162986","article-title":"Real-time DNA sequencing from single polymerase molecules","volume":"323","author":"Eid","year":"2009","journal-title":"Science"},{"key":"2023012511001671300_B5","first-page":"390","article-title":"Opportunistic data structures with applications","volume-title":"Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS 2000)","author":"Ferragina","year":"2000"},{"key":"2023012511001671300_B6","doi-asserted-by":"crossref","first-page":"2395","DOI":"10.1093\/bioinformatics\/btn429","article-title":"SeqMap: mapping massive amount of oligonucleotides to the genome","volume":"24","author":"Jiang","year":"2008","journal-title":"Bioinformatics"},{"key":"2023012511001671300_B7","first-page":"656","article-title":"BLAT\u2013the BLAST-like alignment tool","volume":"12","author":"Kent","year":"2002","journal-title":"Genome Res."},{"key":"2023012511001671300_B8","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1093\/bioinformatics\/btn032","article-title":"Compressed indexing and local alignment of DNA","volume":"24","author":"Lam","year":"2008","journal-title":"Bioinformatics"},{"key":"2023012511001671300_B9","doi-asserted-by":"crossref","first-page":"R25","DOI":"10.1186\/gb-2009-10-3-r25","article-title":"Ultrafast and memory-efficient alignment of short DNA sequences to the human genome","volume":"10","author":"Langmead","year":"2009","journal-title":"Genome Biol."},{"key":"2023012511001671300_B10","doi-asserted-by":"crossref","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","article-title":"Fast and accurate short read alignment with Burrows-Wheeler transform","volume":"25","author":"Li","year":"2009","journal-title":"Bioinformatics"},{"key":"2023012511001671300_B11","doi-asserted-by":"crossref","first-page":"1851","DOI":"10.1101\/gr.078212.108","article-title":"Mapping short DNA sequencing reads and calling variants using mapping quality scores","volume":"18","author":"Li","year":"2008","journal-title":"Genome Res."},{"key":"2023012511001671300_B12","doi-asserted-by":"crossref","first-page":"2078","DOI":"10.1093\/bioinformatics\/btp352","article-title":"The Sequence Alignment\/Map format and SAMtools","volume":"25","author":"Li","year":"2009","journal-title":"Bioinformatics"},{"key":"2023012511001671300_B13","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1093\/bioinformatics\/btn025","article-title":"SOAP: short oligonucleotide alignment program","volume":"24","author":"Li","year":"2008","journal-title":"Bioinformatics"},{"key":"2023012511001671300_B14","doi-asserted-by":"crossref","first-page":"2431","DOI":"10.1093\/bioinformatics\/btn416","article-title":"Zoom! zillions of oligos mapped","volume":"24","author":"Lin","year":"2008","journal-title":"Bioinformatics"},{"key":"2023012511001671300_B15","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","article-title":"PatternHunter: faster and more sensitive homology search","volume":"18","author":"Ma","year":"2002","journal-title":"Bioinformatics"},{"key":"2023012511001671300_B16","first-page":"910","article-title":"OASIS: an online and accurate technique for local-alignment searches on biological sequences","volume-title":"Proceedings of 29th International Conference on Very Large Data Bases (VLDB 2003)","author":"Meek","year":"2003"},{"key":"2023012511001671300_B17","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1093\/bioinformatics\/btn322","article-title":"Database indexing for production megablast searches","volume":"24","author":"Morgulis","year":"2008","journal-title":"Bioinformatics"},{"key":"2023012511001671300_B18","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1101\/gr.194201","article-title":"SSAHA: a fast search method for large DNA databases","volume":"11","author":"Ning","year":"2001","journal-title":"Genome Res."},{"key":"2023012511001671300_B19","doi-asserted-by":"crossref","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","article-title":"Improved tools for biological sequence comparison","volume":"85","author":"Pearson","year":"1988","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012511001671300_B20","doi-asserted-by":"crossref","first-page":"e1000386","DOI":"10.1371\/journal.pcbi.1000386","article-title":"SHRiMP: accurate mapping of short color-space reads","volume":"5","author":"Rumble","year":"2009","journal-title":"PLoS Comput. Biol."},{"key":"2023012511001671300_B21","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1186\/1471-2105-9-128","article-title":"Using quality scores and longer reads improves accuracy of Solexa read mapping","volume":"9","author":"Smith","year":"2008","journal-title":"BMC Bioinformatics"},{"key":"2023012511001671300_B22","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1101\/gr.088823.108","article-title":"RazerS\u2013fast read mapping with sensitivity control","volume":"19","author":"Weese","year":"2009","journal-title":"Genome Res."},{"key":"2023012511001671300_B23","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1089\/10665270050081478","article-title":"A greedy algorithm for aligning DNA sequences","volume":"7","author":"Zhang","year":"2000","journal-title":"J. Comput. Biol."}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/26\/5\/589\/48860453\/bioinformatics_26_5_589.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/26\/5\/589\/48860453\/bioinformatics_26_5_589.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T11:01:19Z","timestamp":1674644479000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/26\/5\/589\/211735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,15]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,3,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btp698","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2010,3,1]]},"published":{"date-parts":[[2010,1,15]]}}}