Upper and lower bounds for dynamic data structures on strings

02/19/2018
by   Raphael Clifford, et al.
0

We consider a range of simply stated dynamic data structure problems on strings. An update changes one symbol in the input and a query asks us to compute some function of the pattern of length m and a substring of a longer text. We give both conditional and unconditional lower bounds for variants of exact matching with wildcards, inner product, and Hamming distance computation via a sequence of reductions. As an example, we show that there does not exist an O(m^1/2-ε) time algorithm for a large range of these problems unless the online Boolean matrix-vector multiplication conjecture is false. We also provide nearly matching upper bounds for most of the problems we consider.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2019

New Amortized Cell-Probe Lower Bounds for Dynamic Problems

We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (F...
research
02/23/2022

Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv

The main theme of this paper is using k-dimensional generalizations of t...
research
02/23/2021

Conditional Lower Bounds for Variants of Dynamic LIS

In this note, we consider the complexity of maintaining the longest incr...
research
05/13/2021

The Dynamic k-Mismatch Problem

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

On the Complexity of Algorithms with Predictions for Dynamic Graph Problems

Algorithms with predictions incorporate machine learning predictions int...
research
11/10/2017

Hamming distance completeness and sparse matrix multiplication

We investigate relations between (+,) vector products for binary integer...
research
10/04/2018

On the Inner Product Predicate and a Generalization of Matching Vector Families

Motivated by cryptographic applications such as predicate encryption, we...

Please sign up or login with your details

Forgot password? Click here to reset