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

2020 Fiscal Year Annual Research Report

文字列の辞書式順序の組合せ論とその応用

Research Project

Project/Area Number 20H04141
Research InstitutionTokyo Medical and Dental University

Principal Investigator

坂内 英夫  東京医科歯科大学, M&Dデータ科学センター, 教授 (20323644)

Co-Investigator(Kenkyū-buntansha) 井 智弘  九州工業大学, 大学院情報工学研究院, 准教授 (20773360)
関 新之助  電気通信大学, 大学院情報理工学研究科, 准教授 (30624944)
稲永 俊介  九州大学, システム情報科学研究院, 准教授 (60448404)
Project Period (FY) 2020-04-01 – 2024-03-31
KeywordsLyndon 語 / Lyndon 木 / 原始平方 / 文字列アトラクタ
Outline of Annual Research Achievements

本年度の主な成果は以下の通りである。1) 辞書式順序によって定義される Lyndon 語と Lyndon木に基づいた Lyndon SLPという文法圧縮表現および圧縮索引構造を提案した。この索引は長さ N のテキスト文字列に対して O(N log N) 期待時間で構築でき、長さ m のパターン文字列のテキスト文字列中の全ての出現をO(m+log m log N + occ log g) 時間で出力することができる。ここで、occ はパターンの出現数、g はLyndon SLP のサイズである。2) 長さ N の文字列に含まれる原始平方の出現の最大数について、Lyndon 語と Lyndon木に基づいた議論により N log N 以下であることを示し、20年以上前に[Fraenkel & Simpson, 1999] によって示された上界 1.441 N log N を初めてかつ大幅に改善することに成功した。また、三つの平方が同一位置で始まる場合に、それらの長さに関する制約を捉えた「三平方の補題」について、Lyndon 語に基づく別の証明を与え、同一位置で始まらない場合にも拡張できることを示した。3) Thue-Morse語という文字列のクラスに対し、辞書式圧縮に関連する幾つかの圧縮指標の値を詳細に解析した。具体的には、n 番目 Thue-Morse 語 t(n) の: LZ77分解のサイズは 2n, 部分文字列複雑性に基づく指標δは 10/(3+2^{4-n})、最小文字列アトラクタのサイズ γ は 4 であることを示した。これにより、t(n) の最小文字列アトラクタサイズ γ は nであるという [Mantaci et al. 2019] の予想を否定的に解決した。また、この成果は国際会議 SPIRE 2020 にて発表し、ベストペーパー賞を受賞した。

Current Status of Research Progress
Current Status of Research Progress

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

Reason

コロナウィルスの感染拡大により、国際会議等における研究ディスカッションや共同研究の打ち合わせなどが想定より制限された面もあるが、取り組んだ課題で一定の成果が得られているため、順調と考えられる。

Strategy for Future Research Activity

引き続き課題として挙げている問題に取り組むとともに、新しい課題についても適宜開拓してく。

  • Research Products

    (19 results)

All 2021 2020

All Journal Article (13 results) (of which Int'l Joint Research: 2 results,  Peer Reviewed: 13 results,  Open Access: 4 results) Presentation (6 results) (of which Int'l Joint Research: 6 results)

  • [Journal Article] The Smallest Grammar Problem Revisited2021

    • Author(s)
      Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
    • Journal Title

      IEEE Transactions on Information Theory

      Volume: 67(1) Pages: 317-328

    • DOI

      10.1109/tit.2020.3038147

    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Computing longest palindromic substring after single-character or block-wise edits2021

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

      Theoretical Computer Science

      Volume: 859 Pages: 116-133

    • DOI

      10.1016/j.tcs.2021.01.014

    • Peer Reviewed
  • [Journal Article] Practical Grammar Compression Based on Maximal Repeats2020

    • Author(s)
      Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
    • Journal Title

      Algorithms

      Volume: 13(4) Pages: 103:1-103:18

    • DOI

      10.3390/a13040103

    • Peer Reviewed / Open Access
  • [Journal Article] Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings2020

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

      Theory of Computing Systems

      Volume: 64 Pages: 1273-1291

    • DOI

      10.1007/s00224-020-09980-x

    • Peer Reviewed
  • [Journal Article] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures2020

    • Author(s)
      Katsuhito Nakashima, Moriki Fujisato, 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 (CPM 2020)

      Volume: LIPIcs 161 Pages: 26:1-26:14

    • DOI

      10.4230/LIPIcs.CPM.2020.26

    • Peer Reviewed / Open Access
  • [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 (CPM 2020)

      Volume: LIPIcs 161 Pages: 12:1-12:11

    • DOI

      10.4230/LIPIcs.CPM.2020.12

    • Peer Reviewed / Open Access
  • [Journal Article] Grammar-compressed Self-index with Lyndon Words2020

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

      情報処理学会論文誌数理モデル化と応用(TOM)

      Volume: 13(2) Pages: 84-92

    • Peer Reviewed
  • [Journal Article] More Time-Space Tradeoffs for Finding a Shortest Unique Substring2020

    • Author(s)
      Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luis M. S. Russo
    • Journal Title

      Algorithms

      Volume: 13(9) Pages: 234:1-234:9

    • DOI

      10.3390/a13090234

    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Lyndon Words, the Three Squares Lemma, and Primitive Squares2020

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

      Proceedings of the 27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)

      Volume: LNCS 12303 Pages: 265-273

    • DOI

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

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

      Proceedings of the 27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)

      Volume: LNCS 12303 Pages: 213-220

    • DOI

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

    • Peer Reviewed
  • [Journal Article] Longest Square Subsequence Problem Revisited2020

    • Author(s)
      Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
    • Journal Title

      Proceedings of the 27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)

      Volume: LNCS 12303 Pages: 147-154

    • DOI

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

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

      Proceedings of the 27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)

      Volume: LNCS 12303 Pages: 27-41

    • DOI

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

    • Peer Reviewed
  • [Journal Article] Space-efficient algorithms for computing minimal/shortest unique substrings2020

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

      Theoretical Computer Science

      Volume: 845 Pages: 230-242

    • DOI

      10.1016/j.tcs.2020.09.017

    • Peer Reviewed
  • [Presentation] DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures2020

    • Author(s)
      Katsuhito Nakashima, Moriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
    • Organizer
      31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)
    • Int'l Joint Research
  • [Presentation] Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences2020

    • Author(s)
      Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
    • Organizer
      31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)
    • Int'l Joint Research
  • [Presentation] Lyndon Words, the Three Squares Lemma, and Primitive Squares2020

    • Author(s)
      Hideo Bannai, Takuya Mieno, Yuto Nakashima
    • Organizer
      27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)
    • Int'l Joint Research
  • [Presentation] On Repetitiveness Measures of Thue-Morse Words2020

    • Author(s)
      Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)
    • Int'l Joint Research
  • [Presentation] Longest Square Subsequence Problem Revisited2020

    • Author(s)
      Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
    • Organizer
      27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)
    • Int'l Joint Research
  • [Presentation] Towards Efficient Interactive Computation of Dynamic Time Warping Distance2020

    • Author(s)
      Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)
    • Int'l Joint Research

URL: 

Published: 2021-12-27  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi