Dynamic index and LZ factorization in compressed space

Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we propose a new dynamic compressed index of O(w) space for a dynamic text T, where w=O(min(zlogNlogM,N)) is the size of the signature encoding of T, z is the size of the Lempel–Ziv77 (LZ77) factorization of T, N is the length of T, and M≥N is the maximum length of T. Our index supports searching for a pattern P in T in O(|P|fA+logwlog|P|logM(logN+log|P|logM)+occlogN) time and insertion/deletion of a substring of length y in O((y+logNlogM)logwlogNlogM) time, where occ is the number of occurrences of P in T and [Formula presented]. Also, we propose a new space-efficient LZ77 factorization algorithm for a given text T, which runs in O(NfA+zlogwlog3N(logN)2) time with O(w) working space.

Original languageEnglish
Pages (from-to)116-129
Number of pages14
JournalDiscrete Applied Mathematics
Volume274
DOIs
Publication statusPublished - Mar 15 2020

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this