Abstract
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εn) bits for any ε> 0 and reports all occ occurrences of a wildcard string in O(m + σg·μ(n) + occ) time, where μ(n) = o(log log log n), σ 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 + σg+ occ) logεn) query time and an O(n(log log n)2)-bit index with O((m + σ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.
Original language | English |
---|---|
Title of host publication | 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 |
Editors | Ernst W. Mayr, Natacha Portier |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Pages | 506-517 |
Number of pages | 12 |
Volume | 25 |
ISBN (Electronic) | 9783939897651 |
DOIs | |
State | Published - 1 Mar 2014 |
Event | 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 - Lyon, France Duration: 5 Mar 2014 → 8 Mar 2014 |
Conference
Conference | 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 |
---|---|
Country/Territory | France |
City | Lyon |
Period | 5/03/14 → 8/03/14 |
Bibliographical note
Publisher Copyright:© Moshe Lewenstein, Yakov Nekrich, and Jeffrey Scott Vitter.
Funding
Funders | Funder number |
---|---|
Natural Sciences and Engineering Research Council of Canada |
Keywords
- Compressed data structures
- Compressed indexes
- Pattern matching