Evidence map›Paper›PMID 21217122›Full record

ArticleBioinformatics (Oxford, England)2011

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

Guillaume Marçais, Carl Kingsford

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2,916 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
2,916citing papers in PubMed, 1 pooled it
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2,916 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Article
  4. Article
  5. Novel genetic profile linked to cognitive decline in Hispanics/Latinos.Alzheimer's & dementia : the journal of the Alzheimer's Association · 2026
    Article
  6. Adaptive cold-environmental strategies ofHorticulture research · 2026
    Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Telomere-to-Telomere Genome Assemblies ofJournal of fungi (Basel, Switzerland) · 2026
    Article
  13. Article
  14. Article
  15. A highly contiguous genome assembly of Cyclamen persicum to accelerate functional genomics and breeding.DNA research : an international journal for rapid publication of reports on genes and genomes · 2026
    Article
  16. Chromosome-scale genome assembly and genomic prediction of essential oil compounds in Atractylodes lancea for genomics-assisted breeding.DNA research : an international journal for rapid publication of reports on genes and genomes · 2026
    Article
  17. Article
  18. Article
  19. Article
  20. Article

2,856 more citing papers are in PubMed but not listed here.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Guillaume MarçaisDepartment of Computer Science, University of Maryland, College Park, MD 20742, USA. gmarcais@umd.edu
Carl Kingsford

Funding

Reliable Assembler for Whole Genome Shotgun Data.R01HG002945 · NHGRI · UNIV OF MARYLAND, COLLEGE PARK · PI YORKE, JAMES A · 2003 to 2013
$2.1M
Accurate Computational Detection of Influenza ReassortmentsR21AI085376 · NIAID · UNIV OF MARYLAND, COLLEGE PARK · PI KINGSFORD, CARLETON LEE · 2010 to 2011
$369k
NHGRI NIH HHS 1R01HG0294501NIAID NIH HHS 1R21AI085376NIAID NIH HHS R21 AI085376
6 · The paper itself

Abstract

motivationCounting 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.

resultsWe 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.

Indexed as

AlgorithmsSoftwareAnimalsBase SequenceComputational BiologyGenomeHumansSequence AlignmentSequence Analysis, DNA

Identifiers

PMID21217122
PMCPMC3051319

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.