Range shortest unique substring queries

DOI10.1007/978-3-030-32686-9_18zbMath1539.68078MaRDI QIDQ6536259

Paniz Abedin, Arnab Ganguly, Sharma V. Thankachan, Solon P. Pissis

Publication date: 19 April 2024

zbMATH Keywords

suffix treegeometric data structuresrange queriesshortest unique substringheavy-light decomposition

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithms and combinatorial properties on shortest unique palindromic substrings
• Shortest unique palindromic substring queries on run-length encoded strings
• In-place algorithms for exact and approximate shortest unique substring problems
• Space-time trade-offs for finding shortest unique substrings and maximal unique matches
• Shortest Unique Substrings Queries in Optimal Time
• Fast Algorithms for Finding Nearest Common Ancestors
• Recursive Star-Tree Parallel Data Structure
• Shortest Unique Substring Queries on Run-Length Encoded Strings
• A Linear Space Data Structure for Range LCP Queries*
• Space-Time Trade-Offs for the Shortest Unique Substring Problem.
• Shortest Unique Substring Query Revisited
• Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis
• A linear-space data structure for range-LCP queries in poly-logarithmic time
• Range LCP
• Maximal motif discovery in a sliding window

This page was built for publication: Range shortest unique substring queries