Computing Covers under Substring Consistent Equivalence Relations

02/17/2020
by   Natsumi Kikuchi, et al.
0

Covers are a kind of quasiperiodicity in strings. A string C is a cover of another string T if any position of T is inside some occurrence of C in T. The literature has proposed linear-time algorithms computing longest and shortest cover arrays taking border arrays as input. An equivalence relation ≈ over strings is called a substring consistent equivalence relation (SCER) iff X ≈ Y implies (1) |X| = |Y| and (2) X[i:j] ≈ Y[i:j] for all 1 < i < j < |X|. In this paper, we generalize the notion of covers for SCERs and prove that existing algorithms to compute the shortest cover array and the longest cover array of a string T under the identity relation will work for any SCERs taking the accordingly generalized border arrays.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/21/2018

An output-sensitive algorithm for the minimization of 2-dimensional String Covers

String covers are a powerful tool for analyzing the quasi-periodicity of...
09/26/2021

An Analysis into the Performance and Memory Usage of MATLAB Strings

MATLAB is a mathematical computing environment used by many engineers, m...
12/21/2018

A Simple Algorithm for Computing the Document Array

We present a simple algorithm for computing the document array given the...
06/21/2018

A connection between String Covers and Cover Deterministic Finite Tree Automata Minimization

Data compression plays a crucial part in the cloud based systems of toda...
09/02/2020

An Algorithm for Automatically Updating a Forsyth-Edwards Notation String Without an Array Board Representation

We present an algorithm that correctly updates the Forsyth-Edwards Notat...
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...
07/06/2021

On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms

We characterize those strings whose suffix arrays are based on arithmeti...
This week in AI

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