Efficient algorithms for longest closed factor array

Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Waleń

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 被引用数 (Scopus)

抄録

We consider a family of strings called closed strings and a related array of Longest Closed Factors (LCF). We show that the reconstruction of a string from its LCF array is easier than the construction and verification of this array. Moreover, the reconstructed string is unique. We improve also the time of construction/verification, reducing it from (image found) (n log n/ log log n) (the best previously known) to (image found) (n √log n).We use connections between the LCF array and the longest previous/next factor arrays.

本文言語英語
ホスト出版物のタイトルString Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings
編集者Simon J. Puglisi, Costas S. Iliopoulos, Emine Yilmaz
出版社Springer Verlag
ページ95-102
ページ数8
ISBN(印刷版)9783319238258
DOI
出版ステータス出版済み - 2015
イベント22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015 - London, 英国
継続期間: 9 1 20159 4 2015

出版物シリーズ

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

その他

その他22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015
国/地域英国
CityLondon
Period9/1/159/4/15

All Science Journal Classification (ASJC) codes

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

フィンガープリント

「Efficient algorithms for longest closed factor array」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル