Cover Image

Faster PBWT prefix-array access via batching

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gagie, Travis
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Worst-case optimal adaptive alphabetic prefix-free coding
by: Gagie, Travis
Published: (2021)

Tag arrays
by: Gagie, Travis
Published: (2024)

Faster run-length compressed suffix arrays
by: Brown, Nathaniel K., et al.
Published: (2024)

Faster Iterative $ϕ$ Queries on the Positional BWT
by: Bonizzoni, Paola, et al.
Published: (2026)

r*-indexing
by: Gagie, Travis
Published: (2025)

Merging RLBWTs adaptively
by: Gagie, Travis
Published: (2025)

How to Find Long Maximal Exact Matches and Ignore Short Ones
by: Gagie, Travis
Published: (2024)

Incongruity-sensitive access to highly compressed strings
by: Cicalese, Ferdinando, et al.
Published: (2026)

Optimal-Time Mapping in Run-Length Compressed PBWT
by: Bonizzoni, Paola, et al.
Published: (2026)

Compressed Set Representations based on Set Difference
by: Gagie, Travis, et al.
Published: (2026)

Ruler Rolling
by: Lyu, Xing, et al.
Published: (2022)

Fast and Small Subsampled R-indexes
by: Cobas, Dustin, et al.
Published: (2024)

Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)

MIOV: Reordering MOVI for even better locality
by: Perešíni, Peter, et al.
Published: (2024)

Suffixient Sets
by: Depuydt, Lore, et al.
Published: (2023)

Optimal prefix-suffix queries with applications
by: Pissis, Solon P.
Published: (2024)

A note on the depth of optimal fanout-bounded prefix circuits
by: Sergeev, Igor S.
Published: (2025)

Suffixient Arrays: a New Efficient Suffix Array Compression Technique
by: Cenzato, Davide, et al.
Published: (2024)

The Trie Measure, Revisited
by: Alanko, Jarno N., et al.
Published: (2025)

Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025)

Prefix-free parsing for merging big BWTs
by: Diaz-Dominguez, Diego, et al.
Published: (2025)

Faster Semi-streaming Matchings via Alternating Trees
by: Mitrović, Slobodan, et al.
Published: (2024)

Parallel batch queries on dynamic trees: algorithms and experiments
by: Ikram, Humza, et al.
Published: (2025)

Faster Approximation Algorithms for k-Center via Data Reduction
by: Filtser, Arnold, et al.
Published: (2025)

KeBaB: $k$-mer based breaking for finding long MEMs
by: Brown, Nathaniel K., et al.
Published: (2025)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)

A Faster Deterministic Algorithm for Kidney Exchange via Representative Set
by: Tian, Kangyi, et al.
Published: (2026)

Faster Parameterized Vertex Multicut
by: Chu, Huairui, et al.
Published: (2026)

Simple and Faster Algorithms for Knapsack
by: He, Qizheng, et al.
Published: (2023)

Faster optimal univariate microgaggregation
by: Stamm, Felix I., et al.
Published: (2024)

Faster Algorithms for Graph Monopolarity
by: Philip, Geevarghese, et al.
Published: (2024)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
by: Bringmann, Karl, et al.
Published: (2024)

Faster Pseudo-Deterministic Minimum Cut
by: Kenneth-Mordoch, Yotam
Published: (2026)

Faster Deterministic Streaming Vertex Coloring
by: Chechik, Shiri, et al.
Published: (2026)

Faster Approximate Linear Matroid Intersection
by: Terao, Tatsuya
Published: (2026)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
by: Jin, Ce, et al.
Published: (2024)

Faster Edge Coloring by Partition Sieving
by: Akmal, Shyan, et al.
Published: (2025)

Faster Combinatorial k-Clique Algorithms
by: Abboud, Amir, et al.
Published: (2024)

Faster Global Minimum Cut with Predictions
by: Moseley, Benjamin, et al.
Published: (2025)

Faster Algorithms for Longest Common Substring
by: Charalampopoulos, Panagiotis, et al.
Published: (2021)