Evidence map›Paper›PMID 36699393›Full record

ArticleBioinformatics advances2022

kmtricks: efficient and flexible construction of Bloom filters for large sequencing data collections.

Téo Lemane, Paul Medvedev, Rayan Chikhi, Pierre Peterlongo

Abstract read
In one paragraph

Article in Bioinformatics advances, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 23 papers.

0numbers the graph read from it
0cells of the map it votes in
23citing papers in PubMed
–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

23 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Logan: Planetary-Scale Genome Assembly Surveys Life's Diversity.bioRxiv : the preprint server for biology · 2025
    Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. PSBF:Sensors (Basel, Switzerland) · 2023
    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

4 authors.

Téo LemaneUniv. Rennes, Inria, CNRS, IRISA, Rennes F-35000, France.ORCID https://orcid.org/0000-0002-7210-3178
Paul MedvedevDepartment of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16801, USA.ORCID https://orcid.org/0000-0003-3143-594X
Rayan ChikhiSequence Bioinformatics, Institut Pasteur, Université Paris Cité, Paris F-75015, France.
Pierre PeterlongoUniv. Rennes, Inria, CNRS, IRISA, Rennes F-35000, France.ORCID https://orcid.org/0000-0003-0776-6407

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Summary: When indexing large collections of short-read sequencing data, a common operation that has now been implemented in several tools (Sequence Bloom Trees and variants, BIGSI) is to construct a collection of Bloom filters, one per sample. Each Bloom filter is used to represent a set of Availability and implementation: https://github.com/tlemane/kmtricks. Supplementary information: Supplementary data are available at

Identifiers

PMID36699393
PMCPMC9710589

What OpenQuestion holds

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