Faster Lyndon factorization algorithms for SLP and LZ78 compressed text

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

9 引用 (Scopus)

抄録

We present two efficient algorithms which, given a compressed representation of a string w of length N, compute the Lyndon factorization of w. Given a straight line program (SLP) S of size n that describes w, the first algorithm runs in O(n2+P(n,N)+Q(n,N)nlog⁡n) time and O(n2+S(n,N)) space, where P(n,N), S(n,N), Q(n,N) are respectively the pre-processing time, space, and query time of a data structure for longest common extensions (LCE) on SLPs. Given the Lempel–Ziv 78 encoding of size s for w, the second algorithm runs in O(slog⁡s) time and space.

元の言語英語
ページ(範囲)215-224
ページ数10
ジャーナルTheoretical Computer Science
656
DOI
出版物ステータス出版済み - 12 20 2016

Fingerprint

Straight-line Programs
Factorization
Data structures
Preprocessing
Data Structures
Encoding
Efficient Algorithms
Strings
Query
Processing
Text

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

@article{5d49d41f9675453b9c2453dc3024ec28,
title = "Faster Lyndon factorization algorithms for SLP and LZ78 compressed text",
abstract = "We present two efficient algorithms which, given a compressed representation of a string w of length N, compute the Lyndon factorization of w. Given a straight line program (SLP) S of size n that describes w, the first algorithm runs in O(n2+P(n,N)+Q(n,N)nlog⁡n) time and O(n2+S(n,N)) space, where P(n,N), S(n,N), Q(n,N) are respectively the pre-processing time, space, and query time of a data structure for longest common extensions (LCE) on SLPs. Given the Lempel–Ziv 78 encoding of size s for w, the second algorithm runs in O(slog⁡s) time and space.",
author = "Tomohiro I and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2016",
month = "12",
day = "20",
doi = "10.1016/j.tcs.2016.03.005",
language = "English",
volume = "656",
pages = "215--224",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Faster Lyndon factorization algorithms for SLP and LZ78 compressed text

AU - I, Tomohiro

AU - Nakashima, Yuto

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2016/12/20

Y1 - 2016/12/20

N2 - We present two efficient algorithms which, given a compressed representation of a string w of length N, compute the Lyndon factorization of w. Given a straight line program (SLP) S of size n that describes w, the first algorithm runs in O(n2+P(n,N)+Q(n,N)nlog⁡n) time and O(n2+S(n,N)) space, where P(n,N), S(n,N), Q(n,N) are respectively the pre-processing time, space, and query time of a data structure for longest common extensions (LCE) on SLPs. Given the Lempel–Ziv 78 encoding of size s for w, the second algorithm runs in O(slog⁡s) time and space.

AB - We present two efficient algorithms which, given a compressed representation of a string w of length N, compute the Lyndon factorization of w. Given a straight line program (SLP) S of size n that describes w, the first algorithm runs in O(n2+P(n,N)+Q(n,N)nlog⁡n) time and O(n2+S(n,N)) space, where P(n,N), S(n,N), Q(n,N) are respectively the pre-processing time, space, and query time of a data structure for longest common extensions (LCE) on SLPs. Given the Lempel–Ziv 78 encoding of size s for w, the second algorithm runs in O(slog⁡s) time and space.

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

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

U2 - 10.1016/j.tcs.2016.03.005

DO - 10.1016/j.tcs.2016.03.005

M3 - Article

VL - 656

SP - 215

EP - 224

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -