Cadences in Grammar-Compressed Strings

08/12/2020
by   Julian Pape-Lange, et al.
0

Cadences are structurally maximal arithmetic progressions of indices corresponding to equal characters in an underlying string. This paper provides a polynomial time detection algorithm for 3-cadences in grammar-compressed binary strings. This algorithm also translates to a linear time detection algorithm for 3-cadences in uncompressed binary strings. Furthermore, this paper proves that several variants of the cadence detection problem are NP-complete for grammar-compressed strings. As a consequence, the equidistant subsequence matching problem with patterns of length three is NP-complete for grammar-compressed ternary strings.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/24/2019

A model for a Lindenmayer reconstruction algorithm

Given an input string s and a specific Lindenmayer system (the so-called...
02/14/2020

On Extensions of Maximal Repeats in Compressed Strings

This paper provides an upper bound for several subsets of maximal repeat...
11/09/2021

Pattern Matching on Grammar-Compressed Strings in Linear Time

The most fundamental problem considered in algorithms for text processin...
06/29/2020

Pattern Masking for Dictionary Matching

In the Pattern Masking for Dictionary Matching (PMDM) problem, we are gi...
02/08/2021

Efficient construction of the extended BWT from grammar-compressed DNA sequencing reads

We present an algorithm for building the extended BWT (eBWT) of a string...
03/05/2021

Compressed Communication Complexity of Hamming Distance

We consider the communication complexity of the Hamming distance of two ...
01/16/2021

Strings-and-Coins and Nimstring are PSPACE-complete

We prove that Strings-and-Coins – the combinatorial two-player game gene...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.