Parameterized matching in the streaming model

Markus Jalsenius, Benny Porat, Benjamin Sach

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

17 Scopus citations

Abstract

We study the problem of parameterized matching in a stream where we want to output matches between a pattern of length m and the last m symbols of the stream before the next symbol arrives. Parameterized matching is a natural generalisation of exact matching where an arbitrary one-to-one relabelling of pattern symbols is allowed. We show how this problem can be solved in constant time per arriving stream symbol and sublinear, near optimal space with high probability. Our results are surprising and important: it has been shown that almost no streaming pattern matching problems can be solved (not even randomised) in less than (m) space, with exact matching as the only known problem to have a sublinear, near optimal space solution. Here we demonstrate that a similar sublinear, near optimal space solution is achievable for an even more challenging problem.

Original languageEnglish
Title of host publication30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013
Pages400-411
Number of pages12
DOIs
StatePublished - 2013
Event30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013 - Kiel, Germany
Duration: 27 Feb 20132 Mar 2013

Publication series

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

Conference

Conference30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013
Country/TerritoryGermany
CityKiel
Period27/02/132/03/13

Keywords

  • Pattern matching
  • Randomized algorithms
  • Streaming algorithms

Fingerprint

Dive into the research topics of 'Parameterized matching in the streaming model'. Together they form a unique fingerprint.

Cite this