Solving the String Statistics Problem in Time O(n log n)
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Position-Restricted substring searching
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Range non-overlapping indexing and successive list indexing
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On suffix extensions in suffix trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
On suffix extensions in suffix trees
Theoretical Computer Science
| Hi-index | 0.00 |
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 驴O(m + loglogn + occ ij,NO ) query time.