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

2019 Fiscal Year Research-status Report

Lyndon文字列による簡潔で高速な文字列処理アルゴリズム

Research Project

Project/Area Number 18K18002
Research InstitutionKyushu University

Principal Investigator

中島 祐人  九州大学, システム情報科学研究院, 助教 (80804682)

Project Period (FY) 2018-04-01 – 2021-03-31
Keywords文字列処理アルゴリズム / 文字列組合せ論
Outline of Annual Research Achievements

本研究課題では,簡潔で高速な文字列処理アルゴリズム開発への新たなアプローチとして,Lyndon 文字列や Lyndon 文字列に基づいたデータ構造の未知の性質を明らかにし,それらを用いたアルゴリズム開発を目的としている.この目的のために,Lyndon文字列に関連するトピックを中心に,様々な文字列処理アルゴリズムに関する問題に初年度に引き続き取り組んだ.その結果,12報の論文を査読付き国際会議にて発表,1報の論文を査読付き国際学術雑誌にて公表している.特にこれらの成果のうち,本研究課題の核となる Lyndon 文字列に関する重要な成果の概要を以下に示す.
成果 1) Lyndon 木と呼ばれる Lyndon 文字列の構造を表現する全二分木データ構造の性質に関する成果である.特定のサイズの全二分木を Lyndon 木として持つ文字列のアルファベットサイズの条件に関しての知見を得ている.
2) Lyndon 分解と Lempel-Ziv 分解と呼ばれる2つの文字列分解の関係に関する成果である.これらの分解はそれぞれ重要な性質を持つことが知られているが,一見すると直接的な関係がなさそうな分解である.この2つの分解のサイズに関して一定の関係があることを示している.
その他の研究成果については,繰り返し構造や回文といった文字列中の特徴的な構造発見,文字列照合問題のためのデータ構造など,文字列情報学の発展に寄与する重要な成果である.また,その他の関連する研究テーマについてすでに成果を得ており,国際会議,国際学術雑誌等での公表に向けて準備中である.

Current Status of Research Progress
Current Status of Research Progress

2: Research has progressed on the whole more than it was originally planned.

Reason

研究業績の概要に示したように,本研究課題の核となるLyndon文字列に関する研究成果2件を中心に,文字列処理アルゴリズムに関する研究成果が得られている.そのため,本研究課題はおおむね順調に進展しているといえる.

Strategy for Future Research Activity

先に示したように,本研究課題はここまで順調に進んでいるため,次年度も計画に基づき推し進めていく予定である.

Causes of Carryover

コロナウイルス感染症拡大の影響を受け,学会等が中止になったため,次年度へ繰り越す.

  • Research Products

    (25 results)

All 2020 2019

All Journal Article (13 results) (of which Int'l Joint Research: 1 results,  Peer Reviewed: 13 results,  Open Access: 5 results) Presentation (12 results)

  • [Journal Article] The parameterized position heap of a trie2019

    • 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

    • Peer Reviewed
  • [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

      Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, LIPIcs

      Volume: 128 Pages: 27:1-27:13

    • DOI

      10.4230/LIPIcs.CPM.2019.27

    • Peer Reviewed / Open Access
  • [Journal Article] Overlapping Lempel-Ziv and Lyndon factorizations2019

    • 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 Pages: 29:1-29:11

    • DOI

      10.4230/LIPIcs.CPM.2019.29

    • Peer Reviewed / Open Access
  • [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, LIPIcs

      Volume: 128 Pages: 23:1-23-11

    • DOI

      10.4230/LIPIcs.CPM.2019.23

    • Peer Reviewed / Open Access
  • [Journal Article] Palindromic substring queries on run-length encoded strings2019

    • 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

    • Peer Reviewed
  • [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
  • [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

      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

    • Peer Reviewed
  • [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

      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

    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Compact data structure for shortest unique substring queries2019

    • 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

    • Peer Reviewed
  • [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 Pages: 40:1-40:12

    • DOI

      10.4230/LIPIcs.ISAAC.2019.40

    • Peer Reviewed / Open Access
  • [Journal Article] Minimal unique substrings and minimal absent words in a sliding window2019

    • 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

    • Peer Reviewed
  • [Journal Article] Faster STR-EC-LCS computation2019

    • 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

    • Peer Reviewed
  • [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
  • [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
  • [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
  • [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
  • [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
  • [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
  • [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
  • [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
  • [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
  • [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
  • [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
  • [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
  • [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

URL: 

Published: 2021-01-27  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi