Abstract
We study the non-overlapping indexing problem: Given a text T, preprocess it in order to answer queries of the form: given a pattern P, report the maximal set of non-overlapping occurrences of P in T. A generalization of this problem is the range non-overlapping indexing where in addition we are given two indexes i,j to report the maximal set of non-overlapping occurrences between these two indexes. We suggest new solutions for these problems. For the non-overlapping problem our solution uses O(n) space with query time of O(m+occ NO ). For the range non-overlapping problem we propose a solution with O(nlog ε n) space for some 0
Cite
CITATION STYLE
Cohen, H., & Porat, E. (2009). Range non-overlapping indexing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 1044–1053). https://doi.org/10.1007/978-3-642-10631-6_105
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
