The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Musket: a multistage k-mer spectrum-based error corrector for Illumina sequence data
Abstract
Motivation: The imperfect sequence data produced by next-generation sequencing technologies have motivated the development of a number of short-read error correctors in recent years. The majority of methods focus on the correction of substitution errors, which are the dominant error source in data produced by Illumina sequencing technology. Existing tools either score high in terms of recall or precision but not consistently high in terms of both measures. Results: In this article, we present Musket, an efficient multistage k-mer-based corrector for Illumina short-read data. We use the k-mer spectrum approach and introduce three correction techniques in a multistage workflow: two-sided conservative correction, one-sided aggressive correction and voting-based refinement. Our performance evaluation results, in terms of correction quality and de novo genome assembly measures, reveal that Musket is consistently one of the top performing correctors. In addition, Musket is multi-threaded using a master–slave model and demonstrates superior parallel scalability compared with all other evaluated correctors as well as a highly competitive overall execution time. Availability: Musket is available at http://musket.sourceforge.net. Contact: liuy@uni-mainz.de or bertil.schmidt@uni-mainz.de Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
Zerbino, D. R., & Birney, E. (2008) · Genome Research · doi:10.1101/gr.074492.107 · Cited by 9,491
Space/time trade-offs in hash coding with allowable errors
Bloom, B. H. (1970) · Communications of the ACM · doi:10.1145/362686.362692 · Cited by 7,492
Base-Calling of Automated Sequencer Traces Using Phred. I. Accuracy Assessment
Ewing, B., Hillier, L., Wendl, M. C., & Green, P. (1998) · Genome Research · doi:10.1101/gr.8.3.175 · Cited by 6,967
Base-Calling of Automated Sequencer Traces Using Phred. II. Error Probabilities
Ewing, B., & Green, P. (1998) · Genome Research · doi:10.1101/gr.8.3.186 · Cited by 5,439
ABySS: A parallel assembler for short read sequence data
Simpson, J. T., Wong, K., Jackman, S. D., Schein, J. E., Jones, S. J. M., & Birol, İ. (2009) · Genome Research · doi:10.1101/gr.089532.108 · Cited by 3,608
De novo assembly of human genomes with massively parallel short read sequencing
Li, R., Zhu, H., Ruan, J., Qian, W., Fang, X., Shi, Z., Li, Y., Li, S., Shan, G., Kristiansen, K., et al. (2010) · Genome Research · doi:10.1101/gr.097261.109 · Cited by 2,926
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
High-quality draft assemblies of mammalian genomes from massively parallel sequence data
Gnerre, S., MacCallum, I., Przybylski, D., Ribeiro, F. J., Burton, J. N., Walker, B. J., Sharpe, T., Hall, G., Shea, T. P., Sykes, S., et al. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1017351108 · Cited by 1,533
An Eulerian path approach to DNA fragment assembly
Pevzner, P. A., Tang, H., & Waterman, M. S. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.171285098 · Cited by 1,352
The sequence and de novo assembly of the giant panda genome
Li, R., Fan, W., Tian, G., Zhu, H., He, L., Cai, J., Huang, Q., Cai, Q., Li, B., Bai, Y., et al. (2010) · Nature · doi:10.1038/nature08696 · Cited by 1,180
Substantial biases in ultra-short read data sets from high-throughput DNA sequencing
Dohm, J. C., Lottaz, C., Borodina, T., & Himmelbauer, H. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn425 · Cited by 1,088
ALLPATHS: De novo assembly of whole-genome shotgun microreads
Butler, J., MacCallum, I., Kleber, M., Shlyakhter, I. A., Belmonte, M. K., Lander, E. S., Nusbaum, C., & Jaffe, D. B. (2008) · Genome Research · doi:10.1101/gr.7337908 · Cited by 808
Efficient de novo assembly of large genomes using compressed data structures
Simpson, J. T., & Durbin, R. (2012) · Genome Research · doi:10.1101/gr.126953.111 · Cited by 768
Ferragina, P., & Manzini, G. (2005) · Journal of the ACM · doi:10.1145/1082036.1082039 · Cited by 686
GAGE: A critical evaluation of genome assemblies and assembly algorithms
Salzberg, S. L., Phillippy, A. M., Zimin, A., Puiu, D., Magoc, T., Koren, S., Treangen, T. J., Schatz, M. C., Delcher, A. L., Roberts, M., et al. (2012) · Genome Research · doi:10.1101/gr.131383.111 · Cited by 682
Quake: quality-aware detection and correction of sequencing errors
Kelley, D. R., Schatz, M. C., & Salzberg, S. L. (2010) · Genome Biology · doi:10.1186/gb-2010-11-11-r116 · Cited by 582
Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly
Li, H. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts280 · Cited by 398
Efficient counting of k-mers in DNA sequences using a bloom filter
Melsted, P., & Pritchard, J. K. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-333 · Cited by 283
De novo fragment assembly with short mate-paired reads: Does the read length matter?
Chaisson, M. J., Brinza, D., & Pevzner, P. A. (2009) · Genome Research · doi:10.1101/gr.079053.108 · Cited by 279
A survey of error-correction methods for next-generation sequencing
Yang, X., Chockalingam, S. P., & Aluru, S. (2013) · Briefings in Bioinformatics · doi:10.1093/bib/bbs015 · Cited by 249
Fragment assembly with short reads
Chaisson, M., Pevzner, P., & Tang, H. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth205 · Cited by 213
Correcting errors in short reads by multiple alignments
Salmela, L., & Schröder, J. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr170 · Cited by 176
Self-citationCUSHAW: a CUDA compatible short read aligner to large genomes based on the Burrows–Wheeler transform
Liu, Y., Schmidt, B., & Maskell, D. L. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts276 · Cited by 160
Self-citationReptile: representative tiling for short read error correction
Yang, X., Dorman, K. S., & Aluru, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq468 · Cited by 158
HiTEC: accurate error correction in high-throughput sequencing data
Ilie, L., Fazayeli, F., & Ilie, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq653 · Cited by 137
ECHO: A reference-free short-read error correction algorithmPreprint
Kao, W.-C., Chan, A. H., & Song, Y. S. (2011) · Genome Research · doi:10.1101/gr.111351.110 · Cited by 118
Error correction of high-throughput sequencing datasets with non-uniform coverage
Medvedev, P., Scott, E., Kakaradov, B., & Pevzner, P. A. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr208 · Cited by 118
Correction of sequencing errors in a mixed set of reads
Salmela, L. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq151 · Cited by 109
Parallelized short read assembly of large genomes using de Bruijn graphs
Liu, Y., Schmidt, B., & Maskell, D. L. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-354 · Cited by 75
Self-citationShi, H., Schmidt, B., Liu, W., & Müller‐Wittig, W. (2010) · Journal of Computational Biology · doi:10.1089/cmb.2009.0062 · Cited by 66
Self-citationLiu, Y., Schmidt, B., & Maskell, D. L. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-85 · Cited by 63
Self-citation
Cited by
Domestication and Divergence of Saccharomyces cerevisiae Beer Yeasts
Gallone, B., Steensels, J., Prahl, T., Soriaga, L., Saels, V., Herrera-Malaver, B., Merlevede, A., Roncoroni, M., Voordeckers, K., Miraglia, L., et al. (2016) · Cell · doi:10.1016/j.cell.2016.08.020 · Cited by 679
Rcorrector: efficient and accurate error correction for Illumina RNA-seq reads
Song, L., & Florea, L. (2015) · Gigascience · doi:10.1186/s13742-015-0089-y · Cited by 547
The antimicrobial potential of Streptomyces from insect microbiomes
Chevrette, M. G., Carlson, C. M., Ortega, H. E., Thomas, C., Ananiev, G. E., Barns, K. J., Book, A. J., Cagnazzo, J., Carlos, C., Flanigan, W., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-08438-0 · Cited by 340
Denoising DNA deep sequencing data—high-throughput sequencing errors and their correction
Laehnemann, D., Borkhardt, A., & McHardy, A. C. (2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbv029 · Cited by 296
Lighter: fast and memory-efficient sequencing error correction without counting
Song, L., Florea, L., & Langmead, B. (2014) · Genome Biology · doi:10.1186/preaccept-9663167051308943 · Cited by 258
Metadata
- Authors
- Liu, Y., Schröder, J., & Schmidt, B.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2012-11-29
- Volume
- 29
- Issue
- 3
- Pages
- 308-315
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2014099509
- Cited by
- 287
- References
- 31
- FWCI
- 6.39
- Type
- journal article
- Language
- en
- Open access
- closed
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.