The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
String Indexing for Patterns with Wildcards
[article]
2012
arXiv
pre-print
We consider the problem of indexing a string t of length n to report the occurrences of a query pattern p containing m characters and j wildcards. Let occ be the number of occurrences of p in t, and σ the size of the alphabet. We obtain the following results. - A linear space index with query time O(m+σ^j n + occ). This significantly improves the previously best known linear space index by Lam et al. [ISAAC 2007], which requires query time Θ(jn) in the worst case. - An index with query time
arXiv:1110.5236v2
fatcat:afrg25lvifcabo5cqmdb2jenbq