• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Nakashima Yuto  中島 祐人

ORCIDConnect your ORCID iD *help
Researcher Number 80804682
Other IDs
Affiliation (Current) 2022: 九州大学, システム情報科学研究院, 助教
Affiliation (based on the past Project Information) *help 2017 – 2022: 九州大学, システム情報科学研究院, 助教
Review Section/Research Field
Principal Investigator
Basic Section 60010:Theory of informatics-related / Theory of informatics
Except Principal Investigator
Theory of informatics / Medium-sized Section 60:Information science, computer engineering, and related fields / Basic Section 60010:Theory of informatics-related
Keywords
Principal Investigator
文字列処理アルゴリズム / Lyndon文字列 / 文字列アルゴリズム / 文字列組合せ論 / ストリーミングモデル / アルゴリズム / 文字列情報学 / Lyndon 文字列 / 文字列圧縮
Except Principal Investigator
圧縮データ構造 … More / 簡潔データ構造 / 情報爆縮 / 圧縮データ処理 / アルゴリズム / データ圧縮 / 文字列パターン照合 / 文字列パターン発見 / 文字列データ解析 / 文字列アルゴリズム / 大規模データ圧縮 / IoTデータ処理 / 文字列処理 / データ構造 Less
  • Research Projects

    (6 results)
  • Research Products

    (120 results)
  • Co-Researchers

    (13 People)
  •  広義文字列のアルゴリズムと組合せ論

    • Principal Investigator
      稲永 俊介
    • Project Period (FY)
      2022 – 2025
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Kyushu University
  •  Lyndon文字列による反復性指標解析Principal Investigator

    • Principal Investigator
      中島 祐人
    • Project Period (FY)
      2021 – 2024
    • Research Category
      Grant-in-Aid for Early-Career Scientists
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Kyushu University
  •  Simple and fast string algorithms by Lyndon wordsPrincipal Investigator

    • Principal Investigator
      Nakashima Yuto
    • Project Period (FY)
      2018 – 2021
    • Research Category
      Grant-in-Aid for Early-Career Scientists
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Kyushu University
  •  情報爆縮に基づくIoTデータ処理基盤の構築

    • Principal Investigator
      竹田 正幸
    • Project Period (FY)
      2018 – 2022
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Review Section
      Medium-sized Section 60:Information science, computer engineering, and related fields
    • Research Institution
      Kyushu University
  •  ストリーミングモデルにおける文字列処理アルゴリズム基盤Principal Investigator

    • Principal Investigator
      中島 祐人
    • Project Period (FY)
      2017 – 2018
    • Research Category
      Grant-in-Aid for Research Activity Start-up
    • Research Field
      Theory of informatics
    • Research Institution
      Kyushu University
  •  Information Implosion Foundational Technology

    • Principal Investigator
      Takeda Masayuki
    • Project Period (FY)
      2013 – 2017
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyushu University

All 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013

All Journal Article Presentation

  • [Journal Article] Palindromic trees for a sliding window and its applications2022

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-20J11983
  • [Journal Article] c-trie++: A dynamic trie tailored for fast prefix searches2021

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-21K17701
  • [Journal Article] Efficiently computing runs on a trie2021

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141
  • [Journal Article] On the Approximation Ratio of LZ-End to LZ772021

    • 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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-21K17705
  • [Journal Article] The Parameterized Suffix Tray2021

    • Author(s)
      Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proceedings of the 12th International Conference on Algorithms and Complexity

      Volume: 12701 Pages: 258-270

    • DOI

      10.1007/978-3-030-75242-2_18

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141
  • [Journal Article] Longest Common Rollercoasters2021

    • Author(s)
      Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proceedings of the 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)

      Volume: 12944 Pages: 21-32

    • DOI

      10.1007/978-3-030-86692-1_3

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-21K17705
  • [Journal Article] Computing Minimal Unique Substrings for a Sliding Window2021

    • Author(s)
      Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Algorithmica

      Volume: 84 Pages: 670-693

    • DOI

      10.1007/s00453-021-00864-1

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-20J11983
  • [Journal Article] Position Heaps for Cartesian-Tree Matching on Strings and Tries2021

    • 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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-21K17705
  • [Journal Article] Grammar Index by Induced Suffix Sorting2021

    • Author(s)
      Tooru Akagi, Dominik Koeppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proc. SPIRE

      Volume: 12944 Pages: 85-99

    • DOI

      10.1007/978-3-030-86692-1_8

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-21K17701, KAKENHI-PROJECT-21K17705
  • [Journal Article] Counting Lyndon Subsequence2021

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] Compressed Communication Complexity of Hamming Distance2021

    • Author(s)
      Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Algorithms

      Volume: 14

    • DOI

      10.3390/a14040116

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] Computing longest palindromic substring after single-character or block-wise edits2021

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-20J21147
  • [Journal Article] Counting Lyndon Subsequence2021

    • 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
    • Data Source
      KAKENHI-PROJECT-21K17705
  • [Journal Article] Grammar-compressed Self-index with Lyndon Words2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] On Repetitiveness Measures of Thue-Morse Words2020

    • Author(s)
      Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      SPIRE 2020

      Volume: 12303 Pages: 213-220

    • DOI

      10.1007/978-3-030-59212-7_15

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-18H04098
  • [Journal Article] Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings2020

    • Author(s)
      Watanabe Kiichi, Nakashima Yuto, Inenaga Shunsuke, Bannai Hideo, Takeda Masayuki
    • Journal Title

      Theory of Computing Systems

      Volume: 64 Pages: 1273-1291

    • DOI

      10.1007/s00224-020-09980-x

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-18H04098
  • [Journal Article] Practical Grammar Compression Based on Maximal Repeats2020

    • Author(s)
      Isamu Furuya, Takuya Kida
    • Journal Title

      Algorithms

      Volume: 12(8) Pages: 103-103

    • DOI

      10.3390/a13040103

    • Peer Reviewed / Open Access / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16H01743, KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-20J14475, KAKENHI-PROJECT-18K11149, KAKENHI-PROJECT-18H04098
  • [Journal Article] Minimal Unique Substrings and Minimal Absent Words in a Sliding Window2020

    • Author(s)
      Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      SOFSEM 2020

      Volume: 12011 Pages: 148-160

    • DOI

      10.1007/978-3-030-38919-2_13

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-18H04098
  • [Journal Article] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures2020

    • Author(s)
      K. Nakashima, N. Fujisato, D. Hendrian, Y. Nakashima, R. Yoshinaka, S. Inenaga, H. Bannai, A. Shinohara, M. Takeda
    • Journal Title

      CPM 2020

      Volume: X

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Journal Article] Faster STR-EC-LCS Computation2020

    • Author(s)
      Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      SOFSEM 2020

      Volume: 12011 Pages: 125-135

    • DOI

      10.1007/978-3-030-38919-2_11

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-17H01697
  • [Journal Article] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] Lyndon Words, the Three Squares Lemma, and Primitive Squares2020

    • Author(s)
      Hideo Bannai, Takuya Mieno, Yuto Nakashima
    • Journal Title

      SPIRE 2020

      Volume: 12303 Pages: 265-273

    • DOI

      10.1007/978-3-030-59212-7_19

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-18H04098
  • [Journal Article] Towards Efficient Interactive Computation of Dynamic Time Warping Distance2020

    • Author(s)
      Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      SPIRE 2020

      Volume: 12303 Pages: 27-41

    • DOI

      10.1007/978-3-030-59212-7_3

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-18H04098
  • [Journal Article] c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches2020

    • Author(s)
      Tsuruta Kazuya, Koppl Dominik, Kanda Shunsuke, Nakashima Yuto, Inenaga Shunsuke, Bannai Hideo, Takeda Masayuki
    • Journal Title

      Proc. DCC

      Volume: 1 Pages: 243-252

    • DOI

      10.1109/dcc47342.2020.00032

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-18F18120
  • [Journal Article] Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences2020

    • Author(s)
      M. Funakoshi, Y. Nakashima, S. Inenaga, H. Bannai, M. Takeda, A. Shinohara
    • Journal Title

      CPM 2020

      Volume: X

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Journal Article] Space-efficient algorithms for computing minimal/shortest unique substrings2020

    • Author(s)
      Mieno Takuya, Koppl Dominik, Nakashima Yuto, Inenaga Shunsuke, Bannai Hideo, Takeda Masayuki
    • Journal Title

      Theor. Comput. Sci.

      Volume: 845 Pages: 230-242

    • DOI

      10.1016/j.tcs.2020.09.017

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-20H04141, KAKENHI-PROJECT-18F18120, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-20J11983
  • [Journal Article] Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] The Parameterized Position Heap of a Trie2019

    • Author(s)
      Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      CIAC 2019

      Volume: 11485 Pages: 237-248

    • DOI

      10.1007/978-3-030-17402-6_20

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-17H01697
  • [Journal Article] On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations2019

    • Author(s)
      Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      CPM 2019

      Volume: 128

    • DOI

      10.4230/LIPICS.CPM.2019.29

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H01697
  • [Journal Article] On the size of the smallest alphabet for Lyndon trees2019

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-17H01697
  • [Journal Article] An Improved Data Structure for Left-Right Maximal Generic Words Problem2019

    • Author(s)
      Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      ISAAC2019

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Journal Article] MR-RePair: Grammar Compression based on Maximal Repeats2019

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] Computing maximal palindromes and distinct palindromes in a trie2019

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] On Longest Common Property Preserved Substring Queries2019

    • Author(s)
      Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
    • Journal Title

      SPIRE 2019

      Volume: 11811 Pages: 162-174

    • DOI

      10.1007/978-3-030-32686-9_12

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-17H01697
  • [Journal Article] Computing Maximal Palindromes and Distinct Palindromes in a Trie2019

    • Author(s)
      Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      PSC2019

      Volume: - Pages: 3-15

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Journal Article] Computing Runs on a Trie2019

    • Author(s)
      Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      CPM2019

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Journal Article] Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets2019

    • Author(s)
      Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      SPIRE 2019

      Volume: 11811 Pages: 382-391

    • DOI

      10.1007/978-3-030-32686-9_27

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-17H01697
  • [Journal Article] Faster Queries for Longest Substring Palindrome After Block Edit2019

    • Author(s)
      Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      CPM 2019

      Volume: 128

    • DOI

      10.4230/LIPICS.CPM.2019.27

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H01697
  • [Journal Article] On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations2019

    • Author(s)
      Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      CPM2019

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Journal Article] Compact Data Structures for Shortest Unique Substring Queries2019

    • Author(s)
      Takuya Mieno, Dominik Koeppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      SPIRE 2019

      Volume: 11811 Pages: 107-123

    • DOI

      10.1007/978-3-030-32686-9_8

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-18F18120, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-17H01697
  • [Journal Article] Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings2019

    • Author(s)
      Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      IWOCA 2019

      Volume: 11638 Pages: 430-441

    • DOI

      10.1007/978-3-030-25005-8_35

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-17H01697
  • [Journal Article] An improved data structure for left-right maximal generic words problem2019

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [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: 128

    • DOI

      10.4230/LIPICS.CPM.2019.23

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783
  • [Journal Article] Faster Queries for Longest Substring Palindrome After Block Edit2019

    • Author(s)
      Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      CPM2019

      Volume: -

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Journal Article] Shortest Unique Palindromic Substring Queries in Optimal Time2018

    • Author(s)
      Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proceedings of 28th International Workshop on Combinatorial Algorithms

      Volume: 10765 Pages: 397-408

    • DOI

      10.1007/978-3-319-78825-8_32

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H06923
  • [Journal Article] Lyndon Factorization of Grammar Compressed Texts Revisited2018

    • Author(s)
      Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)

      Volume: 105

    • DOI

      10.4230/LIPIcs.CPM.2018.19

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H01697
  • [Journal Article] Right-to-left online construction of parameterized position heaps2018

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] Longest substring palindrome after edit2018

    • Author(s)
      Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)

      Volume: 105

    • DOI

      10.4230/LIPIcs.CPM.2018.12

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H01697
  • [Journal Article] Faster Online Elastic Degenerate String Matching2018

    • Author(s)
      Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)

      Volume: 105

    • DOI

      10.4230/LIPIcs.CPM.2018.9

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H01697
  • [Journal Article] O(n log n)-time text compression by LZ-style longest first substitution2018

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Journal Article] Algorithms and combinatorial properties on shortest unique palindromic substrings2018

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-16H02783
  • [Journal Article] Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays2018

    • Author(s)
      Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proc. 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018)

      Volume: 11147 Pages: 254-267

    • DOI

      10.1007/978-3-030-00479-8_21

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-18H04098, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H01697
  • [Journal Article] Lyndon Factorization of Grammar Compressed Texts Revisited2018

    • Author(s)
      Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proc. 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)

      Volume: 105

    • DOI

      10.4230/LIPIcs.CPM.2018.24

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-18K18002, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H01697
  • [Journal Article] The “Runs” Theorem2017

    • Author(s)
      Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
    • Journal Title

      SIAM Journal of Computing

      Volume: 46(5) Pages: 1501-1514

    • DOI

      10.1137/15m1011032

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K16009, KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-16H02870, KAKENHI-PROJECT-17H01697, KAKENHI-PROJECT-17H06923
  • [Journal Article] Inferring strings from Lyndon factorization2017

    • Author(s)
      Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Theoretical Computer Science

      Volume: 689 Pages: 147-156

    • DOI

      10.1016/j.tcs.2017.05.038

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-16K16009, KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-16H02870, KAKENHI-PROJECT-17H01697, KAKENHI-PROJECT-17H06923
  • [Journal Article] On Reverse Engineering the Lyndon Tree2017

    • Author(s)
      Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proceedings of the Prague Stringology Conference 2017 (PSC 2017)

      Volume: PSC 2017 Pages: 108-117

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25240003
  • [Journal Article] On Reverse Engineering the Lyndon Tree2017

    • Author(s)
      Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proceedings of the Prague Stringology Conference 2017

      Volume: - Pages: 108-117

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-17H06923
  • [Journal Article] Almost linear time computation of maximal repetitions in run length encoded strings2017

    • Author(s)
      Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proceedings of 28th International Symposium on Algorithms and Computation

      Volume: 92

    • DOI

      10.4230/LIPIcs.ISAAC.2017.33

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-16H02783, KAKENHI-PROJECT-17H01697, KAKENHI-PROJECT-17H06923
  • [Journal Article] Faster Lyndon factorization algorithms for SLP and LZ78 compressed text2016

    • Author(s)
      Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Theoretical Computer Science

      Volume: 656 Pages: 215-224

    • DOI

      10.1016/j.tcs.2016.03.005

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-16H02870, KAKENHI-PROJECT-16J04105, KAKENHI-PROJECT-26280003
  • [Journal Article] Computing Smallest and Largest Repetition Factorizations in O(n log n) Time2016

    • Author(s)
      Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Stringology 2016

      Volume: - Pages: 135-145

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25240003
  • [Journal Article] siEDM: an efficient string index and search algorithm for edit distance with moves2016

    • Author(s)
      Yoshimasa Takabatake, Kenta Nakashima, Tetsuji Kuboyama, Yasuo Tabei, Hiroshi Sakamoto
    • Journal Title

      Algorithms

      Volume: 9(2) Pages: 1-18

    • DOI

      10.3390/a9020026

    • NAID

      40020552273

    • Peer Reviewed / Acknowledgement Compliant / Open Access
    • Data Source
      KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-16H02870, KAKENHI-PROJECT-15J05902, KAKENHI-PROJECT-26280088, KAKENHI-PROJECT-26540119
  • [Journal Article] Computing Left-Right Maximal Generic Words2015

    • Author(s)
      Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
    • Journal Title

      PSC 2015

      Volume: PSC 2015 Pages: 5-16

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25240003
  • [Journal Article] A new characterization of maximal repetitions by Lyndon trees2015

    • Author(s)
      Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
    • Journal Title

      Proc. ACM-SIAM Symposium on Discrete Algorithms 2015 (SODA 2015)

      Volume: SODA2015 Pages: 562-571

    • DOI

      10.1137/1.9781611973730.38

    • NAID

      110009977436

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-25280086, KAKENHI-PROJECT-26280003
  • [Journal Article] Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets2015

    • Author(s)
      Yuto Nakashima, Tomohiro I ,Shunsuke Inenaga, Hideo Bannai , Masayuki Takeda
    • Journal Title

      Information Processing Letters

      Volume: 115(9) Pages: 655-659

    • DOI

      10.1016/j.ipl.2015.04.002

    • Peer Reviewed / Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-25280086, KAKENHI-PROJECT-26280003
  • [Journal Article] Inferring Strings from Lyndon factorization2014

    • Author(s)
      Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      Proc. the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014)

      Volume: MFCS2014 Pages: 565-576

    • DOI

      10.1007/978-3-662-44465-8_48

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-25280086, KAKENHI-PROJECT-26280003
  • [Journal Article] Efficient Lyndon factorization of grammar compressed text2013

    • Author(s)
      Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
    • Journal Title

      Proc. 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013)

      Volume: 7922 Pages: 153-164

    • DOI

      10.1007/978-3-642-38905-4_16

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700022, KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-25280086
  • [Journal Article] Faster Lyndon factorization algorithms for SLP and LZ78 compressed text2013

    • Author(s)
      Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda
    • Journal Title

      Proc. 20th International Symposium on String Processing and Information Retrieval (SPIRE 2013)

      Volume: 8214 Pages: 174-185

    • DOI

      10.1007/978-3-319-02432-5_21

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700022, KAKENHI-PROJECT-25240003, KAKENHI-PROJECT-25280086
  • [Presentation] LZEnd vs LZ772022

    • Author(s)
      井手上 卓弥, 三重野 琢也, 舩越 満, 中島 祐人, 稲永 俊介, 竹田 正幸
    • Organizer
      2021年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17705
  • [Presentation] 文法圧縮索引構造 GCIS-index2022

    • Author(s)
      赤木 亨, ドミニク クップル, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸
    • Organizer
      2021年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-21K17705
  • [Presentation] LZEnd vs LZ772022

    • Author(s)
      井手上 卓弥, 三重野 琢也, 舩越 満, 中島 祐人, 稲永 俊介, 竹田 正幸
    • Organizer
      2021年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] 文法圧縮索引構造 GCIS-index2022

    • Author(s)
      赤木 亨, ドミニク クップル, 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸
    • Organizer
      2021年度 冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] The Parameterized Suffix Tray2021

    • Author(s)
      Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      12th International Conference on Algorithms and Complexity
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] On the Approximation Ratio of LZ-End to LZ772021

    • 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
    • Data Source
      KAKENHI-PROJECT-21K17705
  • [Presentation] Longest Common Rollercoasters2021

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Counting Lyndon Subsequence2021

    • Author(s)
      Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
    • Organizer
      Prague Stringology Conference 2021
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17705
  • [Presentation] On the Approximation Ratio of LZ-End to LZ772021

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Longest Common Rollercoasters2021

    • 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
    • Data Source
      KAKENHI-PROJECT-21K17705
  • [Presentation] Position Heaps for Cartesian-Tree Matching on Strings and Tries2021

    • Author(s)
      Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
    • Organizer
      28th International Symposium on String Processing and Information Retrieval
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Position Heaps for Cartesian-Tree Matching on Strings and Tries2021

    • Author(s)
      Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
    • Organizer
      28th International Symposium on String Processing and Information Retrieval
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-21K17705
  • [Presentation] Grammar Index by Induced Suffix Sorting2021

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Counting Lyndon Subsequence2021

    • Author(s)
      Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
    • Organizer
      Prague Stringology Conference 2021
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Grammar Index by Induced Suffix Sorting2021

    • 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
    • Data Source
      KAKENHI-PROJECT-21K17705
  • [Presentation] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences2020

    • Author(s)
      M. Funakoshi, Y. Nakashima, S. Inenaga, H. Bannai, M. Takeda, A. Shinohara
    • Organizer
      CPM 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Presentation] Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Faster STR-EC-LCS computation2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Towards Efficient Interactive Computation of Dynamic Time Warping Distance2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] On Repetitiveness Measures of Thue-Morse Words2020

    • Author(s)
      K. Kutsukake, T. Matsumoto, Y. Nakashima, S. Inenaga, H. Bannai, M. Takeda
    • Organizer
      SPIRE 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Presentation] Towards Efficient Interactive Computation of Dynamic Time Warping Distance2020

    • Author(s)
      A. Nishi, Y. Nakashima, S. Inenaga, H. Bannai, M. Takeda
    • Organizer
      SPIRE 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Presentation] On repetitiveness measures of Thue-Morse words2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Minimal unique substrings and minimal absent words in a sliding window2020

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures2020

    • Author(s)
      K. Nakashima, N. Fujisato, D. Hendrian, Y. Nakashima, R. Yoshinaka, S. Inenaga, H. Bannai, A. Shinohara, M. Takeda
    • Organizer
      CPM 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Presentation] Lyndon Words, the Three Squares Lemma, and Primitive Squares2020

    • Author(s)
      H. Bannai, T. Mieno, Y. Nakashima
    • Organizer
      SPIRE 2020
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18H04098
  • [Presentation] Lyndon Words, the Three Squares Lemma, and Primitive Squares2020

    • Author(s)
      Hideo Bannai, Takuya Mieno, Yuto Nakashima
    • Organizer
      The 27th International Symposium on String Processing and Information Retrieval
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] An improved data structure for left-right maximal generic words problem2019

    • Author(s)
      Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      30th International Symposium on Algorithms and Computation
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Computing maximal palindromes and distinct palindromes in a trie2019

    • Author(s)
      Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      Prague Stringology Conference 2019
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] MR-RePair: Grammar Compression based on Maximal Repeats2019

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] The parameterized position heap of a trie2019

    • Author(s)
      Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      11th International Conference on Algorithms and Complexity
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Faster queries for longest substring palindrome after block edit2019

    • Author(s)
      Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      30th Annual Symposium on Combinatorial Pattern Matching
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets2019

    • Author(s)
      Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      26th International Symposium on String Processing and Information Retrieval
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] On longest common property preserved substring queries2019

    • Author(s)
      Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
    • Organizer
      26th International Symposium on String Processing and Information Retrieval
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Palindromic substring queries on run-length encoded strings2019

    • Author(s)
      Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      30th International Workshop on Combinatorial Algorithms
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Overlapping Lempel-Ziv and Lyndon factorizations2019

    • Author(s)
      Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      30th Annual Symposium on Combinatorial Pattern Matching
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Compact data structure for shortest unique substring queries2019

    • Author(s)
      Takuya Mieno, Dominik Koeppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      26th International Symposium on String Processing and Information Retrieval
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Longest Lyndon Substring After Edit2018

    • Author(s)
      Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      Annual Symposium on Combinatorial Pattern Matching 2018
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays2018

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Longest substring palindrome after edit2018

    • Author(s)
      Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      Annual Symposium on Combinatorial Pattern Matching 2018
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Right-to-left online construction of parameterized position heaps2018

    • Author(s)
      Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      Prague Stringology Conference 2018
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Faster Online Elastic Degenerate String Matching2018

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] O(n log n)-time text compression by LZ-style longest first substitution2018

    • Author(s)
      Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      Prague Stringology Conference 2018
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] ストリーミングモデルにおける最長Lyndon文字列2018

    • Author(s)
      中島祐人
    • Organizer
      冬のLAシンポジウム2017
    • Data Source
      KAKENHI-PROJECT-17H06923
  • [Presentation] Lyndon Factorization of Grammar Compressed Texts Revisited2018

    • 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
    • Data Source
      KAKENHI-PROJECT-18K18002
  • [Presentation] Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings2017

    • Author(s)
      Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      ISAAC 2017
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25240003
  • [Presentation] Shortest Unique Palindromic Substring Queries in Optimal Time2017

    • Author(s)
      Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      IWOCA 2017
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25240003
  • [Presentation] On Reverse Engineering the Lyndon Tree2017

    • Author(s)
      Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      PSC 2017
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-25240003
  • [Presentation] Shortest Unique Palindromic Substring Queries in Optimal Time2017

    • Author(s)
      Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      28th International Workshop on Combinatorial Algorithms
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17H06923
  • [Presentation] On Reverse Engineering the Lyndon Tree2017

    • Author(s)
      Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      Prague Stringology Conference 2017
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17H06923
  • [Presentation] Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings2017

    • Author(s)
      Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      28th International Symposium on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-17H06923
  • 1.  坂内 英夫 (20323644)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 59 results
  • 2.  稲永 俊介 (60448404)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 58 results
  • 3.  Takeda Masayuki (50216909)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 45 results
  • 4.  定兼 邦彦 (20323090)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 5.  坂本 比呂志 (50315123)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 1 results
  • 6.  瀧本 英二 (50236395)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 7.  喜田 拓也 (70343316)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 1 results
  • 8.  畑埜 晃平 (60404026)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 9.  井 智弘 (20773360)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 60 results
  • 10.  成澤 和志 (40583323)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 11.  Koeppl Dominik (50897395)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 11 results
  • 12.  久保山 哲二
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results
  • 13.  田部井 靖生
    # of Collaborated Projects: 0 results
    # of Collaborated Products: 1 results

URL: 

Are you sure that you want to connect your ORCID iD to this researcher?
* This action can be performed only by the researcher themselves.

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi