Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Optimal Exact Strring Matching Based on Suffix Arrays
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Linear work suffix array construction
Journal of the ACM (JACM)
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
Property matching and weighted matching
Theoretical Computer Science
Property matching and weighted matching
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Optimal prefix and suffix queries on texts
Information Processing Letters
Errata for “Faster index for property matching”
Information Processing Letters
The property suffix tree with dynamic properties
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Finding Patterns In Given Intervals
Fundamenta Informaticae
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Compressed property suffix trees
Information and Computation
| Hi-index | 0.89 |
In this paper, we revisit the Property Matching problem studied by Amir et al. [Property Matching and Weighted Matching, CPM 2006] and present a better indexing scheme for the problem. In particular, the data structure by Amir et al., namely PST, requires O(nlog|@S|+nloglogn) construction time and O(mlog|@S|+K) query time, where n and m are the length of, respectively, the text and the pattern, @S is the alphabet and K is the output size. On the other hand, the construction time of our data structure, namely IDS_PIP, is dominated by the suffix tree construction time and hence is O(n) time for alphabets that are natural numbers from 1 to a polynomial in n and O(nlog@s) time otherwise, where @s=min(n,|@S|). The query time is same as that of PST. Also, IDS_PIP has the advantage that it can be built on either a suffix tree or a suffix array and additionally, it retains the capability of answering normal pattern matching queries.