Suffixient Arrays: a New Efficient Suffix Array Compression Technique
Fuente:
arXiv
Saved in:
| Main Authors: | Cenzato, Davide, Depuydt, Lore, Gagie, Travis, Kim, Sung-Hwan, Manzini, Giovanni, Olivares, Francisco, Prezza, Nicola |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Suffixient Sets
by: Depuydt, Lore, et al.
Published: (2023)
by: Depuydt, Lore, et al.
Published: (2023)
Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025)
by: Becker, Ruben, et al.
Published: (2025)
Testing Suffixient Sets
by: Cenzato, Davide, et al.
Published: (2025)
by: Cenzato, Davide, et al.
Published: (2025)
Computing the LCP Array of a Labeled Graph
by: Alanko, Jarno, et al.
Published: (2024)
by: Alanko, Jarno, et al.
Published: (2024)
Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)
by: Cotumaccio, Nicola, et al.
Published: (2023)
The Trie Measure, Revisited
by: Alanko, Jarno N., et al.
Published: (2025)
by: Alanko, Jarno N., et al.
Published: (2025)
Sketching and Streaming for Dictionary Compression
by: Becker, Ruben, et al.
Published: (2023)
by: Becker, Ruben, et al.
Published: (2023)
Random Wheeler Automata
by: Becker, Ruben, et al.
Published: (2023)
by: Becker, Ruben, et al.
Published: (2023)
Constructing Suffixient Arrays Revisited
by: Bonizzoni, Paola, et al.
Published: (2026)
by: Bonizzoni, Paola, et al.
Published: (2026)
Dynamic Suffix Array in Optimal Compressed Space
by: Nishimoto, Takaaki, et al.
Published: (2024)
by: Nishimoto, Takaaki, et al.
Published: (2024)
Incongruity-sensitive access to highly compressed strings
by: Cicalese, Ferdinando, et al.
Published: (2026)
by: Cicalese, Ferdinando, et al.
Published: (2026)
Faster run-length compressed suffix arrays
by: Brown, Nathaniel K., et al.
Published: (2024)
by: Brown, Nathaniel K., et al.
Published: (2024)
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
by: Kempa, Dominik, et al.
Published: (2023)
by: Kempa, Dominik, et al.
Published: (2023)
r*-indexing
by: Gagie, Travis
Published: (2025)
by: Gagie, Travis
Published: (2025)
Tag arrays
by: Gagie, Travis
Published: (2024)
by: Gagie, Travis
Published: (2024)
Merging RLBWTs adaptively
by: Gagie, Travis
Published: (2025)
by: Gagie, Travis
Published: (2025)
How to Find Long Maximal Exact Matches and Ignore Short Ones
by: Gagie, Travis
Published: (2024)
by: Gagie, Travis
Published: (2024)
Faster PBWT prefix-array access via batching
by: Gagie, Travis
Published: (2026)
by: Gagie, Travis
Published: (2026)
Compressed Set Representations based on Set Difference
by: Gagie, Travis, et al.
Published: (2026)
by: Gagie, Travis, et al.
Published: (2026)
Algorithms for Massive Data -- Lecture Notes
by: Prezza, Nicola
Published: (2023)
by: Prezza, Nicola
Published: (2023)
Worst-case optimal adaptive alphabetic prefix-free coding
by: Gagie, Travis
Published: (2021)
by: Gagie, Travis
Published: (2021)
Encoding Co-Lex Orders of Finite-State Automata in Linear Space
by: Becker, Ruben, et al.
Published: (2025)
by: Becker, Ruben, et al.
Published: (2025)
Fast and Lightweight Distributed Suffix Array Construction -- First Results
by: Haag, Manuel, et al.
Published: (2024)
by: Haag, Manuel, et al.
Published: (2024)
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
by: Ayad, Lorraine A. K., et al.
Published: (2023)
by: Ayad, Lorraine A. K., et al.
Published: (2023)
A survey of BWT variants for string collections
by: Cenzato, Davide, et al.
Published: (2022)
by: Cenzato, Davide, et al.
Published: (2022)
Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)
by: Becker, Ruben, et al.
Published: (2024)
Prefix-free parsing for merging big BWTs
by: Diaz-Dominguez, Diego, et al.
Published: (2025)
by: Diaz-Dominguez, Diego, et al.
Published: (2025)
KeBaB: $k$-mer based breaking for finding long MEMs
by: Brown, Nathaniel K., et al.
Published: (2025)
by: Brown, Nathaniel K., et al.
Published: (2025)
Ruler Rolling
by: Lyu, Xing, et al.
Published: (2022)
by: Lyu, Xing, et al.
Published: (2022)
Fast and Small Subsampled R-indexes
by: Cobas, Dustin, et al.
Published: (2024)
by: Cobas, Dustin, et al.
Published: (2024)
Faster Iterative $ϕ$ Queries on the Positional BWT
by: Bonizzoni, Paola, et al.
Published: (2026)
by: Bonizzoni, Paola, et al.
Published: (2026)
Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)
by: Draesslerová, Dominika, et al.
Published: (2024)
String Representation in Suffixient Set Size Space
by: Shibata, Hiroki, et al.
Published: (2026)
by: Shibata, Hiroki, et al.
Published: (2026)
Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
by: Kempa, Dominik, et al.
Published: (2025)
by: Kempa, Dominik, et al.
Published: (2025)
Compressing Hypergraphs using Suffix Sorting
by: Adler, Enno, et al.
Published: (2025)
by: Adler, Enno, et al.
Published: (2025)
MIOV: Reordering MOVI for even better locality
by: Perešíni, Peter, et al.
Published: (2024)
by: Perešíni, Peter, et al.
Published: (2024)
Depth first representations of $k^2$-trees
by: Carmona, Gabriel, et al.
Published: (2025)
by: Carmona, Gabriel, et al.
Published: (2025)
BWT for string collections
by: Cenzato, Davide, et al.
Published: (2025)
by: Cenzato, Davide, et al.
Published: (2025)
The landscape of compressibility measures for two-dimensional data
by: Carfagna, Lorenzo, et al.
Published: (2023)
by: Carfagna, Lorenzo, et al.
Published: (2023)
Toward Greener Matrix Operations by Lossless Compressed Formats
by: Tosoni, Francesco, et al.
Published: (2024)
by: Tosoni, Francesco, et al.
Published: (2024)
Similar Items
-
Suffixient Sets
by: Depuydt, Lore, et al.
Published: (2023) -
Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025) -
Testing Suffixient Sets
by: Cenzato, Davide, et al.
Published: (2025) -
Computing the LCP Array of a Labeled Graph
by: Alanko, Jarno, et al.
Published: (2024) -
Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)