In this paper we extend several well-known document listing problems to the case when documents contain a substring that approximately matches the query pattern. We study the scenario when the query string can contain a wildcard symbol that matches any alphabet symbol; all documents that match a query pattern with one wildcard must be enumerated. We describe a linear space data structure that reports all documents containing a substring P in O(|P| + δ√log log log n + docc)time, where σ is the alphabet size and docc is the number of listed documents. We also describe a succinct solution for this problem. Furthermore our approach enables us to obtain an O(nσ)-space data structure that enumerates all documents containing both a pattern P 1 and a pattern P 2 in the special case when P 1 and P 2 differ in one symbol.
|Title of host publication||Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings|
|Number of pages||12|
|State||Published - 2014|
|Event||39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 - Budapest, Hungary|
Duration: 25 Aug 2014 → 29 Aug 2014
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014|
|Period||25/08/14 → 29/08/14|
Bibliographical noteFunding Information:
Early parts of this work appeared in MFCS 2014  . Work is supported by NSERC of Canada and the Canada Research Chairs program.