Streaming pattern matching with d wildcards

Shay Golan, Tsvi Kopelowitz, Ely Porat

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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 ≤ δ ≤ 1. This algorithm uses Õ(d1-δ) amortized time per character and Õ(d1+δ) 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(dlogm) words of space.

Original languageEnglish
Title of host publication24th Annual European Symposium on Algorithms, ESA 2016
EditorsChristos Zaroliagis, Piotr Sankowski
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770156
DOIs
StatePublished - 1 Aug 2016
Event24th Annual European Symposium on Algorithms, ESA 2016 - Aarhus, Denmark
Duration: 22 Aug 201624 Aug 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume57
ISSN (Print)1868-8969

Conference

Conference24th Annual European Symposium on Algorithms, ESA 2016
Country/TerritoryDenmark
CityAarhus
Period22/08/1624/08/16

Bibliographical note

Publisher Copyright:
© Shay Golan, Tsvi Kopelowitz, and Ely Porat.

Funding

Supported in part by NSF grants CCF-1217338, CNS-1318294, and CCF-1514383.

FundersFunder number
National Science FoundationCCF-1217338, CNS-1318294, CCF-1514383

    Keywords

    • Don't-cares
    • Fingerprints
    • Streaming pattern matching
    • Wildcards

    Fingerprint

    Dive into the research topics of 'Streaming pattern matching with d wildcards'. Together they form a unique fingerprint.

    Cite this