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.
Babenko, Paweł Gawrychowski, Tomasz Kociumaka, and Tatiana Starikovskaya
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Wavelet forests extended with select support incur little space overhead and outperform or match standard wavelet trees on most tested inputs.
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.
-
Wavelet Forests Revisited
Wavelet forests extended with select support incur little space overhead and outperform or match standard wavelet trees on most tested inputs.