TY - GEN

T1 - Detecting regularities on grammar-compressed strings

AU - I, Tomohiro

AU - Matsubara, Wataru

AU - Shimohira, Kouji

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

AU - Narisawa, Kazuyuki

AU - Shinohara, Ayumi

PY - 2013

Y1 - 2013

N2 - We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). 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(n3 h) 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(n3 h + gnhlog N) time and O(n2) space, where g is the length of the gap. The key technique of the above solution also allows us to compute the periods and covers of the string in O(n2 h) time and O(nh(n + log2 N)) time, respectively.

AB - We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). 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(n3 h) 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(n3 h + gnhlog N) time and O(n2) space, where g is the length of the gap. The key technique of the above solution also allows us to compute the periods and covers of the string in O(n2 h) time and O(nh(n + log2 N)) time, respectively.

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

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

U2 - 10.1007/978-3-642-40313-2_51

DO - 10.1007/978-3-642-40313-2_51

M3 - Conference contribution

AN - SCOPUS:84885196704

SN - 9783642403125

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 571

EP - 582

BT - Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings

PB - Springer Verlag

T2 - 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013

Y2 - 26 August 2013 through 30 August 2013

ER -