On Hardness of Jumbled Indexing

  title={On Hardness of Jumbled Indexing},
  author={Amihood Amir and Timothy M. Chan and Moshe Lewenstein and Noa Lewenstein},
Jumbled indexing is the problem of indexing a text T for queries that ask whether there is a substring of T matching a pattern represented as a Parikh vector, i.e., the vector of frequency counts for each character. Jumbled indexing has garnered a lot of interest in the last four years; for a partial list see [2,6,13,16,17,20,22,24,26,30,35,36]. There is a naive algorithm that preprocesses all answers in O(n|Σ|) time allowing quick queries afterwards, and there is another naive algorithm that… CONTINUE READING