Evidence map›Paper›PMID 42666546›Full record

ArticleLIPIcs : Leibniz international proceedings in informatics2026

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations.

Nathaniel K Brown, Ben Langmead

Abstract read
In one paragraph

Article in LIPIcs : Leibniz international proceedings in informatics, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

2 authors.

Nathaniel K BrownDepartment of Computer Science, Johns Hopkins University, Baltimore, MD, USA.ORCID 0000-0002-6201-2301
Ben LangmeadDepartment of Computer Science, Johns Hopkins University, Baltimore, MD, USA.ORCID 0000-0003-2437-1976

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

The

Indexed as

Burrows-Wheeler TransformMove StructurePermutationTheory of computation → Data compression

Identifiers

PMID42666546
PMCPMC13523032

What OpenQuestion holds

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