Position-Restricted Substring Searching

  title={Position-Restricted Substring Searching},
  author={Veli M{\"a}kinen and Gonzalo Navarro},
A full-text index is a data structure built over a text string T [1, n]. The most basic functionality provided is (a) counting how many times a pattern string P [1, m] appears in T and (b) locating all those occ positions. There exist several indexes that solve (a) in O(m) time and (b) in O(occ) time. In this paper we propose two new queries, (c) counting how many times P [1, m] appears in T [l, r] and (d) locating all those occl,r positions. These can be solved using (a) and (b) but this… CONTINUE READING
41 Citations
17 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 41 extracted citations


Publications referenced by this paper.

Similar Papers

Loading similar papers…