Computing abelian string regularities based on RLE

Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

1 引用 (Scopus)

抄録

Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is said to be an Abelian square. If a string w can be factorized into a sequence v1, …, vs of strings such that v1, …, vs-1 are all Abelian equivalent and vs is a substring of a permutation of v1, then w is said to have a regular Abelian period (p, t) where p = |v1| and t = |vs|. If a substring w1[i.i+l-1] of a string w1 and a substring w2[j.j + l - 1] of another string w2 are Abelian equivalent, then the substrings are said to be a common Abelian factor of w1 and w2 and if the length l is the maximum of such then the substrings are said to be a longest common Abelian factor of w1 and w2. We propose efficient algorithms which compute these Abelian regularities using the run length encoding (RLE) of strings. For a given string w of length n whose RLE is of size m, we propose algorithms which compute all Abelian squares occurring in w in O(mn) time, and all regular Abelian periods of w in O(mn) time. For two given strings w1 and w2 of total length n and of total RLE size m, we propose an algorithm which computes all longest common Abelian factors in O(m2n) time.

元の言語英語
ホスト出版物のタイトルCombinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers
編集者William F. Smyth, Ljiljana Brankovic, Joe Ryan
出版者Springer Verlag
ページ420-431
ページ数12
ISBN(印刷物)9783319788241
DOI
出版物ステータス出版済み - 1 1 2018
イベント28th International Workshop on Combinational Algorithms, IWOCA 2017 - Newcastle, NSW, オーストラリア
継続期間: 7 17 20177 21 2017

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10765 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他28th International Workshop on Combinational Algorithms, IWOCA 2017
オーストラリア
Newcastle, NSW
期間7/17/177/21/17

Fingerprint

Run-length Encoding
Strings
Regularity
Computing
Permutation
Efficient Algorithms

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Sugimoto, S., Noda, N., Inenaga, S., Bannai, H., & Takeda, M. (2018). Computing abelian string regularities based on RLE. : W. F. Smyth, L. Brankovic, & J. Ryan (版), Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers (pp. 420-431). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10765 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-78825-8_34

Computing abelian string regularities based on RLE. / Sugimoto, Shiho; Noda, Naoki; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers. 版 / William F. Smyth; Ljiljana Brankovic; Joe Ryan. Springer Verlag, 2018. p. 420-431 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 10765 LNCS).

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

Sugimoto, S, Noda, N, Inenaga, S, Bannai, H & Takeda, M 2018, Computing abelian string regularities based on RLE. : WF Smyth, L Brankovic & J Ryan (版), Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 10765 LNCS, Springer Verlag, pp. 420-431, 28th International Workshop on Combinational Algorithms, IWOCA 2017, Newcastle, NSW, オーストラリア, 7/17/17. https://doi.org/10.1007/978-3-319-78825-8_34
Sugimoto S, Noda N, Inenaga S, Bannai H, Takeda M. Computing abelian string regularities based on RLE. : Smyth WF, Brankovic L, Ryan J, 編集者, Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers. Springer Verlag. 2018. p. 420-431. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-78825-8_34
Sugimoto, Shiho ; Noda, Naoki ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Computing abelian string regularities based on RLE. Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers. 編集者 / William F. Smyth ; Ljiljana Brankovic ; Joe Ryan. Springer Verlag, 2018. pp. 420-431 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{55d3d3d2b0b14582be4c2a5d09ece5ac,
title = "Computing abelian string regularities based on RLE",
abstract = "Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is said to be an Abelian square. If a string w can be factorized into a sequence v1, …, vs of strings such that v1, …, vs-1 are all Abelian equivalent and vs is a substring of a permutation of v1, then w is said to have a regular Abelian period (p, t) where p = |v1| and t = |vs|. If a substring w1[i.i+l-1] of a string w1 and a substring w2[j.j + l - 1] of another string w2 are Abelian equivalent, then the substrings are said to be a common Abelian factor of w1 and w2 and if the length l is the maximum of such then the substrings are said to be a longest common Abelian factor of w1 and w2. We propose efficient algorithms which compute these Abelian regularities using the run length encoding (RLE) of strings. For a given string w of length n whose RLE is of size m, we propose algorithms which compute all Abelian squares occurring in w in O(mn) time, and all regular Abelian periods of w in O(mn) time. For two given strings w1 and w2 of total length n and of total RLE size m, we propose an algorithm which computes all longest common Abelian factors in O(m2n) time.",
author = "Shiho Sugimoto and Naoki Noda and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-78825-8_34",
language = "English",
isbn = "9783319788241",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "420--431",
editor = "Smyth, {William F.} and Ljiljana Brankovic and Joe Ryan",
booktitle = "Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers",
address = "Germany",

}

TY - GEN

T1 - Computing abelian string regularities based on RLE

AU - Sugimoto, Shiho

AU - Noda, Naoki

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is said to be an Abelian square. If a string w can be factorized into a sequence v1, …, vs of strings such that v1, …, vs-1 are all Abelian equivalent and vs is a substring of a permutation of v1, then w is said to have a regular Abelian period (p, t) where p = |v1| and t = |vs|. If a substring w1[i.i+l-1] of a string w1 and a substring w2[j.j + l - 1] of another string w2 are Abelian equivalent, then the substrings are said to be a common Abelian factor of w1 and w2 and if the length l is the maximum of such then the substrings are said to be a longest common Abelian factor of w1 and w2. We propose efficient algorithms which compute these Abelian regularities using the run length encoding (RLE) of strings. For a given string w of length n whose RLE is of size m, we propose algorithms which compute all Abelian squares occurring in w in O(mn) time, and all regular Abelian periods of w in O(mn) time. For two given strings w1 and w2 of total length n and of total RLE size m, we propose an algorithm which computes all longest common Abelian factors in O(m2n) time.

AB - Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is said to be an Abelian square. If a string w can be factorized into a sequence v1, …, vs of strings such that v1, …, vs-1 are all Abelian equivalent and vs is a substring of a permutation of v1, then w is said to have a regular Abelian period (p, t) where p = |v1| and t = |vs|. If a substring w1[i.i+l-1] of a string w1 and a substring w2[j.j + l - 1] of another string w2 are Abelian equivalent, then the substrings are said to be a common Abelian factor of w1 and w2 and if the length l is the maximum of such then the substrings are said to be a longest common Abelian factor of w1 and w2. We propose efficient algorithms which compute these Abelian regularities using the run length encoding (RLE) of strings. For a given string w of length n whose RLE is of size m, we propose algorithms which compute all Abelian squares occurring in w in O(mn) time, and all regular Abelian periods of w in O(mn) time. For two given strings w1 and w2 of total length n and of total RLE size m, we propose an algorithm which computes all longest common Abelian factors in O(m2n) time.

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

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

U2 - 10.1007/978-3-319-78825-8_34

DO - 10.1007/978-3-319-78825-8_34

M3 - Conference contribution

SN - 9783319788241

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

SP - 420

EP - 431

BT - Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers

A2 - Smyth, William F.

A2 - Brankovic, Ljiljana

A2 - Ryan, Joe

PB - Springer Verlag

ER -