Range non-overlapping indexing

Hagai Cohen, Ely Porat

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

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

Original languageEnglish
Title of host publicationAlgorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings
Pages1044-1053
Number of pages10
StatePublished - 2009
Event20th International Symposium on Algorithms and Computation, ISAAC 2009 - Honolulu, HI, United States
Duration: 16 Dec 200918 Dec 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5878 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Symposium on Algorithms and Computation, ISAAC 2009
Country/TerritoryUnited States
CityHonolulu, HI
Period16/12/0918/12/09

Fingerprint

Dive into the research topics of 'Range non-overlapping indexing'. Together they form a unique fingerprint.

Cite this