Computing reversed Lempel-Ziv factorization online

Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: 著書/レポートタイプへの貢献会議での発言

1 引用 (Scopus)

抜粋

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.

元の言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2013, PSC 2013
出版者Prague Stringology Club
ページ107-118
ページ数12
ISBN(印刷物)9788001053300
出版物ステータス出版済み - 1 1 2013
イベントPrague Stringology Conference 2013, PSC 2013 - Prague, チェコ共和国
継続期間: 9 2 20139 4 2013

出版物シリーズ

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

その他

その他Prague Stringology Conference 2013, PSC 2013
チェコ共和国
Prague
期間9/2/139/4/13

    フィンガープリント

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

これを引用

Sugimoto, S., I, T., Inenaga, S., Bannai, H., & Takeda, M. (2013). Computing reversed Lempel-Ziv factorization online. : Proceedings of the Prague Stringology Conference 2013, PSC 2013 (pp. 107-118). (Proceedings of the Prague Stringology Conference 2013, PSC 2013). Prague Stringology Club.