Optimal Space and Time for Streaming Pattern Matching

07/09/2021
by   Tung Mai, et al.
0

In this work, we study longest common substring, pattern matching, and wildcard pattern matching in the asymmetric streaming model. In this streaming model, we have random access to one string and streaming access to the other one. We present streaming algorithms with provable guarantees for these three fundamental problems. In particular, our algorithms for pattern matching improve the upper bound and beat the unconditional lower bounds on the memory of randomized and deterministic streaming algorithms. In addition to this, we present algorithms for wildcard pattern matching in the asymmetric streaming model that have optimal space and time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2021

Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence

In this paper, we study edit distance (ED) and longest common subsequenc...
research
10/03/2020

Spiking Neural Networks Through the Lens of Streaming Algorithms

We initiate the study of biological neural networks from the perspective...
research
08/07/2018

Parallel and Streaming Algorithms for K-Core Decomposition

The k-core decomposition is a fundamental primitive in many machine lear...
research
04/13/2023

Active Cost-aware Labeling of Streaming Data

We study actively labeling streaming data, where an active learner is fa...
research
05/17/2018

Matching Consecutive Subpatterns Over Streaming Time Series

Pattern matching of streaming time series with lower latency under limit...
research
05/01/2023

Streaming k-edit approximate pattern matching via string decomposition

In this paper we give an algorithm for streaming k-edit approximate patt...
research
10/27/2017

Fine-grained Pattern Matching Over Streaming Time Series

Pattern matching of streaming time series with lower latency under limit...

Please sign up or login with your details

Forgot password? Click here to reset