Circular Pattern Matching with k Mismatches

The k-mismatch problem consists in computing the Hamming distance between a pattern P of length m and every length-m substring of a text T of length n, if this distance is no more than k. In many real-world applications, any cyclic shift of P is a relevant pattern, and thus one is interested in computing the minimal distance of every length-m substring of T and any cyclic shift of P. This is the circular pattern matching with k mismatches (k-CPM) problem. A multitude of papers have been devoted to solving this problem but, to the best of our knowledge, only average-case upper bounds are known. In this paper, we present the first non-trivial worst-case upper bounds for the k-CPM problem. Specifically, we show an O(nk)-time algorithm and an O(n+n/m k^5)-time algorithm. The latter algorithm applies in an extended way a technique that was very recently developed for the k-mismatch problem [Bringmann et al., SODA 2019].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2022

Approximate Circular Pattern Matching

We consider approximate circular pattern matching (CPM, in short) under ...
research
06/24/2020

Improved Circular k-Mismatch Sketches

The shift distance 𝗌𝗁(S_1,S_2) between two strings S_1 and S_2 of the sa...
research
04/20/2022

Fast Circular Pattern Matching

The Exact Circular Pattern Matching (ECPM) problem consists of reporting...
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/07/2018

Streaming dictionary matching with mismatches

In the k-mismatch problem we are given a pattern of length m and a text ...
research
05/13/2021

The Dynamic k-Mismatch Problem

The text-to-pattern Hamming distances problem asks to compute the Hammin...
research
01/28/2018

Faster Approximate(d) Text-to-Pattern L1 Distance

The problem of finding distance between pattern of length m and text of ...

Please sign up or login with your details

Forgot password? Click here to reset