TY - GEN

T1 - Computing reversed Lempel-Ziv factorization online

AU - Sugimoto, Shiho

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2013/1/1

Y1 - 2013/1/1

N2 - Kolpakov and Kucherov proposed a variant of the Lempel-Ziv factorization, called the reversed Lempel-Ziv (RLZ) factorization (Theoretical Computer Science, 410(51):5365-5373, 2009). In this paper, we present an on-line algorithm that computes the RLZ factorization of a given string w of length n in 0(n log2 n) time using 0(n log σ) bits of space, where a < n is the alphabet size. Also, we introduce a new variant of the RLZ factorization with self-references, and present two on-line algorithms to compute this variant, in 0(n log σ) time using 0(n log n) bits of space, and in 0(n log2 n) time using 0(n log σ) bits of space.

AB - Kolpakov and Kucherov proposed a variant of the Lempel-Ziv factorization, called the reversed Lempel-Ziv (RLZ) factorization (Theoretical Computer Science, 410(51):5365-5373, 2009). In this paper, we present an on-line algorithm that computes the RLZ factorization of a given string w of length n in 0(n log2 n) time using 0(n log σ) bits of space, where a < n is the alphabet size. Also, we introduce a new variant of the RLZ factorization with self-references, and present two on-line algorithms to compute this variant, in 0(n log σ) time using 0(n log n) bits of space, and in 0(n log2 n) time using 0(n log σ) bits of space.

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

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

M3 - Conference contribution

AN - SCOPUS:84884642375

SN - 9788001053300

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

SP - 107

EP - 118

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

PB - Prague Stringology Club

T2 - Prague Stringology Conference 2013, PSC 2013

Y2 - 2 September 2013 through 4 September 2013

ER -