de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Fast and accurate read mapping with approximate seeds and multiple backtracking

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons50558

Siragusa,  E.
Dept. of Computational Molecular Biology (Head: Martin Vingron), Max Planck Institute for Molecular Genetics, Max Planck Society;
Department of Mathematics and Computer Science, Freie Universität Berlin;

Locator
There are no locators available
Fulltext (public)

Siragusa et al.pdf
(Publisher version), 328KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Siragusa, E., Weese, D., & Reinert, K. (2013). Fast and accurate read mapping with approximate seeds and multiple backtracking. Nucleic Acids Research (London), 41(7), e78-e78. doi:10.1093/nar/gkt005.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-7BB1-F
Abstract
We present Masai, a read mapper representing the state-of-the-art in terms of speed and accuracy. Our tool is an order of magnitude faster than RazerS 3 and mrFAST, 2-4 times faster and more accurate than Bowtie 2 and BWA. The novelties of our read mapper are filtration with approximate seeds and a method for multiple backtracking. Approximate seeds, compared with exact seeds, increase filtration specificity while preserving sensitivity. Multiple backtracking amortizes the cost of searching a large set of seeds by taking advantage of the repetitiveness of next-generation sequencing data. Combined together, these two methods significantly speed up approximate search on genomic data sets. Masai is implemented in C++ using the SeqAn library. The source code is distributed under the BSD license and binaries for Linux, Mac OS X and Windows can be freely downloaded from http://www.seqan.de/projects/masai.