Efficiently finding all maximal α-gapped repeats

Paweł Gawrychowski, I. Tomohiro, Shunsuke Inenaga, Dominik Köppl, Florin Manea

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

7 引用 (Scopus)

抄録

For α ≥ 1, an α-gapped repeat in a word w is a factor uvu of w such that |uv| ≤ α|u|; the two occurrences of a factor u in such a repeat are called arms. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right nor to the left. We show that the number of all maximal α-gapped repeats occurring in words of length n is upper bounded by 18αn, allowing us to construct an algorithm finding all maximal α-gapped repeats of a word on an integer alphabet of size nO(1); in O(αn) time. This result is optimal as there are words that have Θ(αn) maximal α-gapped repeats. Our techniques can be extended to get comparable results in the case of α-gapped palindromes, i.e., factors uvuT with |uv| ≤ α|u|.

元の言語英語
ホスト出版物のタイトル33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
47
ISBN(電子版)9783959770019
DOI
出版物ステータス出版済み - 2 1 2016
イベント33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 - Orleans, フランス
継続期間: 2 17 20162 20 2016

その他

その他33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016
フランス
Orleans
期間2/17/162/20/16

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Gawrychowski, P., Tomohiro, I., Inenaga, S., Köppl, D., & Manea, F. (2016). Efficiently finding all maximal α-gapped repeats. : 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 (巻 47). [39] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2016.39

Efficiently finding all maximal α-gapped repeats. / Gawrychowski, Paweł; Tomohiro, I.; Inenaga, Shunsuke; Köppl, Dominik; Manea, Florin.

33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. 巻 47 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. 39.

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

Gawrychowski, P, Tomohiro, I, Inenaga, S, Köppl, D & Manea, F 2016, Efficiently finding all maximal α-gapped repeats. : 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. 巻. 47, 39, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Orleans, フランス, 2/17/16. https://doi.org/10.4230/LIPIcs.STACS.2016.39
Gawrychowski P, Tomohiro I, Inenaga S, Köppl D, Manea F. Efficiently finding all maximal α-gapped repeats. : 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. 巻 47. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. 39 https://doi.org/10.4230/LIPIcs.STACS.2016.39
Gawrychowski, Paweł ; Tomohiro, I. ; Inenaga, Shunsuke ; Köppl, Dominik ; Manea, Florin. / Efficiently finding all maximal α-gapped repeats. 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. 巻 47 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016.
@inproceedings{bcf363bf4fbf4ec6a82244327a91592c,
title = "Efficiently finding all maximal α-gapped repeats",
abstract = "For α ≥ 1, an α-gapped repeat in a word w is a factor uvu of w such that |uv| ≤ α|u|; the two occurrences of a factor u in such a repeat are called arms. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right nor to the left. We show that the number of all maximal α-gapped repeats occurring in words of length n is upper bounded by 18αn, allowing us to construct an algorithm finding all maximal α-gapped repeats of a word on an integer alphabet of size nO(1); in O(αn) time. This result is optimal as there are words that have Θ(αn) maximal α-gapped repeats. Our techniques can be extended to get comparable results in the case of α-gapped palindromes, i.e., factors uvuT with |uv| ≤ α|u|.",
author = "Paweł Gawrychowski and I. Tomohiro and Shunsuke Inenaga and Dominik K{\"o}ppl and Florin Manea",
year = "2016",
month = "2",
day = "1",
doi = "10.4230/LIPIcs.STACS.2016.39",
language = "English",
volume = "47",
booktitle = "33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - Efficiently finding all maximal α-gapped repeats

AU - Gawrychowski, Paweł

AU - Tomohiro, I.

AU - Inenaga, Shunsuke

AU - Köppl, Dominik

AU - Manea, Florin

PY - 2016/2/1

Y1 - 2016/2/1

N2 - For α ≥ 1, an α-gapped repeat in a word w is a factor uvu of w such that |uv| ≤ α|u|; the two occurrences of a factor u in such a repeat are called arms. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right nor to the left. We show that the number of all maximal α-gapped repeats occurring in words of length n is upper bounded by 18αn, allowing us to construct an algorithm finding all maximal α-gapped repeats of a word on an integer alphabet of size nO(1); in O(αn) time. This result is optimal as there are words that have Θ(αn) maximal α-gapped repeats. Our techniques can be extended to get comparable results in the case of α-gapped palindromes, i.e., factors uvuT with |uv| ≤ α|u|.

AB - For α ≥ 1, an α-gapped repeat in a word w is a factor uvu of w such that |uv| ≤ α|u|; the two occurrences of a factor u in such a repeat are called arms. Such a repeat is called maximal if its arms cannot be extended simultaneously with the same symbol to the right nor to the left. We show that the number of all maximal α-gapped repeats occurring in words of length n is upper bounded by 18αn, allowing us to construct an algorithm finding all maximal α-gapped repeats of a word on an integer alphabet of size nO(1); in O(αn) time. This result is optimal as there are words that have Θ(αn) maximal α-gapped repeats. Our techniques can be extended to get comparable results in the case of α-gapped palindromes, i.e., factors uvuT with |uv| ≤ α|u|.

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

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

U2 - 10.4230/LIPIcs.STACS.2016.39

DO - 10.4230/LIPIcs.STACS.2016.39

M3 - Conference contribution

VL - 47

BT - 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016

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

ER -