Simple and fast string algorithms by Lyndon words

• Project/Area Number: 18K18002
• Research Category: Grant-in-Aid for Early-Career Scientists
• Allocation Type: Multi-year Fund
• Review Section: Basic Section 60010:Theory of informatics-related
• Research Institution: Kyushu University
• Principal Investigator: Nakashima Yuto 九州大学, システム情報科学研究院, 助教 (80804682)
• Project Period (FY): 2018-04-01 – 2022-03-31
• Project Status: Completed (Fiscal Year 2021)
• Budget Amount: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000); Fiscal Year 2020: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000); Fiscal Year 2019: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2018: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
• Keywords: 文字列アルゴリズム / 文字列組合せ論 / Lyndon文字列 / Lyndon 文字列 / 文字列処理アルゴリズム

Outline of Final Research Achievements

This project aims to develop simple and fast string processing algorithms based on the properties of Lyndon words.
To achieve this goal, we have tackled various problems on string processing algorithms and combinatorics on words, such as Lyndon words, repetitive structures, and palindromes.
We showed various combinatorial properties on strings and proposed efficient string algorithms using the properties.

Academic Significance and Societal Importance of the Research Achievements

本研究は，文字列処理アルゴリズムおよび文字列組合せ論に関する基礎理論である．本研究で着目したLyndon文字列は，1950年代頃から数学的な観点から研究されているが，本研究のようにアルゴリズムへの応用の観点からの研究は発展途上であると考えられる．本研究成果で得られたLyndon文字列の性質やアルゴリズムは，当該分野の今後の研究において利用されると期待される．

Research Products

• [Journal Article] Palindromic trees for a sliding window and its applications (2022)
  • Author(s): Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Information Processing Letters Volume: 173 Pages: 106174-106174
  • DOI: 10.1016/j.ipl.2021.106174
  • Peer Reviewed / Open Access
• [Journal Article] Compressed Communication Complexity of Hamming Distance (2021)
  • Author(s): Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Algorithms Volume: 14 Issue: 4 Pages: 116-116
  • DOI: 10.3390/a14040116
  • Peer Reviewed / Open Access
• [Journal Article] c-trie++: A dynamic trie tailored for fast prefix searches (2021)
  • Author(s): Kazuya Tsuruta, Dominik Koeppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Information and Computation Volume: - Pages: 104794-104794
  • DOI: 10.1016/j.ic.2021.104794
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] Efficiently computing runs on a trie (2021)
  • Author(s): Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Theoretical Computer Science Volume: 887 Pages: 143-151
  • DOI: 10.1016/j.tcs.2021.07.011
  • Peer Reviewed / Open Access
• [Journal Article] Computing Minimal Unique Substrings for a Sliding Window (2021)
  • Author(s): Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Algorithmica Volume: 84 Issue: 3 Pages: 670-693
  • DOI: 10.1007/s00453-021-00864-1
  • Peer Reviewed / Open Access
• [Journal Article] Counting Lyndon Subsequence (2021)
  • Author(s): Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
  • Journal Title: Proceedings of the Prague Stringology Conference 2021 Volume: - Pages: 53-60
  • Peer Reviewed / Open Access
• [Journal Article] Position Heaps for Cartesian-Tree Matching on Strings and Tries (2021)
  • Author(s): Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
  • Journal Title: Proceedings of 28th International Symposium on String Processing and Information Retrieval Volume: 12944 Pages: 241-254
  • DOI: 10.1007/978-3-030-86692-1_20
  • ISBN: 9783030866914, 9783030866921
  • Peer Reviewed
• [Journal Article] On the Approximation Ratio of LZ-End to LZ77 (2021)
  • Author(s): Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
  • Journal Title: Proceedings of 28th International Symposium on String Processing and Information Retrieval Volume: 12944 Pages: 114-126
  • DOI: 10.1007/978-3-030-86692-1_10
  • ISBN: 9783030866914, 9783030866921
  • Peer Reviewed
• [Journal Article] Grammar Index by Induced Suffix Sorting (2021)
  • Author(s): Tooru Akagi, Dominik Koeppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 28th International Symposium on String Processing and Information Retrieval Volume: 12944 Pages: 85-99
  • DOI: 10.1007/978-3-030-86692-1_8
  • ISBN: 9783030866914, 9783030866921
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Longest Common Rollercoasters (2021)
  • Author(s): Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 28th International Symposium on String Processing and Information Retrieval Volume: 12944 Pages: 21-32
  • DOI: 10.1007/978-3-030-86692-1_3
  • ISBN: 9783030866914, 9783030866921
  • Peer Reviewed
• [Journal Article] The Parameterized Suffix Tray (2021)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 12th International Conference on Algorithms and Complexity Volume: 12701 Pages: 258-270
  • DOI: 10.1007/978-3-030-75242-2_18
  • ISBN: 9783030752415, 9783030752422
  • Peer Reviewed
• [Journal Article] Computing longest palindromic substring after single-character or block-wise edits (2021)
  • Author(s): Funakoshi Mitsuru, Nakashima Yuto, Inenaga Shunsuke, Bannai Hideo, Takeda Masayuki
  • Journal Title: Theoretical Computer Science Volume: 859 Pages: 116-133
  • DOI: 10.1016/j.tcs.2021.01.014
  • Peer Reviewed
• [Journal Article] Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings (2020)
  • Author(s): Watanabe Kiichi, Nakashima Yuto, Inenaga Shunsuke, Bannai Hideo, Takeda Masayuki
  • Journal Title: Theory of Computing Systems Volume: 64 Issue: 7 Pages: 1273-1291
  • DOI: 10.1007/s00224-020-09980-x
  • Peer Reviewed
• [Journal Article] Space-efficient algorithms for computing minimal/shortest unique substrings (2020)
  • Author(s): Mieno Takuya, Koppl Dominik, Nakashima Yuto, Inenaga Shunsuke, Bannai Hideo, Takeda Masayuki
  • Journal Title: Theoretical Computer Science Volume: 845 Pages: 230-242
  • DOI: 10.1016/j.tcs.2020.09.017
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] Grammar-compressed Self-index with Lyndon Words (2020)
  • Author(s): Kazuya Tsuruta, Dominik Koppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: IPSJ Transactions on Mathematical Modeling and Its Applications Volume: 13 Pages: 84-92
  • Peer Reviewed
• [Journal Article] c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches (2020)
  • Author(s): Tsuruta Kazuya, Koppl Dominik, Kanda Shunsuke, Nakashima Yuto, Inenaga Shunsuke, Bannai Hideo, Takeda Masayuki
  • Journal Title: Proceedings of Data Compression Conference 2020 Volume: 1 Pages: 243-252
  • DOI: 10.1109/dcc47342.2020.00032
  • Peer Reviewed / Int'l Joint Research
• [Journal Article] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures (2020)
  • Author(s): Katsuhito Nakashima, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
  • Journal Title: Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching Volume: 161
  • Peer Reviewed
• [Journal Article] Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences (2020)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
  • Journal Title: Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching Volume: 161
  • Peer Reviewed
• [Journal Article] Towards Efficient Interactive Computation of Dynamic Time Warping Distance (2020)
  • Author(s): Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 27th International Symposium on String Processing and Information Retrieval Volume: 12303 Pages: 27-41
  • DOI: 10.1007/978-3-030-59212-7_3
  • ISBN: 9783030592110, 9783030592127
  • Peer Reviewed
• [Journal Article] Lyndon Words, the Three Squares Lemma, and Primitive Squares (2020)
  • Author(s): Hideo Bannai, Takuya Mieno, Yuto Nakashima
  • Journal Title: Proceedings of 27th International Symposium on String Processing and Information Retrieval Volume: 12303 Pages: 265-273
  • DOI: 10.1007/978-3-030-59212-7_19
  • ISBN: 9783030592110, 9783030592127
  • Peer Reviewed
• [Journal Article] On repetitiveness measures of Thue-Morse words (2020)
  • Author(s): Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of 27th International Symposium on String Processing and Information Retrieval Volume: 12303 Pages: 213-220
  • DOI: 10.1007/978-3-030-59212-7_15
  • ISBN: 9783030592110, 9783030592127
  • Peer Reviewed
• [Journal Article] Compaction of Church Numerals (2019)
  • Author(s): Isamu Furuya, Takuya Kida
  • Journal Title: Algorithms Volume: 12(8) Issue: 4 Pages: 159-159
  • DOI: 10.3390/a13040103
  • Peer Reviewed / Open Access / Int'l Joint Research
• [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] Computing runs on a trie (2019)
  • Author(s): Ryo Sugahara, 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.23
  • 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] Computing maximal palindromes and distinct palindromes in a trie (2019)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of the Prague Stringology Conference 2019 Volume: - Pages: 3-15
  • Peer Reviewed / Open Access
• [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] 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] 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] 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: Proceedings of the 30th International Symposium on Algorithms and Computation, LIPIcs Volume: 149
  • Peer Reviewed / Open Access
• [Journal Article] Minimal unique substrings and minimal absent words in a sliding window (2019)
  • Author(s): Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, 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: 148-160
  • DOI: 10.1007/978-3-030-38919-2_13
  • ISBN: 9783030389185, 9783030389192
  • Peer Reviewed
• [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] 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] MR-RePair: Grammar Compression based on Maximal Repeats (2019)
  • Author(s): Isamu Furuya, Takuya Takagi, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
  • Journal Title: Proceedings of Data Compression Conference 2019 Volume: -
  • Peer Reviewed
• [Journal Article] Algorithms and combinatorial properties on shortest unique palindromic substrings (2018)
  • Author(s): Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Journal of Discrete Algorithms Volume: 52-53 Pages: 122-132
  • DOI: 10.1016/j.jda.2018.11.009
  • 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] 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] 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] O(n log n)-time text compression by LZ-style longest first substitution (2018)
  • Author(s): Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of the Prague Stringology Conference 2018 Volume: -
  • Peer Reviewed / Open Access
• [Journal Article] Right-to-left online construction of parameterized position heaps (2018)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: Proceedings of the Prague Stringology Conference 2018 Volume: -
  • Peer Reviewed / Open Access
• [Presentation] 文法圧縮索引構造 GCIS-index (2022)
  • Author(s): 赤木 亨, ドミニク クップル, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸
  • Organizer: 2021年度 冬のLAシンポジウム
• [Presentation] LZEnd vs LZ77 (2022)
  • Author(s): 井手上 卓弥, 三重野 琢也, 舩越 満, 中島 祐人, 稲永 俊介, 竹田 正幸
  • Organizer: 2021年度 冬のLAシンポジウム
• [Presentation] Counting Lyndon Subsequence (2021)
  • Author(s): Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
  • Organizer: Prague Stringology Conference 2021
  • Int'l Joint Research
• [Presentation] Position Heaps for Cartesian-Tree Matching on Strings and Tries (2021)
  • Author(s): Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
  • Organizer: 28th International Symposium on String Processing and Information Retrieval
  • Int'l Joint Research
• [Presentation] On the Approximation Ratio of LZ-End to LZ77 (2021)
  • Author(s): Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
  • Organizer: 28th International Symposium on String Processing and Information Retrieval
  • Int'l Joint Research
• [Presentation] Grammar Index by Induced Suffix Sorting (2021)
  • Author(s): Tooru Akagi, Dominik Koeppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 28th International Symposium on String Processing and Information Retrieval
  • Int'l Joint Research
• [Presentation] Longest Common Rollercoasters (2021)
  • Author(s): Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 28th International Symposium on String Processing and Information Retrieval
  • Int'l Joint Research
• [Presentation] The Parameterized Suffix Tray (2021)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 12th International Conference on Algorithms and Complexity
  • Int'l Joint Research
• [Presentation] c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches (2020)
  • Author(s): Kazuya Tsuruta, Dominik Koppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: Data Compression Conference 2020
  • Int'l Joint Research
• [Presentation] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures (2020)
  • Author(s): Katsuhito Nakashima, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
  • Organizer: The 31st Annual Symposium on Combinatorial Pattern Matching
  • Int'l Joint Research
• [Presentation] Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences (2020)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
  • Organizer: The 31st Annual Symposium on Combinatorial Pattern Matching
  • Int'l Joint Research
• [Presentation] Towards Efficient Interactive Computation of Dynamic Time Warping Distance (2020)
  • Author(s): Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: The 27th International Symposium on String Processing and Information Retrieval
  • Int'l Joint Research
• [Presentation] Lyndon Words, the Three Squares Lemma, and Primitive Squares (2020)
  • Author(s): Hideo Bannai, Takuya Mieno, Yuto Nakashima
  • Organizer: The 27th International Symposium on String Processing and Information Retrieval
  • Int'l Joint Research
• [Presentation] On repetitiveness measures of Thue-Morse words (2020)
  • Author(s): Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: The 27th International Symposium on String Processing and Information Retrieval
  • Int'l Joint Research
• [Presentation] Minimal unique substrings and minimal absent words in a sliding window (2020)
  • Author(s): Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 46th International Conference on Current Trends in Theory and Practice of Informatics
• [Presentation] Faster STR-EC-LCS computation (2020)
  • Author(s): Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 46th International Conference on Current Trends in Theory and Practice of Informatics
• [Presentation] The parameterized position heap of a trie (2019)
  • Author(s): Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 11th International Conference on Algorithms and Complexity
• [Presentation] Faster queries for longest substring palindrome after block edit (2019)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 30th Annual Symposium on Combinatorial Pattern Matching
• [Presentation] Overlapping Lempel-Ziv and Lyndon factorizations (2019)
  • Author(s): Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 30th Annual Symposium on Combinatorial Pattern Matching
• [Presentation] Computing runs on a trie (2019)
  • Author(s): Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 30th Annual Symposium on Combinatorial Pattern Matching
• [Presentation] Palindromic substring queries on run-length encoded strings (2019)
  • Author(s): Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 30th International Workshop on Combinatorial Algorithms
• [Presentation] Computing maximal palindromes and distinct palindromes in a trie (2019)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: Prague Stringology Conference 2019
• [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: 26th International Symposium on String Processing and Information Retrieval
• [Presentation] On longest common property preserved substring queries (2019)
  • Author(s): Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
  • Organizer: 26th International Symposium on String Processing and Information Retrieval
• [Presentation] Compact data structure for shortest unique substring queries (2019)
  • Author(s): Takuya Mieno, Dominik Koeppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: 26th International Symposium on String Processing and Information Retrieval
• [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: 30th International Symposium on Algorithms and Computation
• [Presentation] MR-RePair: Grammar Compression based on Maximal Repeats (2019)
  • Author(s): Isamu Furuya, Takuya Takagi, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
  • Organizer: Data Compression Conference 2019
  • 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, Masayuki Takeda
  • Organizer: Annual Symposium on Combinatorial Pattern Matching 2018
  • Int'l Joint Research
• [Presentation] Longest Lyndon Substring After Edit (2018)
  • Author(s): Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: Annual Symposium on Combinatorial Pattern Matching 2018
  • Int'l Joint Research
• [Presentation] Longest substring palindrome after edit (2018)
  • Author(s): Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: Annual Symposium on Combinatorial Pattern Matching 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, Masayuki Takeda
  • Organizer: Annual Symposium on Combinatorial Pattern Matching 2018
  • 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, Masayuki Takeda
  • Organizer: 25th International Symposium on String Processing and Information Retrieval 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, Masayuki Takeda
  • Organizer: Prague Stringology Conference 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, Masayuki Takeda
  • Organizer: Prague Stringology Conference 2018
  • Int'l Joint Research