Factorizing a string into squares in linear time

Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

3 引用 (Scopus)

抜粋

A square factorization of a string w is a factorization of w in which each factor is a square. Dumitran et al. [SPIRE 2015, pp. 54-66] showed how to find a square factorization of a given string of length n in O(n log n) time, and they posed a question whether it can be done in O(n) time. In this paper, we answer their question positively, showing an O(n)-time algorithm for square factorization in the standard word RAM model with machine word size ω = Ω(log n). We also show an O(n + (n log2 n)/ω)-time (respectively, O(n log n)-time) algorithm to find a square factorization which contains the maximum (respectively, minimum) number of squares.

元の言語英語
ホスト出版物のタイトル27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ページ27.1-27.12
54
ISBN(電子版)9783959770125
DOI
出版物ステータス出版済み - 6 1 2016
イベント27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 - Tel Aviv, イスラエル
継続期間: 6 27 20166 29 2016

その他

その他27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
イスラエル
Tel Aviv
期間6/27/166/29/16

All Science Journal Classification (ASJC) codes

  • Software

フィンガープリント Factorizing a string into squares in linear time' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Matsuoka, Y., Inenaga, S., Bannai, H., Takeda, M., & Manea, F. (2016). Factorizing a string into squares in linear time. : 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 (巻 54, pp. 27.1-27.12). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2016.27