Skip to content
naulon

No retraction, correction or concern found when last checked on Oct 19, 2026.

MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping

Wan-Ping Lee, Michael P. Stromberg, Alistair Ward and 3 more

PLoS ONE · 2014

doi:10.1371/journal.pone.0090581

Abstract

MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery. All variant discovery benefits from an accurate description of the read placement confidence. To this end, MOSAIK uses a neural-network based training scheme to provide well-calibrated mapping quality scores, demonstrated by a correlation coefficient between MOSAIK assigned and actual mapping qualities greater than 0.98. In order to ensure that studies of any genome are supported, a training pipeline is provided to ensure optimal mapping quality scores for the genome under investigation. MOSAIK is multi-threaded, open source, and incorporated into our command and pipeline launcher system GKNO (http://gkno.me).

Full text

Its licence does not allow us to show the full text. Read it at PubMed Central:

Read at PubMed Central

References 70

  1. 1.

    Drmanac R, Sparks AB, Callow MJ, Halpern AL, Burns NL, et al (2010 ) Human genome sequencing using unchained base reads on self-assembling DNA nanoarrays. Science 327: 78–81

    Not in our library10.1126/science.1181498

  2. 2.

    Eid J, Fehr A, Gray J, Luong K, Lyle J, et al (2009 ) Real-time DNA sequencing from single polymerase molecules. Science 323: 133–138

    Not in our library10.1126/science.1162986

  3. 3.

    Rothberg JM, Hinz W, Rearick TM, Schultz J, Mileski W, et al (2011 ) An integrated semiconductor device enabling non-optical genome sequencing. Nature 475: 348–352

    Not in our library10.1038/nature10242

  4. 4.

    Schneider GF, Dekker C (2012 ) DNA sequencing with nanopores. Nat Biotechnol 30: 326–328

    Not in our library10.1038/nbt.2181

  5. 5.

    Burrows M, Burrows M, Wheeler DJ (1994) A block-sorting lossless data compression algorithm.

    Not in our library

  6. 6.

    Cox AJ, Bauer MJ, Jakobi T, Rosone G (2012) Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform. Bioinformatics. doi:10.1093/bioinformatics/bts173.

    Not in our library10.1093/bioinformatics/bts173

  7. 7.

    Boytsov L (2011 ) Indexing methods for approximate dictionary searching. J Exp Algorithmics 16: 1.1

    Not in our library10.1145/1963190.1963191

  8. 8.

    Li H, Ruan J, Durbin R (2008 ) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res 18: 1851–1858

    Not in our library10.1101/gr.078212.108

  9. 9.

    Alkan C, Kidd JM, Marques-Bonet T, Aksay G, Antonacci F, et al (2009 ) Personalized copy number and segmental duplication maps using next-generation sequencing. Nat Genet 41: 1061–1067

    Not in our library10.1038/ng.437

  10. 10.

    Hach F, Hormozdiari F, Alkan C, Hormozdiari F, Birol I, et al (2010 ) mrsFAST: a cache-oblivious algorithm for short-read mapping. Nat Methods 7: 576–577

    Not in our library10.1038/nmeth0810-576

  11. 11.
  12. 12.

    David M, Dzamba M, Lister D, Ilie L, Brudno M (2011 ) SHRiMP2: sensitive yet practical SHort Read Mapping. Bioinformatics 27: 1011–1012

    Not in our library10.1093/bioinformatics/btr046

  13. 13.

    Lin H, Zhang Z, Zhang MQ, Ma B, Li M (2008 ) ZOOM! Zillions of oligos mapped. Bioinformatics 24: 2431–2437

    Not in our library10.1093/bioinformatics/btn416

  14. 14.

    Zhang Z, Lin H, Ma B (2010 ) ZOOM Lite: next-generation sequencing data mapping and visualization software. Nucleic Acids Res 38: W743–8

    Not in our library10.1093/nar/gkq538

  15. 15.

    Eaves HL, Gao Y (2009 ) MOM: maximum oligonucleotide mapping. Bioinformatics 25: 969–970

    Not in our library10.1093/bioinformatics/btp092

  16. 16.

    Campagna D, Albiero A, Bilardi A, Caniato E, Forcato C, et al (2009 ) PASS: a program to align short sequences. Bioinformatics 25: 967–968

    Not in our library10.1093/bioinformatics/btp087

  17. 17.

    Kim YJ, Teletia N, Ruotti V, Maher CA, Chinnaiyan AM, et al (2009 ) ProbeMatch: rapid alignment of oligonucleotides to genome allowing both gaps and mismatches. Bioinformatics 25: 1424–1425

    Not in our library10.1093/bioinformatics/btp178

  18. 18.

    Li R, Li Y, Kristiansen K, Wang J (2008 ) SOAP: short oligonucleotide alignment program. Bioinformatics 24: 713–714

    Not in our library10.1093/bioinformatics/btn025

  19. 19.

    Gontarz PM, Berger J, Wong CF (2013 ) SRmapper: a fast and sensitive genome-hashing alignment tool. Bioinformatics 29: 316–321

    Not in our library10.1093/bioinformatics/bts712

  20. 20.

    Lunter G, Goodson M (2011 ) Stampy: a statistical algorithm for sensitive and fast mapping of Illumina sequence reads. Genome Res 21: 936–939

    Not in our library10.1101/gr.111120.110

  21. 21.

    Li H, Durbin R (2009 ) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25: 1754–1760

    Not in our library10.1093/bioinformatics/btp324

  22. 22.

    Langmead B (2010) Aligning short sequencing reads with Bowtie. Curr Protoc Bioinforma Ed board Andreas D Baxevanis al Chapter 11: Unit 11.7.

    Not in our library10.1002/0471250953.bi1107s32

  23. 23.

    Langmead B, Salzberg SL (2012 ) Fast gapped-read alignment with Bowtie 2. Nat Methods 9: 357–360

    Not in our library10.1038/nmeth.1923

  24. 24.
  25. 25.

    Li R, Yu C, Li Y, Lam T-W, Yiu S-M, et al (2009 ) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics 25: 1966–1967

    Not in our library10.1093/bioinformatics/btp336

  26. 26.

    Ferragina P, Manzini G (2005 ) Indexing compressed text. J ACM 52: 552–581

    Not in our library10.1145/1082036.1082039

  27. 27.

    Ferragina P, Manzini G (2001) An experimental study of an opportunistic index: 269–278.

    Not in our library

  28. 28.

    Mahmud MP, Wiedenhoeft J, Schliep A (2012 ) Indel-tolerant read mapping with trinucleotide frequencies using cache-oblivious kd-trees. Bioinformatics 28: i325–i332

    Not in our library10.1093/bioinformatics/bts380

  29. 29.

    Tipton KF (1994 ) Nomenclature Committee of the International Union of Biochemistry and Molecular Biology (NC-IUBMB). Enzyme nomenclature. Recommendations 1992. Supplement: corrections and additions. Eur J Biochem 223: 1–5.

    Not in our library10.1111/j.1432-1033.1994.tb18960.x

  30. 30.

    The 1000 Genomes Project Consortium (2010 ) A map of human genome variation from population-scale sequencing. Nature 467: 1061–1073

    Not in our library10.1038/nature09534

  31. 31.

    The 1000 Genomes Project Consortium (2012 ) An integrated map of genetic variation from 1,092 human genomes. Nature 491: 56–65

    Not in our library10.1038/nature11632

  32. 32.

    Harris TD, Buzby PR, Babcock H, Beer E, Bowers J, et al (2008 ) Single-molecule DNA sequencing of a viral genome. Science 320: 106–109

    Not in our library10.1126/science.1150427

  33. 33.

    Garrison E, Marth G (2012) Haplotype-based variant detection from short-read sequencing: 9.

    Not in our library

  34. 34.

    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

    Not in our library10.1093/bioinformatics/btr509

  35. 35.

    Prak ET, Kazazian HH (2000 ) Mobile elements and the human genome. Nat Rev Genet 1: 134–144

    Not in our library10.1038/35038572

  36. 36.

    Griffiths D (2001 ) Endogenous retroviruses in the human genome sequence. Genome Biol 2: reviews1017.1–reviews1017.5

    Not in our library10.1186/gb-2001-2-6-reviews1017

  37. 37.
  38. 38.
  39. 39.

    Osoegawa K, Mammoser AG, Wu C, Frengen E, Zeng C, et al (2001 ) A bacterial artificial chromosome library for sequencing the complete human genome. Genome Res 11: 483–496

    Not in our library10.1101/gr.169601

  40. 40.
All 70 references

Cited by papers we hold 12

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.