An efficient algorithm to test square-freeness of strings compressed by straight-line programs

Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We give a simple algorithm that, given a straight-line program of size n for a string S of length N, tests whether S is square-free in O(n 4logN) time and O(n2) space. The algorithm also allows us to test square-freeness on an arbitrary composition system of size c for S, in O(c4log5N) time and O(c2log2N) space, which is faster than using the algorithm by Ga̧sieniec, Karpinski, Plandowski, and Rytter (1996) [4].

Original languageEnglish
Pages (from-to)711-714
Number of pages4
JournalInformation Processing Letters
Volume112
Issue number19
DOIs
StatePublished - 15 Oct 2012

Bibliographical note

Funding Information:
1Partially supported by the National Science Foundation Award 0904246, Israel Science Foundation grant 347/09, Grant No. 2008217 from the United States–Israel Binational Science Foundation (BSF) and DFG.

Funding

1Partially supported by the National Science Foundation Award 0904246, Israel Science Foundation grant 347/09, Grant No. 2008217 from the United States–Israel Binational Science Foundation (BSF) and DFG.

FundersFunder number
National Science Foundation0904246
Bloom's Syndrome Foundation
Deutsche Forschungsgemeinschaft
Japan Society for the Promotion of Science23700022, 22300010, 12J06417
United States-Israel Binational Science Foundation
Israel Science Foundation2008217, 347/09

    Keywords

    • Algorithms
    • Repetitions in strings
    • Straight-line programs
    • String processing
    • Text compression

    Fingerprint

    Dive into the research topics of 'An efficient algorithm to test square-freeness of strings compressed by straight-line programs'. Together they form a unique fingerprint.

    Cite this