Imagen de Portada

A survey of BWT variants for string collections

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cenzato, Davide, Lipták, Zsuzsanna
Formato:	Preprint
Publicado:	2022
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

BWT for string collections
por: Cenzato, Davide, et al.
Publicado: (2025)

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

A Textbook Solution for Dynamic Strings
por: Lipták, Zsuzsanna, et al.
Publicado: (2024)

Bubble-Flip -- A New Generation Algorithm for Prefix Normal Words
por: Cicalese, Ferdinando, et al.
Publicado: (2017)

BAT-LZ Out of Hell
por: Lipták, Zsuzsanna, et al.
Publicado: (2024)

Suffix sorting via matching statistics
por: Lipták, Zsuzsanna, et al.
Publicado: (2022)

Pattern Discovery in Colored Strings
por: Lipták, Zsuzsanna, et al.
Publicado: (2020)

Testing Suffixient Sets
por: Cenzato, Davide, et al.
Publicado: (2025)

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

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

In-Place BWT and Lyndon Array Construction in Constant Space
por: Louza, Felipe A., et al.
Publicado: (2025)

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

Sketching and Streaming for Dictionary Compression
por: Becker, Ruben, et al.
Publicado: (2023)

Random Wheeler Automata
por: Becker, Ruben, et al.
Publicado: (2023)

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

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

Fast and memory-efficient BWT construction of repetitive texts using Lyndon grammars
por: Olbrich, Jannik
Publicado: (2025)

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

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

The Trie Measure, Revisited
por: Alanko, Jarno N., et al.
Publicado: (2025)

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

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
por: Burcsi, Péter, et al.
Publicado: (2020)

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

Linear-space LCS enumeration with quadratic-time delay for two strings
por: Sakai, Yoshifumi
Publicado: (2025)

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

Real-World Graph Analysis: Techniques for Static, Dynamic, and Temporal Communities
por: Rucci, Davide
Publicado: (2024)

Improved fixed-parameter bounds for Min-Sum-Radii and Diameters $k$-clustering and their fair variants
por: Banerjee, Sandip, et al.
Publicado: (2025)

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

Operational research approaches and mathematical models for kidney exchange: A literature survey and empirical evaluation
por: Barkel, Mathijs, et al.
Publicado: (2025)

On the Streaming Complexity of Expander Decomposition
por: Chen, Yu, et al.
Publicado: (2024)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
por: Anand, Aditya, et al.
Publicado: (2025)

Graph Spanners for Group Steiner Distances
por: Bilò, Davide, et al.
Publicado: (2024)

Routing on Sparse Graphs with Non-metric Costs for the Prize-collecting Travelling Salesperson Problem
por: O'Hara, Patrick, et al.
Publicado: (2024)

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

Temporal queries for dynamic temporal forests
por: Bilò, Davide, et al.
Publicado: (2024)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
por: Bilò, Davide, et al.
Publicado: (2024)

Simpler and Improved Replacement Path Coverings
por: Bilò, Davide, et al.
Publicado: (2026)

Lower bounds on collective additive spanners
por: Corneil, Derek G., et al.
Publicado: (2025)

Fault-Tolerant ST-Diameter Oracles
por: Bilò, Davide, et al.
Publicado: (2023)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
por: Bilò, Davide, et al.
Publicado: (2024)