Combinatorics of repetitive structures in strings and its applications
Project/Area Number |
16H02783
|
Research Category |
Grant-in-Aid for Scientific Research (B)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Theory of informatics
|
Research Institution | Kyushu University |
Principal Investigator |
Bannai Hideo 九州大学, システム情報科学研究院, 准教授 (20323644)
|
Co-Investigator(Kenkyū-buntansha) |
井 智弘 九州工業大学, 大学院情報工学研究院, 准教授 (20773360)
稲永 俊介 九州大学, システム情報科学研究院, 准教授 (60448404)
|
Project Period (FY) |
2016-04-01 – 2020-03-31
|
Project Status |
Completed (Fiscal Year 2019)
|
Budget Amount *help |
¥16,510,000 (Direct Cost: ¥12,700,000、Indirect Cost: ¥3,810,000)
Fiscal Year 2019: ¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2018: ¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2017: ¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2016: ¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
|
Keywords | 繰り返し構造 / 連 / 平方 / Lyndon 語 / トライ上の繰り返し構造 / 最長共通繰り返し構造 / 索引構造 / 文字列 / 平方部分列 / Lyndon 文字列 / 回文 / 連長圧縮 / アーベル周期 / 平方分解 / 反復分解 / 非反復文字列 / 不在文字列 / 周期 |
Outline of Final Research Achievements |
We worked on various problems related to repeating structures in strings, such as characteristics of repeating structures in a string given in a compressed representation, repeating structures in a set of strings given in a trie representation, repeating structures common to multiple strings, and Lyndon words, Lyndon factorization, Lyndon trees which are related to repeating structures. Furthermore, we proposed algorithms and data structures for efficient computation of such repeating structures by exploiting these characteristics.
|
Academic Significance and Societal Importance of the Research Achievements |
本研究の成果として得られた繰り返し構造の諸性質は文字列の組合せ論に関する基礎的なものである。これらの諸性質は本研究で提案したアルゴリズムだけでなく,今後出現する様々な種類の文字列データ・問題に対する効率的な処理アルゴリズムの開発に広く寄与する可能性がある。また,特定のクラスの繰り返し構造がどの程度文字列に含まれているか等の組合せ的性質は,その繰り返し構造の観点から見たその文字列の複雑性・記述長という特徴として捉えることができ,データの解釈や分類の利用に繋がる可能性がある。
|
Report
(5 results)
Research Products
(98 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] Computing Runs on a Trie2019
Author(s)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
-
Journal Title
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
Volume: LIPIcs 128
Pages: 23:1-23:11
DOI
Related Report
Peer Reviewed / Open Access
-
[Journal Article] Indexing the Bijective BWT2019
Author(s)
Hideo Bannai, Juha Karkkainen, Dominik Koeppl, Marcin Piatkowski
-
Journal Title
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
Volume: LIPIcs 128
Pages: 17:1-17:14
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
-
-
-
[Journal Article] Diverse Palindromic Factorization is NP-Complete2018
Author(s)
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen, Dominik Kempa Dominik, Marcin Piatkowski, Shiho Sugimoto
-
Journal Title
International Journal of Foundations of Computer Science
Volume: 29
Pages: 143~163
DOI
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
-
[Journal Article] Faster Online Elastic Degenerate String Matching2018
Author(s)
Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
-
Journal Title
Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Volume: LIPIcs 105
Pages: 9:1-9:10
DOI
Related Report
Peer Reviewed / Open Access
-
[Journal Article] Longest substring palindrome after edit2018
Author(s)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
-
Journal Title
Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Volume: LIPIcs 105
Pages: 12:1-12:14
DOI
Related Report
Peer Reviewed / Open Access
-
[Journal Article] Computing longest common square subsequences2018
Author(s)
Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyro, Hideo Bannai, Masayuki Takeda
-
Journal Title
Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Volume: LIPIcs 105
Pages: 15:1-15:13
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
[Journal Article] Longest Lyndon Substring After Edit2018
Author(s)
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
-
Journal Title
Proceedings of the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Volume: LIPIcs 105
Pages: 19:1-19:10
DOI
Related Report
Peer Reviewed / Open Access
-
-
-
-
-
-
[Journal Article] The “Runs” Theorem2017
Author(s)
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
-
Journal Title
SIAM Journal on Computing
Volume: 46
Pages: 1501~1514
DOI
Related Report
Peer Reviewed
-
-
-
-
[Journal Article] Faster STR-IC-LCS Computation via RLE2017
Author(s)
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
-
Journal Title
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
Volume: LIPIcs 78
Pages: 20:1-20:12
DOI
Related Report
Peer Reviewed / Open Access
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] Finding Gapped Palindromes Online2016
Author(s)
Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
-
Journal Title
Proc. 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
Volume: LNCS 9843
Pages: 191-202
DOI
Related Report
Peer Reviewed / Open Access
-
[Journal Article] Factorizing a String into Squares in Linear Time2016
Author(s)
Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea
-
Journal Title
Proc. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)
Volume: LIPIcs 54
Pages: 27:1-27:12
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
[Journal Article] Closed factorization2016
Author(s)
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
-
Journal Title
Discrete Applied Mathematics
Volume: 212
Pages: 23-29
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
[Presentation] Computing Runs on a Trie2019
Author(s)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Organizer
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
Related Report
Int'l Joint Research
-
[Presentation] Indexing the Bijective BWT2019
Author(s)
Hideo Bannai, Juha Karkkainen, Dominik Koeppl, Marcin Piatkowski
Organizer
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)
Related Report
Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Finding Gapped Palindromes Online2016
Author(s)
Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Organizer
27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
Place of Presentation
ヘルシンキ
Year and Date
2016-08-17 – 2016-08-19
Related Report
Int'l Joint Research
-
-