Closed factorization

Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto

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

5 被引用数 (Scopus)

抄録

A closed string is a string with a proper substring that occurs in the string as a prefix and a suffix, but not elsewhere. Closed strings were introduced by Fici (Proc. WORDS, 2011) as objects of combinatorial interest in the study of Trapezoidal and Sturmian words. In this paper we consider algorithms for computing closed factors (substrings) in strings, and in particular for greedily factorizing a string into a sequence of longest closed factors. We describe an algorithm for this problem that uses linear time and space. We then consider the related problem of computing, for every position in the string, the longest closed factor starting at that position. We describe a simple algorithm for the problem that runs in O(n log n/ log log n) time.

本文言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2014, PSC 2014
編集者Jan Holub, Jan Zd'arek
出版社Prague Stringology Club
ページ162-168
ページ数7
ISBN(電子版)9788001055472
出版ステータス出版済み - 2014
イベント18th Prague Stringology Conference, PSC 2014 - Prague, チェコ共和国
継続期間: 9 1 20149 3 2014

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2014, PSC 2014

その他

その他18th Prague Stringology Conference, PSC 2014
国/地域チェコ共和国
CityPrague
Period9/1/149/3/14

All Science Journal Classification (ASJC) codes

  • 数学 (全般)

フィンガープリント

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

引用スタイル