Linear-Space Substring Range Counting over Polylogarithmic Alphabets
Travis Gagie,
Paweł Gawrychowski
Abstract:recently introduced the problem of substring range counting, for which we are asked to store compactly a string S of n characters with integer labels in [0, u], such that later, given an interval [a, b] and a pattern P of length m, we can quickly count the occurrences of P whose first characters' labels are in [a, b]. They showed how to store S in O(n log n/ log log n) space and answer queries in O(m + log log u) time. We show that, if S is over an alphabet of size polylog(n), then we can achieve optimal linea… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.