Cover Image

r*-indexing

Fuente: arXiv

Saved in:

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

Similar Items

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

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

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

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

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

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

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

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

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

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)

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

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

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)

Dynamic r-index: An Updatable Self-Index in LCP-bounded Time
by: Nishimoto, Takaaki, et al.
Published: (2025)

RLZ-r and LZ-End-r: Enhancing Move-r
by: Dinklage, Patrick, 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)

Packing $K_r$s in bounded degree graphs
by: McKay, Michael, et al.
Published: (2022)

Colouring $(P_r+P_s)$-Free Graphs
by: Klimošová, Tereza, et al.
Published: (2018)

Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support
by: Browne, Reilly, et al.
Published: (2026)

Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-index Models
by: Diakonikolas, Ilias, et al.
Published: (2025)

A $2$-branching construction for the $χ\leq 2r$ bound
by: Date, Vinicius Tikara Venturi, et al.
Published: (2026)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
by: Galby, Esther, et al.
Published: (2025)

Tight Bounds for Sampling q-Colorings via Coupling from the Past
by: Ding, Tianxing, et al.
Published: (2025)

Persiansort: an alternative to mergesort inspired by persian rug
by: Afereidoon, Parviz
Published: (2025)

An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
by: Sanaullah, Ahsan, et al.
Published: (2025)

DNF Learning via Locally Mixing Random Walks
by: Alman, Josh, et al.
Published: (2025)

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
by: Shahbazi, Nima, et al.
Published: (2025)

On the Efficient Discovery of Maximum $k$-Defective Biclique
by: Cui, Donghang, et al.
Published: (2025)

Hardness and Approximation Algorithms for Balanced Districting Problems
by: Dharangutte, Prathamesh, et al.
Published: (2025)

A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs
by: Singh, Rajpreet, et al.
Published: (2025)

Why is My Route Different Today? An Algorithm for Explaining Route Selection
by: Schild, Aaron, et al.
Published: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
by: Jansen, Klaus, et al.
Published: (2025)

Online Disjoint Spanning Trees and Polymatroid Bases
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)