Cover Image

Faster run-length compressed suffix arrays

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brown, Nathaniel K., Gagie, Travis, Manzini, Giovanni, Navarro, Gonzalo, Sciortino, Marinella
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Faster PBWT prefix-array access via batching
by: Gagie, Travis
Published: (2026)

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

Generalization of Repetitiveness Measures for Two-Dimensional Strings
by: Carfagna, Lorenzo, et al.
Published: (2025)

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

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

Adaptive encodings for small and fast compressed suffix arrays
by: Díaz-Domínguez, Diego, et al.
Published: (2026)

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

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

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

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

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

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

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

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

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

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

The landscape of compressibility measures for two-dimensional data
by: Carfagna, Lorenzo, et al.
Published: (2023)

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)

Space/time-efficient RDF stores based on circular suffix sorting
by: Brisaboa, Nieves R., et al.
Published: (2020)

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
by: Brown, Nathaniel K., et al.
Published: (2026)

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

Morphisms and BWT-run Sensitivity
by: Fici, Gabriele, et al.
Published: (2025)

Exploring Repetitiveness Measures for Two-Dimensional Strings
by: Romana, Giuseppe, et al.
Published: (2024)

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

BWT for string collections
by: Cenzato, Davide, et al.
Published: (2025)

Depth first representations of $k^2$-trees
by: Carmona, Gabriel, et al.
Published: (2025)

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

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
by: Lecroq, Thierry
Published: (2024)

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

Constant-time edge label and leaf pointer maintenance on sliding suffix trees
by: Leonard, Laurentius, et al.
Published: (2023)

Faster negative length shortest paths by bootstrapping hop reducers
by: Huang, Yufan, et al.
Published: (2025)

Bit catastrophes for the Burrows-Wheeler Transform
by: Giuliani, Sara, et al.
Published: (2024)

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

(Worst-Case) Optimal Adaptive Dynamic Bitvectors
by: Navarro, Gonzalo
Published: (2024)

Optimal-Time Move Structure Construction
by: Brown, Nathaniel K., et al.
Published: (2026)

Computing the LCP Array of a Labeled Graph
by: Alanko, Jarno, et al.
Published: (2024)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
by: Giuliani, Sara, et al.
Published: (2020)

Unclustered BWTs of any Length over Non-Binary Alphabets
by: Fici, Gabriele, et al.
Published: (2025)

Iterated Straight-Line Programs
by: Navarro, Gonzalo, et al.
Published: (2024)