39 citations · 39 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 39 cited
Wavelet Trees Meet Suffix Trees
Maxim Babenko, Paweł Gawrychowski, Tomasz Kociumaka +1
We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n…
cs.DS2013
Substring Suffix Selection
Maxim Babenko, Paweł Gawrychowski, Tomasz Kociumaka +1
We study the following substring suffix selection problem: given a substring of a string T of length n, compute its k-th lexicographically smallest suffix. This a natural generaliz…