TY - GEN
T1 - Computing smallest and largest repetition factorizations in O(n log n) time
AU - Inoue, Hiroe
AU - Matsuoka, Yoshiaki
AU - Nakashima, Yuto
AU - Inenaga, Shunsuke
AU - Bannai, Hideo
AU - Takeda, Masayuki
N1 - Publisher Copyright:
© Czech Technical University in Prague.
PY - 2016
Y1 - 2016
N2 - A factorization f1, . . . , fm of a string w is called a repetition factorization of w if each factor fi is a repetition, namely, fi = xkx' for some non-empty string x, an integer k ≥ 2, and x' being a proper prefix of x. Dumitran et al. (Proc. SPIRE 2015) proposed an algorithm which computes a repetition factorization of a given string w in O(n) time, where n is the length of w. In this paper, we propose two algorithms which compute smallest/largest repetition factorizations in O(n log n) time. The first algorithm is a simple O(n log n) space algorithm while the second one uses only O(n) space.
AB - A factorization f1, . . . , fm of a string w is called a repetition factorization of w if each factor fi is a repetition, namely, fi = xkx' for some non-empty string x, an integer k ≥ 2, and x' being a proper prefix of x. Dumitran et al. (Proc. SPIRE 2015) proposed an algorithm which computes a repetition factorization of a given string w in O(n) time, where n is the length of w. In this paper, we propose two algorithms which compute smallest/largest repetition factorizations in O(n log n) time. The first algorithm is a simple O(n log n) space algorithm while the second one uses only O(n) space.
UR - http://www.scopus.com/inward/record.url?scp=85068038769&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85068038769&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85068038769
T3 - Proceedings of the Prague Stringology Conference, PSC 2016
SP - 135
EP - 145
BT - Proceedings of the Prague Stringology Conference, PSC 2016
A2 - Holub, Jan
A2 - Zdarek, Jan
PB - Prague Stringology Club
T2 - 20th Prague Stringology Conference, PSC 2016
Y2 - 29 August 2016 through 31 August 2016
ER -