The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
RazerS 3: Faster, fully sensitive read mapping
Open accessAbstract
Motivation: During the past years, next-generation sequencing has become a key technology for many applications in the biomedical sciences. Throughput continues to increase and new protocols provide longer reads than currently available. In almost all applications, read mapping is a first step. Hence, it is crucial to have algorithms and implementations that perform fast, with high sensitivity, and are able to deal with long reads and a large absolute number of insertions and deletions. Results: RazerS is a read mapping program with adjustable sensitivity based on counting q-grams. In this work, we propose the successor RazerS 3, which now supports shared-memory parallelism, an additional seed-based filter with adjustable sensitivity, a much faster, banded version of the Myers’ bit-vector algorithm for verification, memory-saving measures and support for the SAM output format. This leads to a much improved performance for mapping reads, in particular, long reads with many errors. We extensively compare RazerS 3 with other popular read mappers and show that its results are often superior to them in terms of sensitivity while exhibiting practical and often competitive run times. In addition, RazerS 3 works without a pre-computed index. Availability and Implementation: Source code and binaries are freely available for download at http://www.seqan.de/projects/razers. RazerS 3 is implemented in C++ and OpenMP under a GPL license using the SeqAn library and supports Linux, Mac OS X and Windows. Contact: david.weese@fu-berlin.de Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
A survey of sequence alignment algorithms for next-generation sequencing
Li, H., & Homer, N. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbq015 · Cited by 875 · cited 1×
“In a recent publication, Li and Homer (2010) give a survey and categorize the existing tools into approaches using a q-gram index for a seed-and-extend strategy (e.g. Ahmadi et al., 2011; Alkan et al., 2009; Bauer et al., 2010; David et al., 2011; Weese et al., 2009) or recursively descending a…”
BackgroundPersonalized copy number and segmental duplication maps using next-generation sequencing
Alkan, C., Kidd, J. M., Marques-Bonet, T., Aksay, G., Antonacci, F., Hormozdiari, F., Kitzman, J. O., Baker, C., Malig, M., Mutlu, O., et al. (2009) · Nature Genetics · doi:10.1038/ng.437 · Cited by 748
SHRiMP2: Sensitive yet Practical Short Read Mapping
David, M., Dzamba, M., Lister, D., Ilie, L., & Brudno, M. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr046 · Cited by 348
Cited by
The Subread aligner: fast, accurate and scalable read mapping by seed-and-vote
Liao, Y., Smyth, G. K., & Shi, W. (2013) · Nucleic Acids Research · doi:10.1093/nar/gkt214 · Cited by 3,064
Şenbabaoğlu, Y., Gejman, R. S., Winer, A. G., Liu, M., Van Allen, E. M., de Velasco, G., Miao, D., Ostrovnaya, I., Drill, E., Luna, A., et al. (2016) · Genome Biology · doi:10.1186/s13059-016-1092-z · Cited by 968
Assembling large genomes with single-molecule sequencing and locality-sensitive hashing
Berlin, K., Koren, S., Chin, C.-S., Drake, J. P., Landolin, J. M., & Phillippy, A. M. (2015) · Nature Biotechnology · doi:10.1038/nbt.3238 · Cited by 934
OptiType: precision HLA typing from next-generation sequencing data
Szolek, A., Schubert, B., Mohr, C., Sturm, M., Feldhahn, M., & Kohlbacher, O. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu548 · Cited by 769
Intratumoral heterogeneity and clonal evolution in liver cancer
Losic, B., Craig, A. J., Villacorta-Martin, C., Martins-Filho, S. N., Akers, N., Chen, X., Ahsen, M. E., von Felden, J., Labgaa, I., DʹAvola, D., et al. (2020) · Nature Communications · doi:10.1038/s41467-019-14050-z · Cited by 363
Metadata
- Authors
- Weese, D., Holtgrewe, M., & Reinert, K.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-08-24
- Volume
- 28
- Issue
- 20
- Pages
- 2592-2599
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2133687564
- Cited by
- 158
- References
- 4
- FWCI
- 5.92
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.