Computing Covers Under Substring Consistent Equivalence Relations

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 shortest and longest cover arrays of T have the lengths of the shortest and longest covers of each prefix of T, respectively. 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 implies (1) and (2) for all. 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.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings
EditorsChristina Boucher, Sharma V. Thankachan
PublisherSpringer Science and Business Media Deutschland GmbH
Pages131-146
Number of pages16
ISBN (Print)9783030592110
DOIs
Publication statusPublished - 2020
Event27th International Symposium on String Processing and Information Retrieval, SPIRE 2020 - Orlando, United States
Duration: 2020 Oct 132020 Oct 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12303 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Symposium on String Processing and Information Retrieval, SPIRE 2020
CountryUnited States
CityOrlando
Period20/10/1320/10/15

Keywords

  • String covers
  • String regularities
  • Substring consistent equivalence relations

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Computing Covers Under Substring Consistent Equivalence Relations'. Together they form a unique fingerprint.

Cite this