Imagen de Portada

Adaptive encodings for small and fast compressed suffix arrays

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Díaz-Domínguez, Diego, Mäkinen, Veli
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Practical colinear chaining on sequences revisited
por: Rizzo, Nicola, et al.
Publicado: (2025)

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

Efficient terabyte-scale text compression via stable local consistency and parallel grammar processing
por: Diaz-Dominguez, Diego
Publicado: (2024)

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

Quantum Pattern Matching in Generalised Degenerate Strings
por: Equi, Massimo, et al.
Publicado: (2026)

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

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

Tag arrays
por: Gagie, Travis
Publicado: (2024)

Height-bounded Lempel-Ziv encodings
por: Bannai, Hideo, et al.
Publicado: (2024)

Bijective BWT based compression schemes
por: Badkobeh, Golnaz, et al.
Publicado: (2024)

Space-efficient SLP encoding for $O(\log N)$-time random access
por: Takasaka, Akito, et al.
Publicado: (2024)

Faster PBWT prefix-array access via batching
por: Gagie, Travis
Publicado: (2026)

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

Engineering faster double-array Aho-Corasick automata
por: Kanda, Shunsuke, et al.
Publicado: (2022)

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

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
por: Lokshtanov, Daniel, et al.
Publicado: (2026)

The TAG array of a multiple sequence alignment
por: Olbrich, Jannik, et al.
Publicado: (2025)

A fast and slightly robust covariance estimator
por: Duchi, John, et al.
Publicado: (2025)

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

ZOR filters: fast and smaller than fuse filters
por: Limasset, Antoine
Publicado: (2026)

New simple and fast quicksort algorithm for equal keys
por: Afereidoon, Parviz
Publicado: (2025)

Adaptive Quotient Filters
por: Wen, Richard, et al.
Publicado: (2024)

On the compressiveness of the Burrows-Wheeler transform
por: Bannai, Hideo, et al.
Publicado: (2024)

Adaptively Robust Resettable Streaming
por: Cohen, Edith, et al.
Publicado: (2026)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
por: Ferragina, Paolo, et al.
Publicado: (2024)

A tight example for approximation ratio 5 for covering small cuts by the primal-dual method
por: Nutov, Zeev
Publicado: (2025)

Equivalence Testing: The Power of Bounded Adaptivity
por: Chakraborty, Diptarka, et al.
Publicado: (2024)

Adaptivity Gaps for Stochastic Probing with Subadditive Functions
por: Li, Jian, et al.
Publicado: (2025)

(Worst-Case) Optimal Adaptive Dynamic Bitvectors
por: Navarro, Gonzalo
Publicado: (2024)

Refining the Adaptivity Notion in the Huge Object Model
por: Adar, Tomer, et al.
Publicado: (2023)

Adaptive Hashing: Faster Hash Functions with Fewer Collisions
por: Melis, Gábor
Publicado: (2026)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
por: Barak, Zohar, et al.
Publicado: (2026)

Chasing Small Sets Optimally Against Adaptive Adversaries
por: Coester, Christian, et al.
Publicado: (2026)

Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs
por: Ahmadian, Sara, et al.
Publicado: (2024)

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
por: Larsen, Kasper Green, et al.
Publicado: (2023)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
por: Feng, Shiyuan, et al.
Publicado: (2025)

Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
por: Cohen, Edith, et al.
Publicado: (2025)

Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
por: Dürr, Christoph, et al.
Publicado: (2024)

Tight Static Lower Bounds for Non-Adaptive Data Structures
por: Persiano, Giuseppe, et al.
Publicado: (2020)