Factorizing a string into squares in linear time

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

研究成果: 著書/レポートタイプへの貢献会議での発言

2 引用 (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

Fingerprint

Factorization
Random access storage

All Science Journal Classification (ASJC) codes

  • Software

これを引用

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

Factorizing a string into squares in linear time. / Matsuoka, Yoshiaki; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki; Manea, Florin.

27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. 巻 54 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. p. 27.1-27.12.

研究成果: 著書/レポートタイプへの貢献会議での発言

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, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 27.1-27.12, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, Tel Aviv, イスラエル, 6/27/16. https://doi.org/10.4230/LIPIcs.CPM.2016.27
Matsuoka Y, Inenaga S, Bannai H, Takeda M, Manea F. Factorizing a string into squares in linear time. : 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. 巻 54. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. p. 27.1-27.12 https://doi.org/10.4230/LIPIcs.CPM.2016.27
Matsuoka, Yoshiaki ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki ; Manea, Florin. / Factorizing a string into squares in linear time. 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. 巻 54 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. pp. 27.1-27.12
@inproceedings{96164ffa8e0a4f3b9437977bf40a93db,
title = "Factorizing a string into squares in linear time",
abstract = "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.",
author = "Yoshiaki Matsuoka and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Florin Manea",
year = "2016",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.CPM.2016.27",
language = "English",
volume = "54",
pages = "27.1--27.12",
booktitle = "27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - Factorizing a string into squares in linear time

AU - Matsuoka, Yoshiaki

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

AU - Manea, Florin

PY - 2016/6/1

Y1 - 2016/6/1

N2 - 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.

AB - 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.

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

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

U2 - 10.4230/LIPIcs.CPM.2016.27

DO - 10.4230/LIPIcs.CPM.2016.27

M3 - Conference contribution

VL - 54

SP - 27.1-27.12

BT - 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -