1 problem

Does there exist a family of data structures which, for every binary text $T\in\{0,1\}^n$, uses $O(n)$ bits of space and answers suffix-array access queries…