### Abstract

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 language | English |
---|---|

Pages (from-to) | 655-659 |

Number of pages | 5 |

Journal | Information Processing Letters |

Volume | 115 |

Issue number | 9 |

DOIs | |

Publication status | Published - Sep 1 2015 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

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

### Cite this

**Constructing LZ78 tries and position heaps in linear time for large alphabets.** / Nakashima, Yuto; I, Tomohiro; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

Research output: Contribution to journal › Article

*Information Processing Letters*, vol. 115, no. 9, pp. 655-659. https://doi.org/10.1016/j.ipl.2015.04.002

}

TY - JOUR

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

AU - Nakashima, Yuto

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2015/9/1

Y1 - 2015/9/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1016/j.ipl.2015.04.002

DO - 10.1016/j.ipl.2015.04.002

M3 - Article

AN - SCOPUS:84927723236

VL - 115

SP - 655

EP - 659

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 9

ER -