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

広義文字列のアルゴリズムと組合せ論

Research Project

Project/Area Number 23K24808
Project/Area Number (Other) 22H03551 (2022-2023)
Research Category

Grant-in-Aid for Scientific Research (B)

Allocation TypeMulti-year Fund (2024)
Single-year Grants (2022-2023)
Section一般
Review Section Basic Section 60010:Theory of informatics-related
Research InstitutionKyushu University

Principal Investigator

稲永 俊介  九州大学, システム情報科学研究院, 教授 (60448404)

Co-Investigator(Kenkyū-buntansha) 坂内 英夫  東京医科歯科大学, M&Dデータ科学センター, 教授 (20323644)
中島 祐人  九州大学, システム情報科学研究院, 助教 (80804682)
Koeppl Dominik  山梨大学, 大学院総合研究部, 特任准教授 (50897395)
Project Period (FY) 2022-04-01 – 2026-03-31
Project Status Granted (Fiscal Year 2024)
Budget Amount *help
¥17,030,000 (Direct Cost: ¥13,100,000、Indirect Cost: ¥3,930,000)
Fiscal Year 2025: ¥4,940,000 (Direct Cost: ¥3,800,000、Indirect Cost: ¥1,140,000)
Fiscal Year 2024: ¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2023: ¥4,550,000 (Direct Cost: ¥3,500,000、Indirect Cost: ¥1,050,000)
Fiscal Year 2022: ¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Keywordsアルゴリズム理論 / アルゴリズム / データ構造 / 文字列データ処理 / データ圧縮 / 文字列処理 / 情報検索
Outline of Research at the Start

文字列とは,文字あるいは記号の一本鎖列である.自然言語テキスト,サーバログ,DNA配列など,計算機処理可能な様々なデータを文字列と見なすことができる.1970年代から半世紀にわたって,検索・圧縮・比較・解析・発見などの重要タスクを文字列データ上で高速実行するアルゴリズムが多数提案されてきた.本提案課題では,文字列の定義域を拡張した「広義文字列」という新概念を提唱し,木型文字列/グラフ型文字列/2次元文字列/時系列の高速処理アルゴリズム開発と,それを支える組合せ論的性質の解明に取り組む.

Outline of Annual Research Achievements

本研究課題の目的は,アルゴリズム理論と組合せ論の有機的融合によって,広義文字列に対する効率的処理技法を開発することである.本年度は,以下に示す (A)-(E) の重要研究テーマについて,主に以下の研究成果を達成した.
(A) テキストデータ圧縮:連長圧縮BW変換の感度に関する下界,(B) 圧縮文字列処理:CDAWG を用いた圧縮索引配列の省領域計算,(C) グラフ型文字列処理:グラフ型文字列に対する制約付きLCS計算,(D) 文字列組合せ論:フィボナッチ文字列の最大反復分解の厳密解,(E) 索引構造:整数アルファベットに対する DAWG,双方向索引構造,極小不在文字列 (MAW / Minimal Absent Words) の線形時間計算法
これらの成果はすべて,広義文字列に内在する組合せ的性質,および高度なアルゴリズム技術を活用することで達成された.また,これらの結果は,査読付き国際会議および査読付き国際論文誌にて発表済みである.

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

【現在までの進捗状況】で述べたように,概ね順調に研究が進んでいる.引き続き,国内外の専門家と緊密に連携しながら,本研究を遂行していく.

Report

(2 results)
  • 2023 Annual Research Report
  • 2022 Annual Research Report
  • Research Products

    (39 results)

All 2024 2023 2022 Other

All Int'l Joint Research (2 results) Journal Article (14 results) (of which Int'l Joint Research: 1 results,  Peer Reviewed: 14 results,  Open Access: 6 results) Presentation (23 results) (of which Int'l Joint Research: 12 results)

  • [Int'l Joint Research] University of Verona/University of Palermo(イタリア)

    • Related Report
      2023 Annual Research Report
  • [Int'l Joint Research] University of Chile(チリ)

    • Related Report
      2023 Annual Research Report
  • [Journal Article] Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets2023

    • Author(s)
      Fujishige Yuta、Tsujimaru Yuki、Inenaga Shunsuke、Bannai Hideo、Takeda Masayuki
    • Journal Title

      Theoretical Computer Science

      Volume: 973 Pages: 114093-114093

    • DOI

      10.1016/j.tcs.2023.114093

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph2023

    • Author(s)
      Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
    • Journal Title

      Proceedings of 30th International Symposium on String Processing and Information Retrieval

      Volume: LNCS 14240 Pages: 28-34

    • DOI

      10.1007/978-3-031-43980-3_3

    • ISBN
      9783031439797, 9783031439803
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings2023

    • Author(s)
      Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
    • Journal Title

      Proceedings of 30th International Symposium on String Processing and Information Retrieval

      Volume: LNCS 14240 Pages: 331-344

    • DOI

      10.1007/978-3-031-43980-3_27

    • ISBN
      9783031439797, 9783031439803
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Largest Repetition Factorization of Fibonacci Words2023

    • Author(s)
      Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga
    • Journal Title

      Proceedings of 30th International Symposium on String Processing and Information Retrieval

      Volume: LNCS 14240 Pages: 284-296

    • DOI

      10.1007/978-3-031-43980-3_23

    • ISBN
      9783031439797, 9783031439803
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Computing SEQ-IC-LCS of Labeled Graphs2023

    • Author(s)
      Yuki Yonemoto, Yuto Nakashima, and Shunsuke Inenaga
    • Journal Title

      Proc. The Prague Stringology Conference 2023 (PSC 2023)

      Volume: - Pages: 3-17

    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] On Sensitivity of?Compact Directed Acyclic Word Graphs2023

    • Author(s)
      Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
    • Journal Title

      Proc. 14th International Conference on Words (WORDS 2023)

      Volume: LNCS 13899 Pages: 168-180

    • DOI

      10.1007/978-3-031-33180-0_13

    • ISBN
      9783031331794, 9783031331800
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Bit Catastrophes for the Burrows-Wheeler Transform2023

    • Author(s)
      Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Liptak, Giuseppe Romana, Marinella Sciortino, and Cristian Urbina
    • Journal Title

      Proc. 27th International Conference on Developments in Language Theory (DLT 2023)

      Volume: LNCS 13911 Pages: 86-99

    • DOI

      10.1007/978-3-031-33264-7_8

    • ISBN
      9783031332630, 9783031332647
    • Related Report
      2023 Annual Research Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] Space-Efficient STR-IC-LCS Computation2023

    • Author(s)
      Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 13878 Pages: 372-384

    • DOI

      10.1007/978-3-031-23101-8_25

    • ISBN
      9783031231001, 9783031231018
    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Sensitivity of string compressors and repetitiveness measures2023

    • Author(s)
      Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga
    • Journal Title

      Information and Computation

      Volume: 291 Pages: 104999-104999

    • DOI

      10.1016/j.ic.2022.104999

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Cartesian Tree Subsequence Matching2022

    • Author(s)
      Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, and Hiroki Arimura
    • Journal Title

      Proc. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)

      Volume: LIPIcs 223

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] RePair Grammars are the Smallest Grammars for Fibonacci Words2022

    • Author(s)
      Takuya Mieno, Shunsuke Inenaga, and Takashi Horiyama
    • Journal Title

      Proc. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)

      Volume: LIPIcs 223

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Minimal Absent Words on Run-Length Encoded Strings2022

    • Author(s)
      Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, and Shunsuke Inenaga
    • Journal Title

      Proc. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)

      Volume: LIPIcs 223

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions2022

    • Author(s)
      Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, and Takuya Mieno
    • Journal Title

      Proc. 29th edition of the annual Symposium on String Processing and Information Retrieval (SPIRE 2022)

      Volume: LNCS 13617 Pages: 24-37

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Computing palindromes on a trie in linear time2022

    • Author(s)
      Takuya Mieno, Mitsuru Funakoshi, and Shunsuke Inenaga
    • Journal Title

      Proc. 33rd International Symposium on Algorithms and Computation (ISAAC 2022)

      Volume: LIPIcs 248

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Presentation] Sensitivity of string compressors and repetitiveness measures2024

    • Author(s)
      Shunsuke Inenaga
    • Organizer
      Sequences in London 2024
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Bit catastrophes for the Burrows-Wheeler Transform2023

    • Author(s)
      Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Liptak, Giuseppe Romana, Marinella Sciortino, and Cristian Urbina
    • Organizer
      DLT 2023
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] On Sensitivity of Compact Directed Acyclic Word Graphs2023

    • Author(s)
      Hiroto Fujimaru, Yuto Nakashima, and Shunsuke Inenaga
    • Organizer
      WORDS 2023
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Largest Repetition Factorization of Fibonacci Words2023

    • Author(s)
      Kaisei Kishi, Yuto Nakashima, and Shunsuke Inenaga
    • Organizer
      SPIRE 2023
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Linear-Time Computation of Generalized Minimal Absent Words of Multiple Strings2023

    • Author(s)
      Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, and Hideo Bannai
    • Organizer
      SPIRE 2023
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph2023

    • Author(s)
      Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima and Mizuki Sue
    • Organizer
      SPIRE 2023
    • Related Report
      2023 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 反復分解の簡潔な線形時間アルゴリズム2023

    • Author(s)
      米本 優生, 中島 祐人, 稲永 俊介
    • Organizer
      2023年度 夏のLAシンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] 木型文字列に対する高速パラメタ化照合2023

    • Author(s)
      藤里 法輝, 中島 祐人, 稲永 俊介
    • Organizer
      2023年度 夏のLAシンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] CDAWGの左端編集厳密感度2023

    • Author(s)
      藤丸 大翔, 中島 祐人, 稲永 俊介
    • Organizer
      2023年度 夏のLAシンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] CDAWGの定数感度2023

    • Author(s)
      濱井 陸哉, 藤丸 大翔, 中島 祐人, 稲永 俊介
    • Organizer
      2023年度 夏のLAシンポジウム
    • Related Report
      2023 Annual Research Report
  • [Presentation] Space-Efficient STR-IC-LCS Computation2023

    • Author(s)
      Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, and Hideo Bannai
    • Organizer
      SOFSEM 2023
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 極大一般化回文2023

    • Author(s)
      舩越 満, 三重野 琢也 , 中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸
    • Organizer
      2022年度 冬のLAシンポジウム
    • Related Report
      2022 Annual Research Report
  • [Presentation] 非線形文字列の制約付き最長共通部分列2023

    • Author(s)
      米本 優生, 中島 祐人, 稲永 俊介
    • Organizer
      2022年度 冬のLAシンポジウム
    • Related Report
      2022 Annual Research Report
  • [Presentation] フィボナッチ文字列の最大反復分解2023

    • Author(s)
      岸 海聖, 中島 祐人, 稲永 俊介
    • Organizer
      2022年度 冬のLAシンポジウム
    • Related Report
      2022 Annual Research Report
  • [Presentation] 不確定文字列のデカルト木部分列照合2023

    • Author(s)
      廣瀬 健人, 三重野 琢也, 中島 祐人, 稲永 俊介
    • Organizer
      2022年度 冬のLAシンポジウム
    • Related Report
      2022 Annual Research Report
  • [Presentation] Cartesian Tree Subsequence Matching2022

    • Author(s)
      Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, and Hiroki Arimura
    • Organizer
      CPM 2022
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] RePair Grammars are the Smallest Grammars for Fibonacci Words2022

    • Author(s)
      Takuya Mieno, Shunsuke Inenaga, and Takashi Horiyama
    • Organizer
      CPM 2022
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Minimal Absent Words on Run-Length Encoded Strings2022

    • Author(s)
      Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, and Shunsuke Inenaga
    • Organizer
      CPM 2022
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions2022

    • Author(s)
      Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, and Takuya Mieno
    • Organizer
      SPIRE 2022
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Computing palindromes on a trie in linear time2022

    • Author(s)
      Takuya Mieno, Mitsuru Funakoshi, and Shunsuke Inenaga
    • Organizer
      ISAAC 2022
    • Related Report
      2022 Annual Research Report
    • Int'l Joint Research
  • [Presentation] 極大δ準反復の最大個数の上界2022

    • Author(s)
      武次 和志, 中島 祐人, 稲永 俊介, 竹田 正幸
    • Organizer
      2022年度 夏のLAシンポジウム
    • Related Report
      2022 Annual Research Report
  • [Presentation] 省領域なSTR-IC-LCSアルゴリズム2022

    • Author(s)
      米本 優生, 中島 祐人, 稲永 俊介, 坂内 英夫
    • Organizer
      2022年度 夏のLAシンポジウム
    • Related Report
      2022 Annual Research Report
  • [Presentation] RSCERシードの線形時間計算2022

    • Author(s)
      廣瀬 健人, 中島 祐人, 稲永 俊介
    • Organizer
      2022年度 夏のLAシンポジウム
    • Related Report
      2022 Annual Research Report

URL: 

Published: 2022-04-19   Modified: 2024-12-25  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi