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

4 Citations (Scopus)

Abstract

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
Pages162-168
Number of pages7
ISBN (Electronic)9788001055472
Publication statusPublished - Jan 1 2014
Event18th Prague Stringology Conference, PSC 2014 - Prague, Czech Republic
Duration: Sep 1 2014Sep 3 2014

Publication series

NameProceedings of the Prague Stringology Conference 2014, PSC 2014

Other

Other18th Prague Stringology Conference, PSC 2014
CountryCzech Republic
CityPrague
Period9/1/149/3/14

Fingerprint

Factorization
Strings
Closed
Sturmian Words
Suffix
Computing
Prefix
Linear Space
Linear Time

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Cite this

Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C. S., Inenaga, S., ... Sugimoto, S. (2014). Closed factorization. In J. Holub, & J. Zd'arek (Eds.), Proceedings of the Prague Stringology Conference 2014, PSC 2014 (pp. 162-168). (Proceedings of the Prague Stringology Conference 2014, PSC 2014). Prague Stringology Club.

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

Proceedings of the Prague Stringology Conference 2014, PSC 2014. ed. / Jan Holub; Jan Zd'arek. Prague Stringology Club, 2014. p. 162-168 (Proceedings of the Prague Stringology Conference 2014, PSC 2014).

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

Badkobeh, G, Bannai, H, Goto, K, I, T, Iliopoulos, CS, Inenaga, S, Puglisi, SJ & Sugimoto, S 2014, Closed factorization. in J Holub & J Zd'arek (eds), Proceedings of the Prague Stringology Conference 2014, PSC 2014. Proceedings of the Prague Stringology Conference 2014, PSC 2014, Prague Stringology Club, pp. 162-168, 18th Prague Stringology Conference, PSC 2014, Prague, Czech Republic, 9/1/14.
Badkobeh G, Bannai H, Goto K, I T, Iliopoulos CS, Inenaga S et al. Closed factorization. In Holub J, Zd'arek J, editors, Proceedings of the Prague Stringology Conference 2014, PSC 2014. Prague Stringology Club. 2014. p. 162-168. (Proceedings of the Prague Stringology Conference 2014, PSC 2014).
Badkobeh, Golnaz ; Bannai, Hideo ; Goto, Keisuke ; I, Tomohiro ; Iliopoulos, Costas S. ; Inenaga, Shunsuke ; Puglisi, Simon J. ; Sugimoto, Shiho. / Closed factorization. Proceedings of the Prague Stringology Conference 2014, PSC 2014. editor / Jan Holub ; Jan Zd'arek. Prague Stringology Club, 2014. pp. 162-168 (Proceedings of the Prague Stringology Conference 2014, PSC 2014).
@inproceedings{3bf723f1fed643c98faa9eaf71fd933a,
title = "Closed factorization",
abstract = "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.",
author = "Golnaz Badkobeh and Hideo Bannai and Keisuke Goto and Tomohiro I and Iliopoulos, {Costas S.} and Shunsuke Inenaga and Puglisi, {Simon J.} and Shiho Sugimoto",
year = "2014",
month = "1",
day = "1",
language = "English",
series = "Proceedings of the Prague Stringology Conference 2014, PSC 2014",
publisher = "Prague Stringology Club",
pages = "162--168",
editor = "Jan Holub and Jan Zd'arek",
booktitle = "Proceedings of the Prague Stringology Conference 2014, PSC 2014",

}

TY - GEN

T1 - Closed factorization

AU - Badkobeh, Golnaz

AU - Bannai, Hideo

AU - Goto, Keisuke

AU - I, Tomohiro

AU - Iliopoulos, Costas S.

AU - Inenaga, Shunsuke

AU - Puglisi, Simon J.

AU - Sugimoto, Shiho

PY - 2014/1/1

Y1 - 2014/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84928791807&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84928791807&partnerID=8YFLogxK

M3 - Conference contribution

T3 - Proceedings of the Prague Stringology Conference 2014, PSC 2014

SP - 162

EP - 168

BT - Proceedings of the Prague Stringology Conference 2014, PSC 2014

A2 - Holub, Jan

A2 - Zd'arek, Jan

PB - Prague Stringology Club

ER -