Analysis of upper and lower bounds on string processing problems via advanced data structures

• Project/Area Number: 17H01697
• 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: INENAGA SHUNSUKE 九州大学, システム情報科学研究院, 准教授 (60448404)
• Co-Investigator(Kenkyū-buntansha): 坂内 英夫 東京医科歯科大学, M&Dデータ科学センター, 教授 (20323644) ; 田部井 靖生 国立研究開発法人理化学研究所, 革新知能統合研究センター, ユニットリーダー (20589824)
• Project Period (FY): 2017-04-01 – 2020-03-31
• Project Status: Completed (Fiscal Year 2021)
• Budget Amount: ¥14,950,000 (Direct Cost: ¥11,500,000、Indirect Cost: ¥3,450,000); Fiscal Year 2019: ¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000); Fiscal Year 2018: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000); Fiscal Year 2017: ¥5,330,000 (Direct Cost: ¥4,100,000、Indirect Cost: ¥1,230,000)
• Keywords: アルゴリズム / データ構造 / 文字列処理 / テキスト圧縮 / 文字列データ処理 / データ圧縮 / アルゴリズム理論 / 文字列組み合わせ論

Outline of Final Research Achievements

The goal of this research project is to study upper and lower bounds on various string processing problems, with the aid of advanced string data structures. Namely, we proposed efficient algorithms that can manipulate large string data, and analyzed theoretical limits of these methods. In particular, the main focus was on the four following topics: (A) text compression and algorithms for compressed text data, (B) string algorithms and data structures, (C) regularities and repetitions in strings, (D) hardness and lower bounds on string processing problems.
All the results of this research project have been published in peer-reviewed conference proceedings and/or in international journals.

Academic Significance and Societal Importance of the Research Achievements

記憶媒体の低価格化やネットワークの高速化を背景として，電子データが爆発的な速度で増加し続けている．そのため，膨大なデータを省領域で格納し，かつ高速に処理を行う情報技術の確立が急務となっている．本研究課題では，電子データの多くは文字列と見なせることに着目し，高度情報処理をサポートする高速・省領域文字列処理アルゴリズムを開発した．特に，近年著しい進展を見せている高度データ構造技術を主体とするアプローチにより，文字列情報処理に関する諸重要問題に対するアルゴリズム開発と，計算量限界 (下界) の解明を行った．

Research Products

• [Int'l Joint Research] University of Warsaw(ポーランド)
• [Int'l Joint Research] Goldsmiths University of London/King’s College London(英国)
• [Int'l Joint Research] Tampere University(フィンランド)
• [Int'l Joint Research] University of Helsinki/University of Tampere(フィンランド)
• [Int'l Joint Research] TU Dortmund/University of Kiel(ドイツ)
• [Int'l Joint Research] University of Warsaw/Nicolaus Copernicus University(ポーランド)
• [Int'l Joint Research] University of Warwick(英国)
• [Int'l Joint Research] Diego Portales University(チリ)
• [Int'l Joint Research]
• [Journal Article] On the size of the smallest alphabet for Lyndon trees (2019)
  • Author(s): Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Theoretical Computer Science Volume: 792 Pages: 131-143
  • DOI: 10.1016/j.tcs.2018.06.044
  • Peer Reviewed
• [Journal Article] Efficient dynamic dictionary matching with DAWGs and AC-automata (2019)
  • Author(s): Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
  • Journal Title: Theoretical Computer Science Volume: 792 Pages: 161-172
  • DOI: 10.1016/j.tcs.2018.04.016
  • Peer Reviewed
• [Journal Article] The parameterized position heap of a trie (2019)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 11th International Conference on Algorithms and Complexity, Lecture Notes in Computer Science Volume: 11485 Pages: 237-248
  • DOI: 10.1007/978-3-030-17402-6_20
  • ISBN: 9783030174019, 9783030174026
  • Peer Reviewed
• [Journal Article] Faster queries for longest substring palindrome after block edit (2019)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, LIPIcs Volume: 128
  • DOI: 10.4230/LIPICS.CPM.2019.27
  • Peer Reviewed / Open Access
• [Journal Article] Overlapping Lempel-Ziv and Lyndon factorizations (2019)
  • Author(s): Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, LIPIcs Volume: 128
  • DOI: 10.4230/LIPICS.CPM.2019.29
  • Peer Reviewed / Open Access
• [Journal Article] Online Algorithms for Constructing Linear-size Suffix Trie (2019)
  • Author(s): Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga
  • Journal Title: Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, Leibniz International Proceedings in Informatics Volume: 128
  • DOI: 10.4230/LIPICS.CPM.2019.30
  • Peer Reviewed / Open Access
• [Journal Article] An Improved Data Structure for Left-Right Maximal Generic Words Problem (2019)
  • Author(s): Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: ISAAC 2019 Volume: -
  • Peer Reviewed / Open Access
• [Journal Article] Palindromic substring queries on run-length encoded strings (2019)
  • Author(s): Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of the 30th International Workshop on Combinatorial Algorithms, Lecture Notes in Computer Science Volume: 11638 Pages: 430-441
  • DOI: 10.1007/978-3-030-25005-8_35
  • ISBN: 9783030250041, 9783030250058
  • Peer Reviewed
• [Journal Article] Compact data structure for shortest unique substring queries (2019)
  • Author(s): Takuya Mieno, Dominik Koeppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 26th International Symposium on String Processing and Information Retrieval, Lecture Notes in Computer Science Volume: 11811 Pages: 107-123
  • DOI: 10.1007/978-3-030-32686-9_8
  • ISBN: 9783030326852, 9783030326869
  • Peer Reviewed
• [Journal Article] On longest common property preserved substring queries (2019)
  • Author(s): Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
  • Journal Title: Proceedings of 26th International Symposium on String Processing and Information Retrieval, Lecture Notes in Computer Science Volume: 11811 Pages: 162-174
  • DOI: 10.1007/978-3-030-32686-9_12
  • ISBN: 9783030326852, 9783030326869
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets (2019)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 26th International Symposium on String Processing and Information Retrieval, Lecture Notes in Computer Science Volume: 11811 Pages: 382-391
  • DOI: 10.1007/978-3-030-32686-9_27
  • ISBN: 9783030326852, 9783030326869
  • Peer Reviewed
• [Journal Article] Computing Maximal Palindromes and Distinct Palindromes in a Trie (2019)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: PSC 2019 Volume: - Pages: 3-15
  • Peer Reviewed / Open Access
• [Journal Article] k-Abelian Pattern Matching: Revisited, Corrected, and Extended (2019)
  • Author(s): Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto
  • Journal Title: PSC 2019 Volume: - Pages: 29-40
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Faster STR-EC-LCS computation (2019)
  • Author(s): Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 46th International Conference on Current Trends in Theory and Practice of Informatics, Lecture Notes in Computer Science Volume: 12011 Pages: 125-135
  • DOI: 10.1007/978-3-030-38919-2_11
  • ISBN: 9783030389185, 9783030389192
  • Peer Reviewed
• [Journal Article] MR-RePair: Grammar Compression based on Maximal Repeats (2019)
  • Author(s): Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Takuya Kida
  • Journal Title: Proc. Data Compression Conference 2019 (DCC 2019) Volume: -
  • Peer Reviewed
• [Journal Article] Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays (2018)
  • Author(s): Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 25th International Symposium on String Processing and Information Retrieval 2018, Lecture Notes in Computer Science Volume: 11147 Pages: 254-267
  • DOI: 10.1007/978-3-030-00479-8_21
  • ISBN: 9783030004781, 9783030004798
  • Peer Reviewed
• [Journal Article] Block Palindromes: A New Generalization of Palindromes (2018)
  • Author(s): Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
  • Journal Title: SPIRE 2018 Volume: - Pages: 183-190
  • DOI: 10.1007/978-3-030-00479-8_15
  • ISBN: 9783030004781, 9783030004798
  • Peer Reviewed
• [Journal Article] Lyndon Factorization of Grammar Compressed Texts Revisited (2018)
  • Author(s): Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of Annual Symposium on Combinatorial Pattern Matching 2018, LIPIcs Volume: 105
  • DOI: 10.4230/LIPIcs.CPM.2018.24
  • Peer Reviewed / Open Access
• [Journal Article] Longest Lyndon Substring After Edit (2018)
  • Author(s): Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of Annual Symposium on Combinatorial Pattern Matching 2018, LIPIcs Volume: 105
  • DOI: 10.4230/LIPIcs.CPM.2018.19
  • Peer Reviewed / Open Access
• [Journal Article] Computing longest common square subsequences (2018)
  • Author(s): Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyro, Hideo Bannai, Masayuki Takeda
  • Journal Title: CPM 2018 Volume: -
  • DOI: 10.4230/LIPIcs.CPM.2018.15
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Longest substring palindrome after edit (2018)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of Annual Symposium on Combinatorial Pattern Matching 2018, LIPIcs Volume: 105
  • DOI: 10.4230/LIPIcs.CPM.2018.12
  • Peer Reviewed / Open Access
• [Journal Article] Faster Online Elastic Degenerate String Matching (2018)
  • Author(s): Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of Annual Symposium on Combinatorial Pattern Matching 2018, LIPIcs Volume: 105
  • DOI: 10.4230/LIPIcs.CPM.2018.9
  • Peer Reviewed / Open Access
• [Journal Article] O(n log n)-time Text Compression by LZ-style Longest First Substitution (2018)
  • Author(s): Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Journal Title: Proc. Prague Stringology Conference 2018 Volume: - Pages: 12-26
  • Peer Reviewed / Open Access
• [Journal Article] Right-to-left Online Construction of Parameterized Position Heaps (2018)
  • Author(s): oriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Journal Title: Proc. Prague Stringology Conference 2018 Volume: - Pages: 91-102
  • Peer Reviewed / Open Access
• [Journal Article] Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions (2018)
  • Author(s): Hyyro Heikki, Inenaga Shunsuke
  • Journal Title: International Journal of Foundations of Computer Science Volume: 29 Issue: 04 Pages: 623-645
  • DOI: 10.1142/s0129054118410083
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets (2018)
  • Author(s): Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Koppl, Florin Manea
  • Journal Title: Theory Comput. Syst. Volume: 62(1) Issue: 1 Pages: 162-191
  • DOI: 10.1007/s00224-017-9794-5
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] A hardness result and new algorithm for the longest common palindromic subsequence problem (2018)
  • Author(s): Shunsuke Inenaga, Heikki Hyyr_
  • Journal Title: Inf. Process. Lett. Volume: 129 Pages: 11-15
  • DOI: 10.1016/j.ipl.2017.08.006
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Diverse Palindromic Factorization is NP-Complete (2018)
  • Author(s): Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha K_rkk_inen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto
  • Journal Title: Int. J. Found. Comput. Sci. Volume: 29(2) Issue: 02 Pages: 143-164
  • DOI: 10.1142/s0129054118400014
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Shortest Unique Palindromic Substring Queries in Optimal Time (2018)
  • Author(s): Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Journal Title: Proc. 28th International Workshop on Combinatorial Algorithms (IWOCA 2017) Volume: LNCS10765
  • Peer Reviewed
• [Journal Article] Computing Abelian string regularities based on RLE (2018)
  • Author(s): Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Journal Title: 28th International Workshop on Combinatorial Algorithms (IWOCA 2017) Volume: LNCS10765
  • Peer Reviewed
• [Journal Article] Inferring strings from Lyndon factorization (2017)
  • Author(s): Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Theor. Comput. Sci. Volume: 689 Pages: 147-156
  • DOI: 10.1016/j.tcs.2017.05.038
  • Peer Reviewed / Open Access
• [Journal Article] Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (2017)
  • Author(s): Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura
  • Journal Title: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Volume: E100.A Issue: 9 Pages: 1785-1793
  • DOI: 10.1587/transfun.E100.A.1785
  • NAID: 130006038281
  • ISSN: 0916-8508, 1745-1337
  • Peer Reviewed
• [Journal Article] The "Runs" Theorem (2017)
  • Author(s): Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
  • Journal Title: SIAM J. Comput. Volume: 46(5) Issue: 5 Pages: 1501-1514
  • DOI: 10.1137/15m1011032
  • Peer Reviewed
• [Journal Article] Faster STR-IC-LCS Computation via RLE (2017)
  • 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), LIPICS Volume: 78
  • DOI: 10.4230/LIPIcs.CPM.2017.20
  • Peer Reviewed / Open Access
• [Journal Article] Computing All Distinct Squares in Linear Time for Integer Alphabets (2017)
  • Author(s): Hideo Bannai, Shunsuke Inenaga, Dominik K_ppl
  • Journal Title: Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), LIPICS Volume: 78
  • DOI: 10.4230/LIPIcs.CPM.2017.22
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Tight Bounds on the Maximum Number of Shortest Unique Substrings (2017)
  • Author(s): Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), LIPICS Volume: 78
  • DOI: 10.4230/LIPIcs.CPM.2017.24
  • Peer Reviewed / Open Access
• [Journal Article] On Reverse Engineering the Lyndon Tree (2017)
  • Author(s): Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Journal Title: Proc. Prague Stringology Conference 2017 (PSC 2017) Volume: - Pages: 108-117
  • Peer Reviewed / Open Access
• [Journal Article] Small-space LCE data structure with constant-time queries (2017)
  • Author(s): Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda
  • Journal Title: Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) Volume: -
  • Peer Reviewed / Open Access
• [Journal Article] On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (2017)
  • Author(s): Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi
  • Journal Title: Proceedings of the 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), Lecture Notes in Computer Science Volume: 10508 Pages: 51-67
  • DOI: 10.1007/978-3-319-67428-5_5
  • ISBN: 9783319674278, 9783319674285
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression (2017)
  • Author(s): Takagi Takuya、Goto Keisuke、Fujishige Yuta、Inenaga Shunsuke、Arimura Hiroki
  • Journal Title: Proceedings of the 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)（査読付き国際会議論文） Volume: - Pages: 304-316
  • DOI: 10.1007/978-3-319-67428-5_26
  • ISBN: 9783319674278, 9783319674285
  • Peer Reviewed
• [Journal Article] Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings (2017)
  • Author(s): Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), LIPICS Volume: 92
  • DOI: 10.4230/LIPIcs.ISAAC.2017.33
  • Peer Reviewed / Open Access
• [Presentation] パラメタ化パターン照合のための索引グラフ構造 (2020)
  • Author(s): 中島 克仁, 藤里 法輝, ディプタラマ ヘンリアン, 中島 祐人, 吉仲 亮 , 稲永 俊介, 坂内 英夫, 篠原 歩, 竹田 正幸
  • Organizer: 2019年度 冬のLAシンポジウム
• [Presentation] 畳み込み和ならびにビット並列を用いた縦読みパターン照合 (2020)
  • Author(s): 舩越 満, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸
  • Organizer: 2019年度 冬のLAシンポジウム
• [Presentation] 複数テキスト索引構造のオンライン構築 (2020)
  • Author(s): 高木 拓也, 稲永 俊, 有村 博紀, Dany Breslauer, Diptarama Hendrian
  • Organizer: 2019年度 冬のLAシンポジウム
• [Presentation] Faster STR-EC-LCS Computation (2020)
  • Author(s): Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: SOFSEM 2020
  • Int'l Joint Research
• [Presentation] The Parameterized Position Heap of a Trie (2019)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: CIAC 2019
  • Int'l Joint Research
• [Presentation] Faster Queries for Longest Substring Palindrome After Block Edit (2019)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: CPM 2019
  • Int'l Joint Research
• [Presentation] On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations (2019)
  • Author(s): Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: CPM 2019
  • Int'l Joint Research
• [Presentation] Online Algorithms for Constructing Linear-Size Suffix Trie (2019)
  • Author(s): Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga
  • Organizer: CPM 2019
  • Int'l Joint Research
• [Presentation] An Improved Data Structure for Left-Right Maximal Generic Words Problem (2019)
  • Author(s): Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: ISAAC 2019
  • Int'l Joint Research
• [Presentation] Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings (2019)
  • Author(s): Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: IWOCA 2019
  • Int'l Joint Research
• [Presentation] Compact Data Structures for Shortest Unique Substring Queries (2019)
  • Author(s): Takuya Mieno, Dominik Koeppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: SPIRE 2019
  • Int'l Joint Research
• [Presentation] On Longest Common Property Preserved Substring Queries (2019)
  • Author(s): Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
  • Organizer: SPIRE 2019
  • Int'l Joint Research
• [Presentation] Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets (2019)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: SPIRE 2019
  • Int'l Joint Research
• [Presentation] Computing Maximal Palindromes and Distinct Palindromes in a Trie (2019)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: PCS 2019
  • Int'l Joint Research
• [Presentation] k-Abelian Pattern Matching: Revisited, Corrected, and Extended (2019)
  • Author(s): Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto
  • Organizer: PCS 2019
  • Int'l Joint Research
• [Presentation] 高速な STR-EC-LCS アルゴリズム (2019)
  • Author(s): 山田 航平，中島 祐人，稲永 俊介，坂内 英夫，竹田 正幸
  • Organizer: 第174回アルゴリズム研究会
• [Presentation] MR-RePair: Grammar Compression based on Maximal Repeats (2019)
  • Author(s): Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Takuya Kida
  • Organizer: Data Compression Conference 2019 (DCC 2019)
  • Int'l Joint Research
• [Presentation] Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays (2018)
  • Author(s): Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
  • Organizer: 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018)
  • Int'l Joint Research
• [Presentation] Block Palindromes: A New Generalization of Palindromes (2018)
  • Author(s): Keisuke Goto, Tomohiro I, Hideo Bannai and Shunsuke Inenaga
  • Organizer: 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018)
  • Int'l Joint Research
• [Presentation] Lyndon Factorization of Grammar Compressed Texts Revisited (2018)
  • Author(s): Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
  • Int'l Joint Research
• [Presentation] Longest Lyndon Substring After Edit (2018)
  • Author(s): Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
  • Organizer: 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
  • Int'l Joint Research
• [Presentation] Computing longest common square subsequences (2018)
  • Author(s): Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyro, Hideo Bannai, and Masayuki Takeda
  • Organizer: 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
  • Int'l Joint Research
• [Presentation] Longest substring palindrome after edit (2018)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
  • Organizer: 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
  • Int'l Joint Research
• [Presentation] Faster Online Elastic Degenerate String Matching (2018)
  • Author(s): Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
  • Int'l Joint Research
• [Presentation] O(n log n)-time Text Compression by LZ-style Longest First Substitution (2018)
  • Author(s): Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: Prague Stringology Conference 2018 (PSC 2018)
  • Int'l Joint Research
• [Presentation] Right-to-left Online Construction of Parameterized Position Heaps (2018)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: Prague Stringology Conference 2018 (PSC 2018)
  • Int'l Joint Research
• [Presentation] Faster STR-IC-LCS computation via RLE (2017)
  • Author(s): Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
  • Int'l Joint Research
• [Presentation] Computing All Distinct Squares in Linear Time for Integer Alphabets (2017)
  • Author(s): Hideo Bannai, Shunsuke Inenaga, and Dominik Koeppl
  • Organizer: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
  • Int'l Joint Research
• [Presentation] Tight bounds on the maximum number of shortest unique substrings (2017)
  • Author(s): Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)
  • Int'l Joint Research
• [Presentation] Computing Abelian string regularities based on RLE (2017)
  • Author(s): Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: 28th International Workshop on Combinatorial Algorithms (IWOCA 2017)
  • Int'l Joint Research
• [Presentation] Shortest Unique Palindromic Substring Queries in Optimal Time (2017)
  • Author(s): Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: 28th International Workshop on Combinatorial Algorithms (IWOCA 2017)
  • Int'l Joint Research
• [Presentation] On Reverse Engineering the Lyndon Tree (2017)
  • Author(s): Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: Prague Stringology Conference 2017 (PSC 2017)
  • Int'l Joint Research
• [Presentation] Small-space LCE data structure with constant-time queries (2017)
  • Author(s): Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda
  • Organizer: 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)
  • Int'l Joint Research
• [Presentation] On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (2017)
  • Author(s): Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov and Simon Puglisi
  • Organizer: 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)
  • Int'l Joint Research
• [Presentation] Order preserving pattern matching on trees and DAGs (2017)
  • Author(s): Tenma Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
  • Organizer: 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)
  • Int'l Joint Research
• [Presentation] Linear-size CDAWG: new repetition-aware indexing and grammar compression (2017)
  • Author(s): Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga and Hiroki Arimura
  • Organizer: 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)
  • Int'l Joint Research
• [Presentation] Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings (2017)
  • Author(s): Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
  • Organizer: 8th International Symposium on Algorithms and Computation (ISAAC 2017)
  • Int'l Joint Research
• [Book] Proc. 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018) (2018)
  • Author(s): Travis Gagie, Alistair Moffat, Gonzalo Navarro, Ernesto Cuadros-Vargas
  • Total Pages: 364
  • Publisher: Springer
  • ISBN: 9783030004781
• [Remarks] 個人研究ページ
  • URL: https://str.i.kyushu-u.ac.jp/~inenaga/index-j.html
• [Remarks] 研究者情報（九州大学）
  • URL: http://hyoka.ofc.kyushu-u.ac.jp/search/details/K003385/index.html