Substring Range Reporting

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2011

View graph of relations

We revisit various string indexing problems with range reporting features, namely, position-restricted substring searching, indexing substrings with gaps, and indexing substrings with intervals. We obtain the following main results. – We give efficient reductions for each of the above problems to a new problem, which we call substring range reporting. Hence, we unify the previous work by showing that we may restrict our attention to a single problem rather than studying each of the above problems individually. – We show how to solve substring range reporting with optimal query time and little space. Combined with our reductions this leads to significantly improved time-space trade-offs for the above problems. In particular, for each problem we obtain the first solutions with optimal time query and O(n logO(1) n) space, where n is the length of the indexed string. Our bounds for substring range reporting are based on a novel combination of suffix trees and range reporting data structures. The reductions are simple and general and may apply to other combinations of string indexing with range reporting.
Original languageEnglish
Title of host publicationCombinatorial Pattern Matching : 22nd Annual Symposium, CPM 2011 Palermo, Italy, June 27-29, 2011 Proceedings
Publication date2011
ISBN (print)978-3-642-21457-8
ISBN (electronic)978-3-642-21458-5
StatePublished - 2011
EventAnnual Symposium on Combinatorial Pattern Matching - Palermo, Italy


ConferenceAnnual Symposium on Combinatorial Pattern Matching
CityPalermo, Italy
Period01/01/2011 → …
SeriesLecture Notes in Computer Science
CitationsWeb of Science® Times Cited: No match on DOI
Download as:
Download as PDF
Select render style:
Download as HTML
Select render style:
Download as Word
Select render style:

Download statistics

No data available

ID: 6243814