Cover Image

Variations on the Problem of Identifying Spectrum-Preserving String Sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chakraborty, Sankardeep, Grossi, Roberto, Kimura, Ren, Punzi, Giulia, Sadakane, Kunihiko, Zuba, Wiktor
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
by: Balakrishnan, Girish, et al.
Published: (2024)

Succinct Data Structures for Baxter Permutation and Related Families
by: Chakraborty, Sankardeep, et al.
Published: (2024)

Succinct Data Structure for Graphs with $d$-Dimensional $t$-Representation
by: Balakrishnan, Girish, et al.
Published: (2023)

Computing String Covers in Sublinear Time
by: Radoszewski, Jakub, et al.
Published: (2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
by: Hamada, Kou, et al.
Published: (2024)

Minimizers in Semi-Dynamic Strings
by: Zuba, Wiktor, et al.
Published: (2025)

Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)

Elastic-Degenerate String Comparison
by: Gabory, Esteban, et al.
Published: (2024)

Scalable Order-Preserving Pattern Mining
by: Li, Ling, et al.
Published: (2024)

Faster Algorithms for Shortest Unique or Absent Substrings
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)

Counting Distinct Square Substrings in Sublinear Time
by: Charalampopoulos, Panagiotis, et al.
Published: (2025)

Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)

Approximate Circular Pattern Matching under Edit Distance
by: Charalampopoulos, Panagiotis, et al.
Published: (2024)

Subsequence Covers of Words
by: Charalampopoulos, Panagiotis, et al.
Published: (2025)

Approximate Circular Pattern Matching
by: Charalampopoulos, Panagiotis, et al.
Published: (2022)

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

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

Time-Optimal Construction of String Synchronizing Sets
by: Ellert, Jonas, et al.
Published: (2026)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
by: Kikuchi, Masaru, et al.
Published: (2024)

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

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
by: Li, Rao
Published: (2024)

Finding Diverse Strings and Longest Common Subsequences in a Graph
by: Shida, Yuto, et al.
Published: (2024)

Cost Preserving Dependent Rounding for Allocation Problems
by: Rohwedder, Lars, et al.
Published: (2025)

Structural Parameterization of Locating-Dominating Set and Test Cover
by: Chakraborty, Dipayan, et al.
Published: (2024)

When to Identify Is to Control: On the Controllability of Combinatorial Optimization Problems
by: Klimm, Max, et al.
Published: (2026)

String Consensus Problems with Swaps and Substitutions
by: Gabory, Estéban, et al.
Published: (2025)

Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
by: Kempa, Dominik, et al.
Published: (2025)

Online String Attractors
by: Whittington, Philip
Published: (2024)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
by: Eiben, Eduard, et al.
Published: (2024)

Single-Criteria Metric $r$-Dominating Set Problem via Minor-Preserving Support
by: Browne, Reilly, et al.
Published: (2026)

Quantum Algorithm for the Multiple String Matching Problem
by: Khadiev, Kamil, et al.
Published: (2024)

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
by: Großmann, Ernestine, et al.
Published: (2026)

String Covering: A Survey
by: Mhaskar, Neerja, et al.
Published: (2022)

Scalable Distributed String Sorting
by: Kurpicz, Florian, et al.
Published: (2024)

Pattern Discovery in Colored Strings
by: Lipták, Zsuzsanna, et al.
Published: (2020)

String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)

The Complexity of Maximal Common Subsequence Enumeration
by: Buzzega, Giovanni, et al.
Published: (2025)

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
by: Brosse, Caroline, et al.
Published: (2024)

Sensitivity of Repetitiveness Measures to String Reversal
by: Bannai, Hideo, et al.
Published: (2026)

Algorithms for Parameterized String Matching with Mismatches
by: Saha, Apurba, et al.
Published: (2024)