Back to search

Article

A run-length-compressed skiplist data structure for dynamic GBWTs supports time and space efficient pangenome operations over syncmers

2026-03-29

Abstract excerpt

Skiplists (Pugh, 1990) are probabilistic data structures over ordered lists supporting ๐’ช (log N ) insertion and search, which share many properties with balanced binary trees. Previously we introduced the graph Burrows-Wheeler transform (GBWT) to support efficient search over pangenome path sets, but current implementations are static and cumbersome to build and use. Here we introduce a doubly-linked skiplist va...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
a1dd3ef8-ab85-570e-8fb2-3b696f28aa06
DOI
10.64898/2026.03.26.714584
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 ยท 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
A run-length-compressed skiplist data structure for dynamic GBWTs supports time and space efficient pangenome operations over syncmersDOI 10.64898/2026.03.26.714584
Haplotype Matching with GBWT for Pangenome GraphsSemantic proximity
Prefix-Free Parsing for Building Big BWTsSemantic proximity
Navigating the pangenome coordinate system with ShredtoolsSemantic proximity
RLBWT-Based LCP Computation in Compressed Space for Terabase-Scale Pangenome AnalysisSemantic proximity
Indexing Graphs for Path Queries with Applications in Genome Research.Semantic proximity
Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search IndexSemantic proximity
Lossless Indexing with Counting de Bruijn GraphsSemantic proximity
Cuttlefish: Fast, parallel, and low-memory compaction of de Bruijn graphs from large-scale genome collectionsSemantic proximity
Scalable computation of ultrabubbles in pangenomes by orienting bidirected graphsSemantic proximity
Investigating the topological motifs of inversions in pangenome graphsSemantic proximity
GIN-TONIC: Non-hierarchical full-text indexing for graph-genomesSemantic proximity
Minimizer-space de Bruijn graphsSemantic proximity
Select a neighboring publication to make it the new centre.