Evidence map›Paper›PMID 28373894›Full record

ArticleAlgorithms for molecular biology : AMB2017

Gerbil: a fast and memory-efficient

Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann

Open access · goldAbstract read
In one paragraph

Article in Algorithms for molecular biology : AMB, 2017. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 15 papers.

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

15 citing papers in PubMed, 81 citations in OpenAlex.

  1. Swiftly identifying strongly unique k-mers.Algorithms for molecular biology : AMB · 2025
    Article
  2. Article
  3. A survey of k-mer methods and applications in bioinformatics.Computational and structural biotechnology journal · 2024
    Review
  4. Review
  5. Article
  6. Density and Conservation Optimization of the Generalized Masked-Minimizer Sketching Scheme.Journal of computational biology : a journal of computational molecular cell biology · 2024
    Article
  7. Creating and Using Minimizer Sketches in Computational Genomics.Journal of computational biology : a journal of computational molecular cell biology · 2023
    Review
  8. Article
  9. Differentiable Learning of Sequence-Specific Minimizer Schemes with DeepMinimizer.Journal of computational biology : a journal of computational molecular cell biology · 2022
    Article
  10. Article
  11. Article
  12. Sequence-specific minimizers via polar sets.Bioinformatics (Oxford, England) · 2021
    Article
  13. Estimating theCurrent genomics · 2019
    Article
  14. Article
  15. 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

3 authors at 1 institution in 1 country.

Marius ErbertInstitute of Computer Science, Martin Luther University Halle-Wittenberg, Von-Seckendorff-Platz 1, 06120 Halle (Saae), Germany.
Steffen RechnerInstitute of Computer Science, Martin Luther University Halle-Wittenberg, Von-Seckendorff-Platz 1, 06120 Halle (Saae), Germany.
Matthias Müller-HannemannInstitute of Computer Science, Martin Luther University Halle-Wittenberg, Von-Seckendorff-Platz 1, 06120 Halle (Saae), Germany.
Martin Luther University Halle-Wittenberg · DE

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundA basic task in bioinformatics is the counting of

resultsWe present the open source

conclusionsWhile

Indexed as

Algorithm engineeringde novo assemblyGenome sequencesGPU computingk-mer counting

Identifiers

PMID28373894
PMCPMC5374613
OpenAlexW2597444305

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.