Evidence map›Paper›PMID 32657392›Full record

ArticleBioinformatics (Oxford, England)2020

REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets.

Camille Marchet, Zamin Iqbal, Daniel Gautheret, Mikaël Salson, Rayan Chikhi

Open access · bronzeAbstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 29 papers.

0numbers the graph read from it
0cells of the map it votes in
29citing papers in PubMed
3.2field-weighted citation impact, top 7% of its field
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

29 citing papers in PubMed, 71 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Review
  6. Article
  7. Article
  8. A survey of k-mer methods and applications in bioinformatics.Computational and structural biotechnology journal · 2024
    Review
  9. Article
  10. Article
  11. Article
  12. Article
  13. Compression algorithm for colored de Bruijn graphs.Algorithms for molecular biology : AMB · 2024
    Article
  14. Creating and Using Minimizer Sketches in Computational Genomics.Journal of computational biology : a journal of computational molecular cell biology · 2023
    Review
  15. Compression Algorithm for Colored de Bruijn Graphs.Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop) · 2023
    Article
  16. On weighted k-mer dictionaries.Algorithms for molecular biology : AMB · 2023
    Article
  17. Article
  18. Article
  19. Article
  20. Article
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

5 authors at 4 institutions in 2 countries.

Camille MarchetCNRS, UMR 9189 - CRIStAL, Université de Lille, F-59000 Lille, France.
Zamin IqbalEuropean Bioinformatics Institute, Cambridge CB10 1SD, UK.
Daniel GautheretCEA, CNRS, Institute for Integrative Biology of the Cell (I2BC), Université Paris-Saclay, Gif-sur-Yvette 91190, France.
Mikaël SalsonCNRS, UMR 9189 - CRIStAL, Université de Lille, F-59000 Lille, France.
Rayan ChikhiInstitut Pasteur, CNRS, C3BI - USR 3756, 75015 Paris, France.
Centre National de la Recherche Scientifique · FREuropean Bioinformatics Institute · GBInstitut Pasteur · FRUniversité Paris-Saclay · FR

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationIn this work we present REINDEER, a novel computational method that performs indexing of sequences and records their abundances across a collection of datasets. To the best of our knowledge, other indexing methods have so far been unable to record abundances efficiently across large datasets.

resultsWe used REINDEER to index the abundances of sequences within 2585 human RNA-seq experiments in 45 h using only 56 GB of RAM. This makes REINDEER the first method able to record abundances at the scale of ∼4 billion distinct k-mers across 2585 datasets. REINDEER also supports exact presence/absence queries of k-mers. Briefly, REINDEER constructs the compacted de Bruijn graph of each dataset, then conceptually merges those de Bruijn graphs into a single global one. Then, REINDEER constructs and indexes monotigs, which in a nutshell are groups of k-mers of similar abundances. AVAILABILITY AND IMPLEMENTATION: https://github.com/kamimrcht/REINDEER. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

Sequence Analysis, DNASoftwareAlgorithmsHumansSequence Analysis, RNA

Identifiers

PMID32657392
PMCPMC7355249
OpenAlexW3043153155

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.