Cover Image

Space-time Trade-offs for the LCP Array of Wheeler DFAs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cotumaccio, Nicola, Gagie, Travis, Köppl, Dominik, Prezza, Nicola
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Wheeler Bisimulations
by: Cotumaccio, Nicola
Published: (2026)

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

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

Encoding Co-Lex Orders of Finite-State Automata in Linear Space
by: Becker, Ruben, et al.
Published: (2025)

Improved Circular Dictionary Matching
by: Cotumaccio, Nicola
Published: (2025)

Fast Pattern Matching with Epsilon Transitions
by: Cotumaccio, Nicola
Published: (2025)

Enhanced Graph Pattern Matching
by: Cotumaccio, Nicola
Published: (2024)

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

Algorithms for Massive Data -- Lecture Notes
by: Prezza, Nicola
Published: (2023)

Random Wheeler Automata
by: Becker, Ruben, et al.
Published: (2023)

Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It
by: Osterkamp, Eric M., 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)

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

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

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

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)

NP-Completeness for the Space-Optimality of Double-Array Tries
by: Bannai, Hideo, et al.
Published: (2024)

LZ78 Substring Compression in Compressed Space
by: Shibata, Hiroki, et al.
Published: (2025)

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

Testing Suffixient Sets
by: Cenzato, Davide, et al.
Published: (2025)

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
by: Cotumaccio, Nicola
Published: (2023)

Substring Compression Variations and LZ78-Derivates
by: Köppl, Dominik
Published: (2024)

Near-real-time Solutions for Online String Problems
by: Köppl, Dominik, et al.
Published: (2026)

Smallest suffixient set maintenance in near-real-time
by: Köppl, Dominik, et al.
Published: (2026)

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

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)

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

LZD-style Compression Scheme with Truncation and Repetitions
by: Götz, Linus, et al.
Published: (2025)

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
by: Ayad, Lorraine A. K., et al.
Published: (2023)

Bijective BWT based compression schemes
by: Badkobeh, Golnaz, et al.
Published: (2024)

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

Hardness Results on Characteristics for Elastic-Degenerated Strings
by: Köppl, Dominik, et al.
Published: (2024)

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

Algorithms for Galois Words: Detection, Factorization, and Rotation
by: Hendrian, Diptarama, et al.
Published: (2024)

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