eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2014-03-05
506
517
10.4230/LIPIcs.STACS.2014.506
article
Space-Efficient String Indexing for Wildcard Pattern Matching
Lewenstein, Moshe
Nekrich, Yakov
Vitter, Jeffrey Scott
In this paper we describe compressed indexes that support pattern matching queries for strings with wildcards. For a constant size alphabet our data structure uses O(n.log^e(n)) bits for any e>0 and reports all occ occurrences of a wildcard string in O(m+s^g.M(n)+occ) time, where M(n)=o(log(log(log(n)))), s is the alphabet size, m is the number of alphabet symbols and g is the number of wildcard symbols in the query string. We also present an O(n)-bit index with O((m+s^g+occ).log^e(n)) query time and an O(n{log(log(n))}^2)-bit index with O((m+s^g+occ).log(log(n))) query time. These are the first non-trivial data structures for this problem that need o(n.log(n)) bits of space.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol025-stacs2014/LIPIcs.STACS.2014.506/LIPIcs.STACS.2014.506.pdf
compressed data structures
compressed indexes
pattern matching