Cover Image

Suffixient Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Depuydt, Lore, Gagie, Travis, Langmead, Ben, Manzini, Giovanni, 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

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

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

Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)

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

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

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

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)

KeBaB: $k$-mer based breaking for finding long MEMs
by: Brown, Nathaniel K., et al.
Published: (2025)

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

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

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)

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

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

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

The Trie Measure, Revisited
by: Alanko, Jarno N., et al.
Published: (2025)

String Representation in Suffixient Set Size Space
by: Shibata, Hiroki, et al.
Published: (2026)

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

Constructing Suffixient Arrays Revisited
by: Bonizzoni, Paola, 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)

Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
by: Brown, Nathaniel K., et al.
Published: (2026)

Depth first representations of $k^2$-trees
by: Carmona, Gabriel, et al.
Published: (2025)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
by: Fujimaru, Hiroto, et al.
Published: (2025)

Optimal-Time Move Structure Construction
by: Brown, Nathaniel K., et al.
Published: (2026)

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

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

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

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

Generalization of Repetitiveness Measures for Two-Dimensional Strings
by: Carfagna, Lorenzo, et al.
Published: (2025)

Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)

Toward Greener Matrix Operations by Lossless Compressed Formats
by: Tosoni, Francesco, et al.
Published: (2024)

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

Solution Discovery for Vertex Cover, Independent Set, Dominating Set, and Feedback Vertex Set
by: Saito, Rin, et al.
Published: (2025)

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

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