@inproceedings{e16da9c8129a4827a10cbc599582090d,
title = "Document retrieval with one wildcard",
abstract = "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.",
author = "Moshe Lewenstein and Munro, {J. Ian} and Yakov Nekrich and Thankachan, {Sharma V.}",
note = "Funding Information: Early parts of this work appeared in MFCS 2014 [1] . Work is supported by NSERC of Canada and the Canada Research Chairs program.; 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014 ; Conference date: 25-08-2014 Through 29-08-2014",
year = "2014",
doi = "https://doi.org/10.1007/978-3-662-44465-8_45",
language = "الإنجليزيّة",
isbn = "9783662444641",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
number = "PART 2",
pages = "529--540",
booktitle = "Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings",
address = "ألمانيا",
edition = "PART 2",
}