Computing reversed Lempel-Ziv factorization online

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

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

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2013, PSC 2013
PublisherPrague Stringology Club
Pages107-118
Number of pages12
ISBN (Print)9788001053300
Publication statusPublished - Jan 1 2013
EventPrague Stringology Conference 2013, PSC 2013 - Prague, Czech Republic
Duration: Sep 2 2013Sep 4 2013

Publication series

NameProceedings of the Prague Stringology Conference 2013, PSC 2013

Other

OtherPrague Stringology Conference 2013, PSC 2013
CountryCzech Republic
CityPrague
Period9/2/139/4/13

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Computing reversed Lempel-Ziv factorization online'. Together they form a unique fingerprint.

Cite this