String Representation in Suffixient Set Size Space
Fuente:
arXiv
Saved in:
| Main Authors: | Shibata, Hiroki, Bannai, Hideo |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| 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)
Testing Suffixient Sets
by: Cenzato, Davide, et al.
Published: (2025)
by: Cenzato, Davide, et al.
Published: (2025)
Counting distinct (non-)crossing substrings
by: Umezaki, Haruki, et al.
Published: (2025)
by: Umezaki, Haruki, et al.
Published: (2025)
NP-Completeness for the Space-Optimality of Double-Array Tries
by: Bannai, Hideo, et al.
Published: (2024)
by: Bannai, Hideo, et al.
Published: (2024)
Faster Space-Efficient STR-IC-LCS Computation
by: Yonemoto, Yuki, et al.
Published: (2022)
by: Yonemoto, Yuki, et al.
Published: (2022)
Sensitivity of Repetitiveness Measures to String Reversal
by: Bannai, Hideo, et al.
Published: (2026)
by: Bannai, Hideo, et al.
Published: (2026)
Online Computation of Palindromes and Suffix Trees on Tries
by: Shibata, Hiroki, et al.
Published: (2026)
by: Shibata, Hiroki, et al.
Published: (2026)
Constructing Suffixient Arrays Revisited
by: Bonizzoni, Paola, et al.
Published: (2026)
by: Bonizzoni, Paola, et al.
Published: (2026)
On the Number of Non-equivalent Parameterized Squares in a String
by: Hamai, Rikuya, et al.
Published: (2024)
by: Hamai, Rikuya, et al.
Published: (2024)
Bijective BWT based compression schemes
by: Badkobeh, Golnaz, et al.
Published: (2024)
by: Badkobeh, Golnaz, et al.
Published: (2024)
LZ78 Substring Compression in Compressed Space
by: Shibata, Hiroki, et al.
Published: (2025)
by: Shibata, Hiroki, et al.
Published: (2025)
Constant-time edge label and leaf pointer maintenance on sliding suffix trees
by: Leonard, Laurentius, et al.
Published: (2023)
by: Leonard, Laurentius, et al.
Published: (2023)
On the compressiveness of the Burrows-Wheeler transform
by: Bannai, Hideo, et al.
Published: (2024)
by: Bannai, Hideo, et al.
Published: (2024)
Suffixient Arrays: a New Efficient Suffix Array Compression Technique
by: Cenzato, Davide, et al.
Published: (2024)
by: Cenzato, Davide, et al.
Published: (2024)
Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
by: Fujimaru, Hiroto, et al.
Published: (2025)
by: Fujimaru, Hiroto, et al.
Published: (2025)
On Occurrence-Preserving Morphisms
by: Kishi, Kaisei, et al.
Published: (2026)
by: Kishi, Kaisei, et al.
Published: (2026)
Edit and Alphabet-Ordering Sensitivity of Lex-parse
by: Nakashima, Yuto, et al.
Published: (2024)
by: Nakashima, Yuto, et al.
Published: (2024)
Tight Additive Sensitivity on LZ-style Compressors and String Attractors
by: Fujie, Yuto, et al.
Published: (2025)
by: Fujie, Yuto, et al.
Published: (2025)
Height-bounded Lempel-Ziv encodings
by: Bannai, Hideo, et al.
Published: (2024)
by: Bannai, Hideo, et al.
Published: (2024)
Computing maximal palindromes in non-standard matching models
by: Mieno, Takuya, et al.
Published: (2022)
by: Mieno, Takuya, et al.
Published: (2022)
Packed Acyclic Deterministic Finite Automata
by: Shibata, Hiroki, et al.
Published: (2024)
by: Shibata, Hiroki, et al.
Published: (2024)
Nyldon Factorization of Thue-Morse Words and Fibonacci Words
by: Kishi, Kaisei, et al.
Published: (2025)
by: Kishi, Kaisei, et al.
Published: (2025)
Time-Optimal Construction of String Synchronizing Sets
by: Ellert, Jonas, et al.
Published: (2026)
by: Ellert, Jonas, et al.
Published: (2026)
Variations on the Problem of Identifying Spectrum-Preserving String Sets
by: Chakraborty, Sankardeep, et al.
Published: (2026)
by: Chakraborty, Sankardeep, et al.
Published: (2026)
LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
by: Shibata, Hiroki, et al.
Published: (2025)
by: Shibata, Hiroki, et al.
Published: (2025)
All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
by: Kikuchi, Masaru, et al.
Published: (2024)
by: Kikuchi, Masaru, et al.
Published: (2024)
Space-Efficient Online Computation of String Net Occurrences
by: Mieno, Takuya, et al.
Published: (2024)
by: Mieno, Takuya, et al.
Published: (2024)
Tight Lower Bounds for Central String Queries in Compressed Space
by: Kempa, Dominik, et al.
Published: (2025)
by: Kempa, Dominik, et al.
Published: (2025)
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)
by: Bille, Philip, et al.
Published: (2022)
Compressed Set Representations based on Set Difference
by: Gagie, Travis, et al.
Published: (2026)
by: Gagie, Travis, et al.
Published: (2026)
Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)
by: Gabory, Esteban, et al.
Published: (2024)
Subsequence Matching and LCS under Cartesian-Tree Equivalence
by: Tsujimoto, Taketo, et al.
Published: (2024)
by: Tsujimoto, Taketo, et al.
Published: (2024)
Parameterized Algorithms for Spanning Tree Isomorphism by Redundant Set Size
by: Shen, Fangjian, et al.
Published: (2025)
by: Shen, Fangjian, et al.
Published: (2025)
Online String Attractors
by: Whittington, Philip
Published: (2024)
by: Whittington, Philip
Published: (2024)
String Covering: A Survey
by: Mhaskar, Neerja, et al.
Published: (2022)
by: Mhaskar, Neerja, et al.
Published: (2022)
Scalable Distributed String Sorting
by: Kurpicz, Florian, et al.
Published: (2024)
by: Kurpicz, Florian, et al.
Published: (2024)
Pattern Discovery in Colored Strings
by: Lipták, Zsuzsanna, et al.
Published: (2020)
by: Lipták, Zsuzsanna, et al.
Published: (2020)
Minimizers in Semi-Dynamic Strings
by: Zuba, Wiktor, et al.
Published: (2025)
by: Zuba, Wiktor, et al.
Published: (2025)
String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)
by: Bille, Philip, et al.
Published: (2019)
Elastic-Degenerate String Comparison
by: Gabory, Esteban, et al.
Published: (2024)
by: Gabory, Esteban, et al.
Published: (2024)
Similar Items
-
Suffixient Sets
by: Depuydt, Lore, et al.
Published: (2023) -
Testing Suffixient Sets
by: Cenzato, Davide, et al.
Published: (2025) -
Counting distinct (non-)crossing substrings
by: Umezaki, Haruki, et al.
Published: (2025) -
NP-Completeness for the Space-Optimality of Double-Array Tries
by: Bannai, Hideo, et al.
Published: (2024) -
Faster Space-Efficient STR-IC-LCS Computation
by: Yonemoto, Yuki, et al.
Published: (2022)