Detecting regularities on grammar-compressed strings

I. Tomohiro, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara

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

7 引用 (Scopus)

抄録

We address the problems of detecting and counting various forms of regularities in a string represented as a straight-line program (SLP) which is essentially a context free grammar in the Chomsky normal form. Given an SLP of size n that represents a string s of length N, our algorithm computes all runs and squares in s in O(n3h) time and O(n2) space, where h is the height of the derivation tree of the SLP. We also show an algorithm to compute all gapped-palindromes in O(n3h + gnh log N) time and O(n2) space, where g is the length of the gap. As one of the main components of the above solution, we propose a new technique called approximate doubling which seems to be a useful tool for a wide range of algorithms on SLPs. Indeed, we show that the technique can be used to compute the periods and covers of the string in O(n2h) time and O(nh(n + log2 N)) time, respectively.

元の言語英語
ページ(範囲)74-89
ページ数16
ジャーナルInformation and Computation
240
DOI
出版物ステータス出版済み - 1 1 2015

Fingerprint

Straight-line Programs
Grammar
Strings
Regularity
Context free grammars
Palindrome
Context-free Grammar
Doubling
Normal Form
Counting
Cover
Range of data

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

これを引用

Detecting regularities on grammar-compressed strings. / Tomohiro, I.; Matsubara, Wataru; Shimohira, Kouji; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki; Narisawa, Kazuyuki; Shinohara, Ayumi.

:: Information and Computation, 巻 240, 01.01.2015, p. 74-89.

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

Tomohiro, I. ; Matsubara, Wataru ; Shimohira, Kouji ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki ; Narisawa, Kazuyuki ; Shinohara, Ayumi. / Detecting regularities on grammar-compressed strings. :: Information and Computation. 2015 ; 巻 240. pp. 74-89.
@article{00aacece4892418ebc23c2897f563e9a,
title = "Detecting regularities on grammar-compressed strings",
abstract = "We address the problems of detecting and counting various forms of regularities in a string represented as a straight-line program (SLP) which is essentially a context free grammar in the Chomsky normal form. Given an SLP of size n that represents a string s of length N, our algorithm computes all runs and squares in s in O(n3h) time and O(n2) space, where h is the height of the derivation tree of the SLP. We also show an algorithm to compute all gapped-palindromes in O(n3h + gnh log N) time and O(n2) space, where g is the length of the gap. As one of the main components of the above solution, we propose a new technique called approximate doubling which seems to be a useful tool for a wide range of algorithms on SLPs. Indeed, we show that the technique can be used to compute the periods and covers of the string in O(n2h) time and O(nh(n + log2 N)) time, respectively.",
author = "I. Tomohiro and Wataru Matsubara and Kouji Shimohira and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Kazuyuki Narisawa and Ayumi Shinohara",
year = "2015",
month = "1",
day = "1",
doi = "10.1016/j.ic.2014.09.009",
language = "English",
volume = "240",
pages = "74--89",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Detecting regularities on grammar-compressed strings

AU - Tomohiro, I.

AU - Matsubara, Wataru

AU - Shimohira, Kouji

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

AU - Narisawa, Kazuyuki

AU - Shinohara, Ayumi

PY - 2015/1/1

Y1 - 2015/1/1

N2 - We address the problems of detecting and counting various forms of regularities in a string represented as a straight-line program (SLP) which is essentially a context free grammar in the Chomsky normal form. Given an SLP of size n that represents a string s of length N, our algorithm computes all runs and squares in s in O(n3h) time and O(n2) space, where h is the height of the derivation tree of the SLP. We also show an algorithm to compute all gapped-palindromes in O(n3h + gnh log N) time and O(n2) space, where g is the length of the gap. As one of the main components of the above solution, we propose a new technique called approximate doubling which seems to be a useful tool for a wide range of algorithms on SLPs. Indeed, we show that the technique can be used to compute the periods and covers of the string in O(n2h) time and O(nh(n + log2 N)) time, respectively.

AB - We address the problems of detecting and counting various forms of regularities in a string represented as a straight-line program (SLP) which is essentially a context free grammar in the Chomsky normal form. Given an SLP of size n that represents a string s of length N, our algorithm computes all runs and squares in s in O(n3h) time and O(n2) space, where h is the height of the derivation tree of the SLP. We also show an algorithm to compute all gapped-palindromes in O(n3h + gnh log N) time and O(n2) space, where g is the length of the gap. As one of the main components of the above solution, we propose a new technique called approximate doubling which seems to be a useful tool for a wide range of algorithms on SLPs. Indeed, we show that the technique can be used to compute the periods and covers of the string in O(n2h) time and O(nh(n + log2 N)) time, respectively.

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

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

U2 - 10.1016/j.ic.2014.09.009

DO - 10.1016/j.ic.2014.09.009

M3 - Article

VL - 240

SP - 74

EP - 89

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -