TY - GEN

T1 - Range non-overlapping indexing

AU - Cohen, Hagai

AU - Porat, Ely

PY - 2009

Y1 - 2009

N2 - 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<ε<1 and O(m+loglogn+occ ij,NO ) query time.

AB - 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<ε<1 and O(m+loglogn+occ ij,NO ) query time.

UR - http://www.scopus.com/inward/record.url?scp=75649147426&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10631-6_105

DO - 10.1007/978-3-642-10631-6_105

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:75649147426

SN - 3642106307

SN - 9783642106309

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1044

EP - 1053

BT - Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings

T2 - 20th International Symposium on Algorithms and Computation, ISAAC 2009

Y2 - 16 December 2009 through 18 December 2009

ER -