Evidence map›Paper›PMID 37558282›Full record

ArticleGenome research2023

Efficient minimizer orders for large values of

David Pellow, Lianrong Pu, Bariş Ekim, Lior Kotlar, Bonnie Berger, Ron Shamir, Yaron Orenstein

Open access · bronzeAbstract read
In one paragraph

Article in Genome research, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

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

11 citing papers in PubMed, 19 citations in OpenAlex.

  1. GreedyMini: generating low-density DNA minimizers.Bioinformatics (Oxford, England) · 2025
    Article
  2. The open-closed mod-minimizer algorithm.Algorithms for molecular biology : AMB · 2025
    Article
  3. Fractional hitting sets for efficient multiset sketching.Algorithms for molecular biology : AMB · 2025
    Article
  4. Article
  5. Article
  6. A near-tight lower bound on the density of forward sampling schemes.bioRxiv : the preprint server for biology · 2024
    Article
  7. k-nonical space: sketching with reverse complements.Bioinformatics (Oxford, England) · 2024
    Article
  8. Review
  9. Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets.Journal of computational biology : a journal of computational molecular cell biology · 2024
    Article
  10. Creating and Using Minimizer Sketches in Computational Genomics.Journal of computational biology : a journal of computational molecular cell biology · 2023
    Review
  11. 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

7 authors at 4 institutions in 2 countries.

David PellowBlavatnik School of Computer Science, Tel-Aviv University, Tel Aviv 6997801, Israel.
Lianrong PuBlavatnik School of Computer Science, Tel-Aviv University, Tel Aviv 6997801, Israel.
Bariş EkimComputer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA.ORCID 0000-0002-4040-403X
Lior KotlarDepartment of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 8410501, Israel.
Bonnie BergerComputer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, USA.
Ron ShamirBlavatnik School of Computer Science, Tel-Aviv University, Tel Aviv 6997801, Israel; yaron.orenstein@biu.ac.il rshamir@tau.ac.il.ORCID 0000-0003-1889-9870
Yaron OrensteinDepartment of Computer Science, Bar-Ilan University, Ramat-Gan 5290002, Israel; yaron.orenstein@biu.ac.il rshamir@tau.ac.il.ORCID 0000-0002-3583-3112
Tel Aviv University · ILMassachusetts Institute of Technology · USBar-Ilan University · ILBen-Gurion University of the Negev · IL

Funding

Manifold representations and active learning for 21 st century biologyR35GM141861 · NIGMS · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI BERGER, BONNIE · 2021 to 2025
$1.9M
NIGMS NIH HHS R35 GM141861
6 · The paper itself

Abstract

Minimizers are ubiquitously used in data structures and algorithms for efficient searching, mapping, and indexing of high-throughput DNA sequencing data. Minimizer schemes select a minimum

Indexed as

AlgorithmsSoftwareHigh-Throughput Nucleotide SequencingSequence Analysis, DNA

Identifiers

PMID37558282
PMCPMC10538483
OpenAlexW4385708519

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.