The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Efficient counting of k-mers in DNA sequences using a bloom filter
Open accessAbstract
BACKGROUND: Counting k-mers (substrings of length k in DNA sequence data) is an essential component of many methods in bioinformatics, including for genome and transcriptome assembly, for metagenomic sequencing, and for error correction of sequence reads. Although simple in principle, counting k-mers in large modern sequence data sets can easily overwhelm the memory capacity of standard computers. In current data sets, a large fraction-often more than 50%-of the storage capacity may be spent on storing k-mers that contain sequencing errors and which are typically observed only a single time in the data. These singleton k-mers are uninformative for many algorithms without some kind of error correction. RESULTS: We present a new method that identifies all the k-mers that occur more than once in a DNA sequence data set. Our method does this using a Bloom filter, a probabilistic data structure that stores all the observed k-mers implicitly in memory with greatly reduced memory requirements. We then make a second sweep through the data to provide exact counts of all nonunique k-mers. For example data sets, we report up to 50% savings in memory usage compared to current software, with modest costs in computational speed. This approach may reduce memory requirements for any algorithm that starts by counting k-mers in sequence data with errors. CONCLUSIONS: A reference implementation for this methodology, BFCounter, is written in C++ and is GPL licensed. It is available for free download at http://pritch.bsd.uchicago.edu/bfcounter.html.
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
A map of human genome variation from population-scale sequencing.
The 1000 Genomes Project Consortium (2010) · Nature · doi:10.1038/nature09534 · Cited by 7,877
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
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 · cited 2×
“For genome assembly methods the construction of de Bruijn graphs dominates memory consumption [7] and the time for completion can be several days [13], depending on the amount of postprocessing.”
MethodThe 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
Cited by
Ye, C., Hill, C. M., Wu, S., Ruan, J., & Ma, Z. (2016) · Scientific Reports · doi:10.1038/srep31900 · Cited by 304
DSK: k-mer counting with very low memory usage
Rizk, G., Lavenier, D., & Chikhi, R. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt020 · Cited by 301
Computational pan-genomics: status, promises and challenges
(2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbw089 · Cited by 287
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
A survey of k-mer methods and applications in bioinformatics
Moeckel, C., Mareboina, M., Konnaris, M. A., Chan, C. S. Y., Mouratidis, I., Montgomery, A., Chantzi, N., Pavlopoulos, G. A., & Georgakopoulos-Soares, I. (2024) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2024.05.025 · Cited by 131
“Recently, k-mer-based alignment algorithms have been utilized in detecting and filtering out contamination by comparing observed k-mers against a BFCounter[201], CHTKC [202], Discount[203], DSK2 [204], GECKO[205], Gerbil [206], Jellyfish2[8], KAnalyze [207], KCMBT[208], KCOSS [209], KHMer[210], KMC3 [45], KmerAnalysis…”
Method
Metadata
- Authors
- Melsted, P., & Pritchard, J. K.
- Venue
- BMC Bioinformatics
- Published
- 2011-08-10
- Volume
- 12
- Issue
- 1
- Pages
- 333-333
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2163584430
- Cited by
- 283
- References
- 4
- FWCI
- 11.83
- 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: Efficient counting of k-mers in DNA sequences using a bloom filter. https://app.cochat.ai/papers/10.1186/1471-2105-12-333
- The paper
- Melsted, P., & Pritchard, J. K. (2011). Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-12-333
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.