The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Lighter: fast and memory-efficient sequencing error correction without counting
Open accessAbstract
Lighter is a fast, memory-efficient tool for correcting sequencing errors. Lighter avoids counting k-mers. Instead, it uses a pair of Bloom filters, one holding a sample of the input k-mers and the other holding k-mers likely to be correct. As long as the sampling fraction is adjusted in inverse proportion to the depth of sequencing, Bloom filter size can be held constant while maintaining near-constant accuracy. Lighter is parallelized, uses no secondary storage, and is both faster and more memory-efficient than competing approaches while achieving comparable accuracy.
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
Fast gapped-read alignment with Bowtie 2
Langmead, B., & Salzberg, S. L. (2012) · Nature Methods · doi:10.1038/nmeth.1923 · Cited by 56,400
Self-citationQUAST: quality assessment tool for genome assemblies
Gurevich, A., Saveliev, V., Vyahhi, N., & Tesler, G. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt086 · Cited by 11,172
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
SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler
Luo, R., Liu, B., Xie, Y., Li, Z., Huang, W., Yuan, J., He, G., Chen, Y., Pan, Q., Liu, Y., et al. (2012) · Gigascience · doi:10.1186/2047-217x-1-18 · Cited by 5,307
Aligning sequence reads, clone sequences and assembly con*gs with BWA-MEM
Li, H. (2014) · arXiv (Cornell University) · doi:10.6084/m9.figshare.963153.v1 · Cited by 4,932
A fast, lock-free approach for efficient parallel counting of occurrences of k -mers
Marçais, G., & Kingsford, C. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr011 · Cited by 4,661
Summary cache: a scalable wide-area Web cache sharing protocol
Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.851975 · Cited by 1,811
An improved data stream summary: the count-min sketch and its applications
Cormode, G., & Muthukrishnan, S. (2005) · Journal of Algorithms · doi:10.1016/j.jalgor.2003.12.001 · Cited by 1,743
ART: a next-generation sequencing read simulator
Huang, W., Li, L., Myers, J. R., & Marth, G. T. (2012) · Bioinformatics · doi:10.1093/bioinformatics/btr708 · Cited by 1,596
Cited by
Mash: fast genome and metagenome distance estimation using MinHash
Ondov, B. D., Treangen, T. J., Melsted, P., Mallonee, A. B., Bergman, N. H., Koren, S., & Phillippy, A. M. (2016) · Genome biology · doi:10.1186/s13059-016-0997-x · Cited by 3,373
Maruyama, T., Dougan, S. K., Truttmann, M. C., Bilate, A. M., Ingram, J. R., & Ploegh, H. L. (2015) · Nature Biotechnology · doi:10.1038/nbt.3190 · Cited by 1,137
Haplotype-resolved diverse human genomes and integrated analysis of structural variation
Ebert, P., Audano, P. A., Zhu, Q., Rodriguez-Martin, B., Porubsky, D., Bonder, M. J., Sulovari, A., Ebler, J., Zhou, W., Serra Mari, R., et al. (2021) · Science · doi:10.1126/science.abf7117 · Cited by 702
Tempo and Mode of Genome Evolution in the Budding Yeast Subphylum
Shen, X.-X., Opulente, D. A., Kominek, J., Zhou, X., Steenwyk, J. L., Buh, K. V., Haase, M. A. B., Wisecaver, J. H., Wang, M., Doering, D. T., et al. (2018) · Cell · doi:10.1016/j.cell.2018.10.023 · Cited by 619
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
Metadata
- Authors
- Song, L., Florea, L., & Langmead, B.
- Venue
- Genome Biology
- Published
- 2014
- Volume
- 15
- Issue
- 11
- Pages
- 509
- ISSN
- 1465-6906 (ISSN-L)
- OpenAlex
- W2001079689
- Cited by
- 258
- References
- 36
- FWCI
- 8.03
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Lighter: fast and memory-efficient sequencing error correction without counting. https://app.cochat.ai/papers/10.1186/preaccept-9663167051308943
- The paper
- Song, L., Florea, L., & Langmead, B. (2014). Lighter: fast and memory-efficient sequencing error correction without counting. Genome Biology. https://doi.org/10.1186/preaccept-9663167051308943
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.
