Evidence map›Paper›PMID 41542367›Full record

ArticleBioinformatics advances2026

FroM Superstring to Indexing: a space-efficient index for unconstrained

Ondřej Sladký, Pavel Veselý, Karel Břinda

Abstract read
In one paragraph

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

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

3 citing papers in PubMed.

  1. RSHash: a fast and space-efficient hash table for k-mers.Bioinformatics (Oxford, England) · 2026
    Article
  2. Article
  3. Optimizing sparse and skew hashing: fasterbioRxiv : the preprint server for biology · 2026
    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.

Ondřej SladkýETH Zurich, 8092 Zurich, Switzerland.ORCID https://orcid.org/0000-0002-7465-8222
Pavel VeselýComputer Science Institute of Charles University, 118 00 Prague, Czechia.ORCID https://orcid.org/0000-0003-1169-7934
Karel BřindaINRIA, IRISA, Univ. Rennes, 35042 Rennes, France.ORCID https://orcid.org/0000-0003-0200-557X

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Motivation: The growing volumes and heterogeneity of genomic data call for scalable and versatile Results: We introduce FMSI, a superstring-based index for arbitrary Availability and implementation: FMSI is developed in C++ and released under the MIT license, with source code provided at https://github.com/OndrejSladky/fmsi and an installable package available through Bioconda. The datasets used in the experiments are deposited at Zenodo (https://doi.org/10.5281/zenodo.14722244).

Identifiers

PMID41542367
PMCPMC12800775

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.