Constructing LZ78 tries and position heaps in linear time for large alphabets

Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Research output: Contribution to journalArticlepeer-review

12 Citations (Scopus)


We present the first worst-case linear-time algorithm to compute the Lempel-Ziv 78 factorization of a given string over an integer alphabet. Our algorithm is based on nearest marked ancestor queries on the suffix tree of the given string. We also show that the same technique can be used to construct the position heap of a set of strings in worst-case linear time, when the set of strings is given as a trie.

Original languageEnglish
Pages (from-to)655-659
Number of pages5
JournalInformation Processing Letters
Issue number9
Publication statusPublished - Sept 1 2015

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Constructing LZ78 tries and position heaps in linear time for large alphabets'. Together they form a unique fingerprint.

Cite this