The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
DSK: k-mer counting with very low memory usage
Open accessAbstract
Summary: Counting all the k-mers (substrings of length k) in DNA/RNA sequencing reads is the preliminary step of many bioinformatics applications. However, state of the art k-mer counting methods require that a large data structure resides in memory. Such structure typically grows with the number of distinct k-mers to count. We present a new streaming algorithm for k-mer counting, called DSK (disk streaming of k-mers), which only requires a fixed user-defined amount of memory and disk space. This approach realizes a memory, time and disk trade-off. The multi-set of all k-mers present in the reads is partitioned, and partitions are saved to disk. Then, each partition is separately loaded in memory in a temporary hash table. The k-mer counts are returned by traversing each hash table. Low-abundance k-mers are optionally filtered. DSK is the first approach that is able to count all the 27-mers of a human genome dataset using only 4.0 GB of memory and moderate disk space (160 GB), in 17.9 h. DSK can replace a popular k-mer counting software (Jellyfish) on small-memory servers. Availability: http://minia.genouest.org/dsk Contact: rayan.chikhi@ens-cachan.org
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 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
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
Cited by
Informed and automated k-mer size selection for genome assembly
Chikhi, R., & Medvedev, P. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btt310 · Cited by 721
Self-citationAssembly of long error-prone reads using de Bruijn graphs
Lin, Y., Yuan, J., Kolmogorov, M., Shen, M. W., Chaisson, M., & Pevzner, P. A. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1604560113 · Cited by 382
Trajectory and genomic determinants of fungal-pathogen speciation and host adaptation
Hu, X., Xiao, G., Zheng, P., Shang, Y., Su, Y., Zhang, X., Liu, X., Zhan, S., St. Leger, R. J., & Wang, C. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1412662111 · Cited by 322
Computational pan-genomics: status, promises and challenges
(2016) · Briefings in Bioinformatics · doi:10.1093/bib/bbw089 · Cited by 287
Earle, S. G., Wu, C.-H., Charlesworth, J., Stoesser, N., Gordon, N. C., Walker, T. M., Spencer, C. C. A., Iqbal, Z., Clifton, D. A., Hopkins, K. L., et al. (2016) · Nature Microbiology · doi:10.1038/nmicrobiol.2016.41 · Cited by 286
Metadata
- Authors
- Rizk, G., Lavenier, D., & Chikhi, R.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2013-01-16
- Volume
- 29
- Issue
- 5
- Pages
- 652-653
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2057253402
- Cited by
- 301
- References
- 2
- FWCI
- 9.95
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: DSK: k-mer counting with very low memory usage. https://app.cochat.ai/papers/10.1093/bioinformatics/btt020
- The paper
- Rizk, G., Lavenier, D., & Chikhi, R. (2013). DSK: k-mer counting with very low memory usage. Bioinformatics. https://doi.org/10.1093/bioinformatics/btt020
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.