Closed factorization

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

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

5 Citations (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.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2014, PSC 2014
EditorsJan Holub, Jan Zd'arek
PublisherPrague Stringology Club
Number of pages7
ISBN (Electronic)9788001055472
Publication statusPublished - 2014
Event18th Prague Stringology Conference, PSC 2014 - Prague, Czech Republic
Duration: Sept 1 2014Sept 3 2014

Publication series

NameProceedings of the Prague Stringology Conference 2014, PSC 2014


Other18th Prague Stringology Conference, PSC 2014
Country/TerritoryCzech Republic

All Science Journal Classification (ASJC) codes

  • Mathematics(all)


Dive into the research topics of 'Closed factorization'. Together they form a unique fingerprint.

Cite this