Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Filtering search: a new approach to query answering
SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Rank and select revisited and extended
Theoretical Computer Science
Faster index for property matching
Information Processing Letters
Property matching and weighted matching
Theoretical Computer Science
Optimal prefix and suffix queries on texts
Information Processing Letters
Algorithmica
Errata for “Faster index for property matching”
Information Processing Letters
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Range Non-overlapping Indexing
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Finding Patterns In Given Intervals
Fundamenta Informaticae
Improved data structures for the orthogonal range successor problem
Computational Geometry: Theory and Applications
The gapped suffix array: a new index structure for fast approximate matching
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Position-Restricted substring searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Persistency in suffix trees with applications to string interval problems
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
String indexing for patterns with wildcards
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
On position restricted substring searching in succinct space
Journal of Discrete Algorithms
Simple and efficient LZW-compressed multiple pattern matching
Journal of Discrete Algorithms
| Hi-index | 0.00 |
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.