Converting SLP to LZ78 in almost linear time

Hideo Bannai, Paweł Gawrychowski, Shunsuke Inenaga, Masayuki Takeda

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

7 Citations (Scopus)


Given a straight line program of size n, we are interested in constructing the LZ78 factorization of the corresponding text. We show how to perform such conversion in O(n + m log m) time, where m is the number of LZ78 codewords. This improves on the previously known O(n√N + m log N) solution [Bannai et al., SPIRE 2012]. The main tool in our algorithm is a data structure which allows us to efficiently operate on labels of the paths in a growing trie, and a certain method of recompressing the parse whenever it leads to decreasing its size.

Original languageEnglish
Title of host publicationCombinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings
Number of pages12
Publication statusPublished - 2013
Event24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013 - Bad Herrenalb, Germany
Duration: Jun 17 2013Jun 19 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7922 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013
CityBad Herrenalb

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Converting SLP to LZ78 in almost linear time'. Together they form a unique fingerprint.

Cite this