Output-sensitive algorithm builds CDAWGs from BWT-runs in O(e_L log n log(n/r)) time and O(r log(n/r) + e_L) space using a compressed suffix tree of size O(r log(n/r)).
In: 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021
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
-
Output-Sensitive Construction of CDAWGs from BWT-Runs
Output-sensitive algorithm builds CDAWGs from BWT-runs in O(e_L log n log(n/r)) time and O(r log(n/r) + e_L) space using a compressed suffix tree of size O(r log(n/r)).