{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T14:08:21Z","timestamp":1773842901015,"version":"3.50.1"},"reference-count":20,"publisher":"Oxford University Press (OUP)","issue":"11","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":2734,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0\/uk\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motivation: Next-generation DNA sequencing machines are generating an enormous amount of sequence data, placing unprecedented demands on traditional single-processor read-mapping algorithms. CloudBurst is a new parallel read-mapping algorithm optimized for mapping next-generation sequence data to the human genome and other reference genomes, for use in a variety of biological analyses including SNP discovery, genotyping and personal genomics. It is modeled after the short read-mapping program RMAP, and reports either all alignments or the unambiguous best alignment for each read with any number of mismatches or differences. This level of sensitivity could be prohibitively time consuming, but CloudBurst uses the open-source Hadoop implementation of MapReduce to parallelize execution using multiple compute nodes.<\/jats:p><jats:p>Results: CloudBurst's running time scales linearly with the number of reads mapped, and with near linear speedup as the number of processors increases. In a 24-processor core configuration, CloudBurst is up to 30 times faster than RMAP executing on a single core, while computing an identical set of alignments. Using a larger remote compute cloud with 96 cores, CloudBurst improved performance by &amp;gt;100-fold, reducing the running time from hours to mere minutes for typical jobs involving mapping of millions of short reads to the human genome.<\/jats:p><jats:p>Availability: CloudBurst is available open-source as a model for parallelizing algorithms with MapReduce at http:\/\/cloudburst-bio.sourceforge.net\/.<\/jats:p><jats:p>Contact: \u00a0mschatz@umiacs.umd.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/btp236","type":"journal-article","created":{"date-parts":[[2009,4,9]],"date-time":"2009-04-09T01:09:00Z","timestamp":1239239340000},"page":"1363-1369","source":"Crossref","is-referenced-by-count":503,"title":["CloudBurst: highly sensitive read mapping with MapReduce"],"prefix":"10.1093","volume":"25","author":[{"given":"Michael C.","family":"Schatz","sequence":"first","affiliation":[{"name":"Center for Bioinformatics and Computational Biology, University of Maryland, College Park MD 20742, USA"}]}],"member":"286","published-online":{"date-parts":[[2009,4,8]]},"reference":[{"key":"2023013111510633800_B1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","article-title":"Basic local alignment search tool","volume":"215","author":"Altschul","year":"1990","journal-title":"J. Mol. Biol."},{"key":"2023013111510633800_B2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-56024-6_15","article-title":"Fast and practical approximate string matching","volume-title":"Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium.","author":"Baeza-yates","year":"1992"},{"key":"2023013111510633800_B3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1038\/nature07517","article-title":"Accurate whole human genome sequencing using reversible terminator chemistry","volume":"456","author":"Bentley","year":"2008","journal-title":"Nature"},{"key":"2023013111510633800_B4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/945445.945450","article-title":"The Google file system","volume-title":"Proceedings of the Nineteenth ACM Symposium on Operating Systems Principles.","author":"Ghemawat","year":"2003"},{"key":"2023013111510633800_B5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology.","author":"Gusfield","year":"1997"},{"key":"2023013111510633800_B6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","article-title":"MapReduce: simplified data processing on large clusters","volume":"51","author":"Dean","year":"2008","journal-title":"Commun. ACM"},{"key":"2023013111510633800_B7","first-page":"288","article-title":"Uses and abuses of Amdahl's law","volume":"17","author":"Krishnaprasad","year":"2001","journal-title":"J. Comput. Small Coll."},{"key":"2023013111510633800_B8","doi-asserted-by":"crossref","first-page":"R12","DOI":"10.1186\/gb-2004-5-2-r12","article-title":"Versatile and open software for comparing large genomes","volume":"5","author":"Kurtz","year":"2004","journal-title":"Genome Biol."},{"key":"2023013111510633800_B9","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1145\/12130.12152","article-title":"Introducing efficient parallelism into approximate string matching and a new serial algorithm","volume-title":"Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing.","author":"Landau","year":"1986"},{"key":"2023013111510633800_B10","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":"2023013111510633800_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":"2023013111510633800_B12","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":"2023013111510633800_B13","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":"2023013111510633800_B14","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1186\/1471-2105-8-474","article-title":"High-throughput sequence alignment using Graphics Processing Units","volume":"8","author":"Schatz","year":"2007","journal-title":"BMC Bioinformatics"},{"key":"2023013111510633800_B15","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1038\/nbt0207-149","article-title":"Next-generation sequencing outpaces expectations","volume":"25","author":"Shaffer","year":"2007","journal-title":"Nat. Biotechnol."},{"key":"2023013111510633800_B16","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Mol. Biol."},{"key":"2023013111510633800_B17","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":"2023013111510633800_B18","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1126\/science.1058040","article-title":"The sequence of the human genome","volume":"291","author":"Venter","year":"2001","journal-title":"Science"},{"key":"2023013111510633800_B19","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1038\/nature07484","article-title":"The diploid genome sequence of an Asian individual","volume":"456","author":"Wang","year":"2008","journal-title":"Nature"},{"key":"2023013111510633800_B20","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1038\/nature06884","article-title":"The complete genome of an individual by massively parallel DNA sequencing","volume":"452","author":"Wheeler","year":"2008","journal-title":"Nature"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/11\/1363\/48989695\/bioinformatics_25_11_1363.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/25\/11\/1363\/48989695\/bioinformatics_25_11_1363.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T19:59:44Z","timestamp":1684958384000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/25\/11\/1363\/332646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,8]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2009,6,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btp236","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2009,6,1]]},"published":{"date-parts":[[2009,4,8]]}}}