Dynamic index and LZ factorization in compressed space

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

研究成果: ジャーナルへの寄稿記事

抄録

In this paper, we propose a new dynamic compressed index of O(w) space for a dynamic text T, where w=O(min(zlogNlog M,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|f A +logwlog|P|log M(logN+log|P|log M)+occlogN) time and insertion/deletion of a substring of length y in O((y+logNlog M)logwlogNlog M) time, where occ is the number of occurrences of P in T and f A =O(min{[Formula presented],[Formula presented]}). Also, we propose a new space-efficient LZ77 factorization algorithm for a given text T, which runs in O(Nf A +zlogwlog 3 N(log N) 2 ) time with O(w) working space.

元の言語英語
ジャーナルDiscrete Applied Mathematics
DOI
出版物ステータス出版済み - 1 1 2019

Fingerprint

Factorization
Deletion
Insertion
Encoding
Signature
Text

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

これを引用

Dynamic index and LZ factorization in compressed space. / Nishimoto, Takaaki; Tomohiro, I.; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

:: Discrete Applied Mathematics, 01.01.2019.

研究成果: ジャーナルへの寄稿記事

@article{926567d44d104fe3b04dd622243d8e5b,
title = "Dynamic index and LZ factorization in compressed space",
abstract = "In this paper, we propose a new dynamic compressed index of O(w) space for a dynamic text T, where w=O(min(zlogNlog ∗ M,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|f A +logwlog|P|log ∗ M(logN+log|P|log ∗ M)+occlogN) time and insertion/deletion of a substring of length y in O((y+logNlog ∗ M)logwlogNlog ∗ M) time, where occ is the number of occurrences of P in T and f A =O(min{[Formula presented],[Formula presented]}). Also, we propose a new space-efficient LZ77 factorization algorithm for a given text T, which runs in O(Nf A +zlogwlog 3 N(log ∗ N) 2 ) time with O(w) working space.",
author = "Takaaki Nishimoto and I. Tomohiro and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2019",
month = "1",
day = "1",
doi = "10.1016/j.dam.2019.01.014",
language = "English",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

TY - JOUR

T1 - Dynamic index and LZ factorization in compressed space

AU - Nishimoto, Takaaki

AU - Tomohiro, I.

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2019/1/1

Y1 - 2019/1/1

N2 - In this paper, we propose a new dynamic compressed index of O(w) space for a dynamic text T, where w=O(min(zlogNlog ∗ M,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|f A +logwlog|P|log ∗ M(logN+log|P|log ∗ M)+occlogN) time and insertion/deletion of a substring of length y in O((y+logNlog ∗ M)logwlogNlog ∗ M) time, where occ is the number of occurrences of P in T and f A =O(min{[Formula presented],[Formula presented]}). Also, we propose a new space-efficient LZ77 factorization algorithm for a given text T, which runs in O(Nf A +zlogwlog 3 N(log ∗ N) 2 ) time with O(w) working space.

AB - In this paper, we propose a new dynamic compressed index of O(w) space for a dynamic text T, where w=O(min(zlogNlog ∗ M,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|f A +logwlog|P|log ∗ M(logN+log|P|log ∗ M)+occlogN) time and insertion/deletion of a substring of length y in O((y+logNlog ∗ M)logwlogNlog ∗ M) time, where occ is the number of occurrences of P in T and f A =O(min{[Formula presented],[Formula presented]}). Also, we propose a new space-efficient LZ77 factorization algorithm for a given text T, which runs in O(Nf A +zlogwlog 3 N(log ∗ N) 2 ) time with O(w) working space.

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

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

U2 - 10.1016/j.dam.2019.01.014

DO - 10.1016/j.dam.2019.01.014

M3 - Article

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -