Evidence map›Paper›PMID 41648259›Full record

ArticlebioRxiv : the preprint server for biology2026

Optimizing sparse and skew hashing: faster

Giulio Ermanno Pibiri, Rob Patro

Abstract readPreprint
In one paragraph

Article in bioRxiv : the preprint server for biology, 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

5 · Who and what money

Authors and funding

2 authors.

Giulio Ermanno PibiriDAIS, Ca' Foscari University of Venice, Italy.ORCID 0000-0003-0724-7092
Rob PatroDept. of Computer Science, University of Maryland, College Park, MD 20440, USA.ORCID 0000-0001-8463-1675

Funding

A Modular Framework for Accurate, Interpretable, and Reproducible Analysis of Long Read RNA-Seq DataR01HG009937 · NHGRI · UNIV OF NORTH CAROLINA CHAPEL HILL · PI Michael Isaiah Love, Robert Patro · 2018 to 2026
$2.8M
NHGRI NIH HHS R01 HG009937
6 · The paper itself

Abstract

Motivation: Representing a set of Results: We study the problem of accelerating queries under the sparse and skew hashing indexing paradigm, without compromising its space effectiveness. We propose a refined data structure with less complex lookups and fewer cache misses. We give a simpler and faster algorithm for streaming lookup queries. Compared to indexes with similar capabilities and based on the Burrows-Wheeler transform, like SBWT and FMSI, SSHash is significantly faster to build and query. SSHash is competitive in space with the fast (and default) modality of SBWT when both Availability and Implementation: The SSHash software is available at https://github.com/jermp/sshash, and also distributed via Bioconda. A benchmark of data structures for Contact: giulioermanno.pibiri@unive.it, rob@cs.umd.edu.

Indexed as

associative data structurehashingk-mersminimizers

Identifiers

PMID41648259
PMCPMC12871628

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.