A refined segments decomposition yields two space-time tradeoffs for k iterative φ queries on the PBWT, improving on prior O((r̃ + h) log n) space and O(k log log m) time.
Title resolution pending
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 Iterative $\phi$ Queries on the Positional BWT
A refined segments decomposition yields two space-time tradeoffs for k iterative φ queries on the PBWT, improving on prior O((r̃ + h) log n) space and O(k log log m) time.