ABWT is shown to be rank-invertible like BWT, supports generalized backward search for indices, and admits efficient computation via difference-cover suffix sorting plus alternating-order rotation finding.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Alternating BWT: an algorithmic perspective
ABWT is shown to be rank-invertible like BWT, supports generalized backward search for indices, and admits efficient computation via difference-cover suffix sorting plus alternating-order rotation finding.