:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bonizzoni, Paola, Gao, Younan, Riccardi, Brian
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2605.04258
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Faster Iterative $ϕ$ Queries on the Positional BWT
by: Bonizzoni, Paola, et al.
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)

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

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

On Computing the Dollo-1 phylogeny in polynomial time
by: Bonizzoni, Paola, et al.
Published: (2016)

On recognizing graphs representing Persistent Perfect Phylogenies
by: Bonizzoni, Paola, et al.
Published: (2025)

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

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

Fast and Lightweight Distributed Suffix Array Construction -- First Results
by: Haag, Manuel, et al.
Published: (2024)

Wavelet Forests Revisited
by: Chiu, Eric, et al.
Published: (2026)

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

Revisiting the Sparse Matrix Compression Problem
by: Jugé, Vincent, et al.
Published: (2026)

Static Retrieval Revisited: To Optimality and Beyond
by: Hu, Yang, et al.
Published: (2025)

Revisiting Token Sliding on Chordal Graphs
by: Adak, Rajat, et al.
Published: (2025)

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

Dynamic Suffix Array in Optimal Compressed Space
by: Nishimoto, Takaaki, et al.
Published: (2024)

The Communication Complexity of Pattern Matching with Edits Revisited
by: Kociumaka, Tomasz, et al.
Published: (2026)

Revisiting Directed Disjoint Paths on tournaments (and relatives)
by: Gomes, Guilherme C. M., et al.
Published: (2025)

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

Revisiting a Successful Reduction Rule for Dominating Set
by: Geis, Lukas, et al.
Published: (2025)

Revisiting Local Computation of PageRank: Simple and Optimal
by: Wang, Hanzhi, et al.
Published: (2024)

Revisit the Partial Coloring Method: Prefix Spencer and Sampling
by: Cai, Dongrun, et al.
Published: (2024)

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

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

Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)

Differentially Private High-Dimensional Approximate Range Counting, Revisited
by: Aumüller, Martin, et al.
Published: (2024)

Tree-Packing Revisited: Faster Fully Dynamic Min-Cut and Arboricity
by: de Vos, Tijn, et al.
Published: (2024)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
by: Hanaka, Tesshu, et al.
Published: (2025)

Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
by: Wang, Hanzhi
Published: (2024)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
by: Kempa, Dominik, et al.
Published: (2023)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
by: Negri, Pietro, et al.
Published: (2026)

Dynamic Construction of the Lovász Local Lemma
by: Haeupler, Bernhard, et al.
Published: (2026)

Compressed Index with Construction in Compressed Space
by: Kosolobov, Dmitry
Published: (2026)

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

Constructing Long Paths in Graph Streams
by: Konrad, Christian, et al.
Published: (2025)

Gabow's $O(\sqrt{n}m)$ Maximum Cardinality Matching Algorithm, Revisited
by: Mehlhorn, Kurt, et al.
Published: (2026)

R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies
by: Kimura, Kotaro, et al.
Published: (2025)

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
by: Blažej, Václav, et al.
Published: (2024)