Cited by 4,661Algorithms and Data CompressionGenomics and Phylogenetic StudiesFractal and DNA sequence analysis

A fast, lock-free approach for efficient parallel counting of occurrences of k -mers

Open access
Marçais, Guillaume, Kingsford, Carl·2011·Bioinformatics

Abstract

Motivation: Counting the number of occurrences of every k-mer (substring of length k) in a long string is a central subproblem in many applications, including genome assembly, error correction of sequencing reads, fast multiple sequence alignment and repeat detection. Recently, the deep sequence coverage generated by next-generation sequencing technologies has caused the amount of sequence to be processed during a genome project to grow rapidly, and has rendered current k-mer counting tools too slow and memory intensive. At the same time, large multicore computers have become commonplace in research facilities allowing for a new parallel computational paradigm. Results: We propose a new k-mer counting algorithm and associated implementation, called Jellyfish, which is fast and memory efficient. It is based on a multithreaded, lock-free hash table optimized for counting k-mers up to 31 bases in length. Due to their flexibility, suffix arrays have been the data structure of choice for solving many string problems. For the task of k-mer counting, important in many biological applications, Jellyfish offers a much faster and more memory-efficient solution. Availability: The Jellyfish software is written in C++ and is GPL licensed. It is available for download at http://www.cbcb.umd.edu/software/jellyfish. Contact: gmarcais@umd.edu Supplementary information: Supplementary data are available at Bioinformatics online.

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btr011

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Marçais, G., & Kingsford, C.
Affiliations
University of Maryland, College Park (US)
Corresponding author
Marçais, Guillaume
Venue
Bioinformatics
Published
2011-01-07
Volume
27
Issue
6
Pages
764-770
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2096128575
Cited by
4,661
References
2
Citations by year
2026: 471 · 2025: 706 · 2024: 637 · 2023: 479 · 2022: 504 · 2021: 547 · 2020: 348 · 2019: 246 · 2018: 204 · 2017: 150 · 2016: 125 · 2015: 87 · 2014: 82 · 2013: 47 · 2012: 15
FWCI
45.06
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion)
  • PubMed Central (publishedVersion)
  • PubMed (publishedVersion)
Funders
  • National Science Foundation (0616585, 0849899, 0812111)
  • National Institutes of Health
  • National Human Genome Research Institute (1R01HG0294501)
  • National Institute of Allergy and Infectious Diseases (R21AI085376)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
Keywords
k-mer counting, jellyfish, multithreaded algorithms, suffix arrays, genome assembly, memory efficiency
MeSH terms
Algorithms, Animals, Base Sequence, Humans, Software, Sequence Alignment, Genome, Sequence Analysis, DNA, Computational Biology

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