Computing Covers Under Substring Consistent Equivalence Relations

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルString Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings
編集者Christina Boucher, Sharma V. Thankachan
出版社Springer Science and Business Media Deutschland GmbH
ページ131-146
ページ数16
ISBN(印刷版)9783030592110
DOI
出版ステータスPublished - 2020
イベント27th International Symposium on String Processing and Information Retrieval, SPIRE 2020 - Orlando, United States
継続期間: 2020 10 132020 10 15

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
12303 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference27th International Symposium on String Processing and Information Retrieval, SPIRE 2020
国/地域United States
CityOrlando
Period20/10/1320/10/15

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Computing Covers Under Substring Consistent Equivalence Relations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル