2026-07-24T09:35:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6356 2024-03-06T10:38:08Z ddc:004 open_access

Streaming Pattern Matching with d Wildcards Golan, Shay Kopelowitz, Tsvi Porat, Ely wildcards don't-cares streaming pattern matching fingerprints In the pattern matching with d wildcards problem we are given a text T of length n and a pattern P of length m that contains d wildcard characters, each denoted by a special symbol '?'. A wildcard character matches any other character. The goal is to establish for each m-length substring of T whether it matches P. In the streaming model variant of the pattern matching with d wildcards problem the text T arrives one character at a time and the goal is to report, before the next character arrives, if the last m characters match P while using only o(m) words of space. In this paper we introduce two new algorithms for the d wildcard pattern matching problem in the streaming model. The first is a randomized Monte Carlo algorithm that is parameterized by a constant 0<=delta<=1. This algorithm uses ~O(d^{1-delta}) amortized time per character and ~O(d^{1+delta}) words of space. The second algorithm, which is used as a black box in the first algorithm, is a randomized Monte Carlo algorithm which uses O(d+log m) worst-case time per character and O(d log m) words of space. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Shay Golan and Tsvi Kopelowitz and Ely Porat 2016 Is Part Of LIPIcs, Volume 57, 24th Annual European Symposium on Algorithms (ESA 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2016.44 urn:nbn:de:0030-drops-63561 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.44 eng https://creativecommons.org/licenses/by/3.0/legalcode