Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
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
Linear work suffix array construction
Journal of the ACM (JACM)
Succinct data structures for flexible text retrieval systems
Journal of Discrete Algorithms
Faster index for property matching
Information Processing Letters
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
The property suffix tree with dynamic properties
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Compressed property suffix trees
Information and Computation
Hi-index | 0.89 |
In [C.S. Iliopoulos, M.S. Rahman, Faster index for property matching, Information Processing Letters 105 (2008) 218-223], Iliopoulos and Rahman proposed a data structure called IDS-PIP for solving the property indexing pattern matching problem. IDS-PIP can be constructed in O(n) time, where n is the length of the text. Then, based on ID-PIP, each query takes O(mlog|@S|+K) time, where m is the length the pattern, @S is the alphabet, and K is the output size. They assume that all intervals in property @p are disjoint. If the intervals in property @p are not disjoint, then they create an equivalent set of disjoint intervals @p^' to replace @p. However, property @p^' is not equivalent to property @p at all. In this erratum, we propose a way for finding correct property @p^' and modify IDS-PIP slightly.