Streaming dictionary matching with mismatches

09/07/2018
by   Paweł Gawrychowski, et al.
0

In the k-mismatch problem we are given a pattern of length m and a text and must find all locations where the Hamming distance between the pattern and the text is at most k. A series of recent breakthroughs has resulted in an ultra-efficient streaming algorithm for this problem that requires only O(k m/k) space [Clifford, Kociumaka, Porat, 2017]. In this work we consider a strictly harder problem called dictionary matching with k mismatches, where we are given a dictionary of d patterns of lengths < m and must find all their k-mismatch occurrences in the text, and show the first streaming algorithm for it. The algorithm uses O(k d ^k d polylog m) space and processes each position of the text in O(k ^k+1 d polylog m + occ) time, where occ is the number of k-mismatch occurrences of the patterns that end at this position.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2019

L_p Pattern Matching in a Stream

We consider the problem of computing distance between a pattern of lengt...
research
04/27/2020

The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time

We revisit the k-mismatch problem in the streaming model on a pattern of...
research
09/17/2019

Generalized Dictionary Matching under Substring Consistent Equivalence Relations

Given a set of patterns called a dictionary and a text, the dictionary m...
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
05/13/2021

The Dynamic k-Mismatch Problem

The text-to-pattern Hamming distances problem asks to compute the Hammin...
research
07/03/2019

Circular Pattern Matching with k Mismatches

The k-mismatch problem consists in computing the Hamming distance betwee...
research
11/18/2021

Hamming Distance Tolerant Content-Addressable Memory (HD-CAM) for Approximate Matching Applications

We propose a novel Hamming distance tolerant content-addressable memory ...

Please sign up or login with your details

Forgot password? Click here to reset