Evidence map›Paper›PMID 41393221›Full record

ArticleInternational Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium)2026

Prefix-free parsing for merging big BWTs.

Diego Díaz-Domínguez, Travis Gagie, Veronica Guerrini, Ben Langmead, Zsuzsanna Lipták, Giovanni Manzini, Francesco Masillo, Vikram Shivakumar

Abstract read
In one paragraph

Article in International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

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

2 citing papers in PubMed.

  1. Navigating the pangenome coordinate system with Shredtools.bioRxiv : the preprint server for biology · 2026
    Article
  2. Review
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

8 authors.

Diego Díaz-DomínguezUniversity of Helsinki, Finland.ORCID 0000-0002-9071-0254
Travis GagieDalhousie University, Canada.ORCID 0000-0003-3689-327X
Veronica GuerriniUniversity of Pisa, Italy.ORCID 0000-0001-8888-9243
Ben LangmeadJohns Hopkins University, USA.ORCID 0000-0003-2437-1976
Zsuzsanna LiptákUniversity of Verona, Italy.ORCID 0000-0002-3233-0691
Giovanni ManziniUniversity of Pisa, Italy.ORCID 0000-0002-5047-0196
Francesco MasilloDortmund Technical University, Germany.ORCID 0000-0002-2078-6835
Vikram ShivakumarJohns Hopkins University, USA.ORCID 0000-0002-1424-3711

Funding

Personal and panel references for improved alignmentR01HG011392 · NHGRI · JOHNS HOPKINS UNIVERSITY · PI LANGMEAD, BENJAMIN THOMAS · 2020 to 2025
$4.2M
NHGRI NIH HHS R01 HG011392
6 · The paper itself

Abstract

When building Burrows-Wheeler Transforms (BWTs) of truly huge datasets, prefix-free parsing (PFP) can use an unreasonable amount of memory. In this paper we show how if a dataset can be broken down into small datasets that are not very similar to each other - such as collections of many copies of genomes of each of several species, or collections of many copies of each of the human chromosomes - then we can drastically reduce PFP's memory footprint by building the BWTs of the small datasets and then merging them into the BWT of the whole dataset.

Indexed as

Burrows-Wheeler TransformLow-memory algorithmsPangenomicsPrefix-free parsing

Identifiers

PMID41393221
PMCPMC12700358

What OpenQuestion holds

Textmetadata
LicenceTDM
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.