New algorithms compute shortest unique and absent substrings in O(n log σ / sqrt(log n)) time by decomposing on length and period then reducing to geometric queries via synchronizing sets, runs, and wavelet trees.
On shortest unique substring queries
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster Algorithms for Shortest Unique or Absent Substrings
New algorithms compute shortest unique and absent substrings in O(n log σ / sqrt(log n)) time by decomposing on length and period then reducing to geometric queries via synchronizing sets, runs, and wavelet trees.