2014
DOI: 10.1371/journal.pone.0090581
|View full text |Cite
|
Sign up to set email alerts
|

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

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 Proje… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
192
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 243 publications
(192 citation statements)
references
References 67 publications
(92 reference statements)
0
192
0
Order By: Relevance
“…The captured DNA was sequenced with the Illumina HiSeq 2000 Sequencing System (Illumina, San Diego, CA, USA). Sequencing reads were split by barcode, filtered, and trimmed by quality and aligned to a hybrid P. trichocarpa / P. deltoides reference genome using MOSAIK 2.2 (Lee et al., 2014). …”
Section: Methodsmentioning
confidence: 99%
“…The captured DNA was sequenced with the Illumina HiSeq 2000 Sequencing System (Illumina, San Diego, CA, USA). Sequencing reads were split by barcode, filtered, and trimmed by quality and aligned to a hybrid P. trichocarpa / P. deltoides reference genome using MOSAIK 2.2 (Lee et al., 2014). …”
Section: Methodsmentioning
confidence: 99%
“…Some tools, like MOSAIK, use k-mer-based indexing, in which short k-mer sequences from the reference are related to their locations using a hash table or other traditional keyvalue data structure (Lee et al 2014). Other tools, such as BWA-MEM, use Burrows-Wheeler Transform-based approaches, in which the reference is stored in a succinct self-indexed data structure optimized for substring search (Li 2013).…”
Section: Read Mapping In Genome Graphsmentioning
confidence: 99%
“…Basically Needleman Wunsch and Smith waterman algorithm [8] come under this approach. These are much more complex than the exact pattern matching.…”
Section: ) Dynamic Programming Algorithmsmentioning
confidence: 99%
“…smaller problems are solved in succession to solve the main problem. A)Smith-Waterman (local alignment) [8] • Accuracy: good with gapped pairs…”
Section: ) Dynamic Programming Algorithmsmentioning
confidence: 99%