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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.DS 3verdicts
UNVERDICTED 3representative citing papers
A Fiat-Naor-based inversion technique yields data structures for range searching, counting, and related queries on implicit sets f([N]) with ~O(N^{1-α/3}) space and ~O(N^α) query time for any α ∈ (0,1).
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.
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.
-
A General Technique for Searching in Implicit Sets via Function Inversion
A Fiat-Naor-based inversion technique yields data structures for range searching, counting, and related queries on implicit sets f([N]) with ~O(N^{1-α/3}) space and ~O(N^α) query time for any α ∈ (0,1).
-
String Covering: A Survey
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.