• 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) 2024-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) テキストデータ圧縮:Lex-Parse圧縮法の感度のタイトな上界・下界の導出,最右参照 LZ 圧縮のオンライン計算,(B) 圧縮文字列処理:CDAWG を用いた極小不在文字列 (MAW / Minimal Absent Words) の線形時間計算法,(C) 文字列組合せ論:パラメタ化スクエア部分文字列の個数の上界,(D) 索引構造:Linear-size suffix trie (LST) のオンライン構築,無閉路決定性オートマトン (APDFA) のワードパック高速化,(E) 生物情報科学:動的な配列集合に対する All-Pairs Suffix-Prefix (APSP) 計算,(F) 時系列データ処理:デカルト木照合最長共通部分列の計算
これらの成果はすべて,広義文字列に内在する組合せ的性質,および高度なアルゴリズム技術を活用することで達成された.また,これらの結果は,査読付き国際会議および査読付き国際論文誌にて発表済みである.

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

(3 results)
  • 2024 Research-status Report
  • 2023 Annual Research Report
  • 2022 Annual Research Report
  • Research Products

    (70 results)

All 2025 2024 2023 2022 Other

All Int'l Joint Research (3 results) Journal Article (28 results) (of which Int'l Joint Research: 2 results,  Peer Reviewed: 28 results,  Open Access: 7 results) Presentation (37 results) (of which Int'l Joint Research: 24 results) Book (1 results) Remarks (1 results)

  • [Int'l Joint Research] National Center for Genome Resources/Montana State University(米国)

    • Country Name
      U.S.A.
    • Counterpart Institution
      National Center for Genome Resources/Montana State University
    • Related Report
      2024 Research-status Report
  • [Int'l Joint Research] University of Verona/University of Palermo(イタリア)

    • Country Name
      ITALY
    • Counterpart Institution
      University of Verona/University of Palermo
    • Related Report
      2023 Annual Research Report
  • [Int'l Joint Research] University of Chile(チリ)

    • Country Name
      CHILE
    • Counterpart Institution
      University of Chile
    • Related Report
      2023 Annual Research Report
  • [Journal Article] Tight bounds for the sensitivity of CDAWGs with left-end edits2025

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

      Acta Informatica

      Volume: 62 Pages: -

    • DOI

      10.1007/s00236-025-00478-y

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Packed Acyclic Deterministic Finite Automata2025

    • Author(s)
      Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga
    • Journal Title

      Proc. SOFSEM 2025

      Volume: LNCS 15539 Pages: 284~297

    • DOI

      10.1007/978-3-031-82697-9_21

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Linear-size suffix tries and linear-size CDAWGs simplified and improved2024

    • Author(s)
      Shunsuke Inenaga
    • Journal Title

      Acta Informatica

      Volume: 61 Pages: 445~468

    • DOI

      10.1007/s00236-024-00465-9

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Linear time online algorithms for constructing linear-size suffix trie2024

    • Author(s)
      Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi
    • Journal Title

      Theoretical Computer Science

      Volume: 1015 Pages: 114765~114765

    • DOI

      10.1016/j.tcs.2024.114765

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Faster space-efficient STR-IC-LCS computation2024

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

      Theoretical Computer Science

      Volume: 1003 Pages: 114607~114607

    • DOI

      10.1016/j.tcs.2024.114607

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings2024

    • Author(s)
      Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga
    • Journal Title

      Proc. SPIRE 2024

      Volume: LNCS 14899 Pages: 88~101

    • DOI

      10.1007/978-3-031-72200-4_7

    • Related Report
      2024 Research-status Report
    • Peer Reviewed / Int'l Joint Research
  • [Journal Article] On the Number of Non-equivalent Parameterized Squares in a String2024

    • Author(s)
      Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
    • Journal Title

      Proc. SPIRE 2024

      Volume: LNCS 14899 Pages: 174~183

    • DOI

      10.1007/978-3-031-72200-4_13

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations2024

    • Author(s)
      Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga
    • Journal Title

      Proc. SPIRE 2024

      Volume: LNCS 14899 Pages: 321~335

    • DOI

      10.1007/978-3-031-72200-4_24

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] All-Pairs Suffix-Prefix on Dynamic Set of Strings2024

    • Author(s)
      Masaru Kikuchi, Shunsuke Inenaga
    • Journal Title

      Proc. SPIRE 2024

      Volume: LNCS 14899 Pages: 192~203

    • DOI

      10.1007/978-3-031-72200-4_15

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Simple Linear-Time Repetition Factorization2024

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

      Proc. SPIRE 2024

      Volume: LNCS 14899 Pages: 348~361

    • DOI

      10.1007/978-3-031-72200-4_26

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Edit and Alphabet-Ordering Sensitivity of Lex-parse2024

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

      Proc. MFCS 2024

      Volume: - Pages: 75:1-75:15

    • DOI

      10.4230/LIPIcs.MFCS.2024.75

    • Related Report
      2024 Research-status Report
    • Peer Reviewed / Open Access
  • [Journal Article] Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space2024

    • Author(s)
      Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
    • Journal Title

      Proc. IWOCA 2024

      Volume: LNCS 14764 Pages: 327~340

    • DOI

      10.1007/978-3-031-63021-7_25

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Computing Maximal Palindromes in Non-standard Matching Models2024

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

      Proc. IWOCA 2024

      Volume: LNCS 14764 Pages: 165~179

    • DOI

      10.1007/978-3-031-63021-7_13

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Computing Longest Common Subsequence Under Cartesian-Tree Matching Model2024

    • Author(s)
      Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
    • Journal Title

      Proc. IWOCA 2024

      Volume: LNCS 14764 Pages: 369~381

    • DOI

      10.1007/978-3-031-63021-7_28

    • Related Report
      2024 Research-status Report
    • Peer Reviewed
  • [Journal Article] Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets2023

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

      Theoretical Computer Science

      Volume: 973 Pages: 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 and Mizuki Sue
    • Journal Title

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

      Volume: LNCS 14240 Pages: 28~34

    • DOI

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

    • 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, and Hideo Bannai
    • Journal Title

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

      Volume: LNCS 14240 Pages: 331-344

    • DOI

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

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

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

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

      Volume: LNCS 14240 Pages: 284-296

    • DOI

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

    • 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, and 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

    • 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

    • 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, and Hideo Bannai
    • Journal Title

      Proc. 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023)

      Volume: LNCS 13878 Pages: 372-384

    • DOI

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

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

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

      Information and Computation

      Volume: 291 Pages: 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 Pages: 14:1-14:18

    • DOI

      10.4230/LIPIcs.CPM.2022.14

    • 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 Pages: 26:1-26:17

    • DOI

      10.4230/LIPIcs.CPM.2022.26

    • 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 Pages: 27:1-27:17

    • DOI

      10.4230/LIPIcs.CPM.2022.27

    • 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

    • DOI

      10.4230/LIPIcs.CPM.2022.26

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

    • DOI

      10.4230/LIPIcs.ISAAC.2022.15

    • Related Report
      2022 Annual Research Report
    • Peer Reviewed / Open Access
  • [Presentation] Packed Acyclic Deterministic Finite Automata2025

    • Author(s)
      Hiroki Shibata, Masakazu Ishihata, and Shunsuke Inenaga
    • Organizer
      SOFSEM 2025
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] 辞書式圧縮と文字列アトラクタの差分感度2025

    • Author(s)
      藤江 勇仁, 柴田 紘希, 中島 祐人, 稲永 俊介
    • Organizer
      冬のLAシンポジウム2024
    • Related Report
      2024 Research-status Report
  • [Presentation] Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings2024

    • Author(s)
      Alan M. Cleary, Joseph Winjum, Jordan Dood, and Shunsuke Inenaga
    • Organizer
      SPIRE 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] On the Number of Non-equivalent Parameterized Squares in a String2024

    • Author(s)
      Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, and Hideo Bannai
    • Organizer
      SPIRE 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] Faster and simpler online/sliding rightmost Lempel-Ziv factorizations2024

    • Author(s)
      Wataru Sumiyoshi, Takuya Mieno, and Shunsuke Inenaga
    • Organizer
      SPIRE 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] All-Pairs Suffix-Prefix on Dynamic Set of Strings2024

    • Author(s)
      Masaru Kikuchi and Shunsuke Inenaga
    • Organizer
      SPIRE 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] Simple Linear-time Repetition Factorization2024

    • Author(s)
      Yuki Yonemoto and Shunsuke Inenaga
    • Organizer
      SPIRE 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] Edit and Alphabet-Ordering Sensitivity of Lex-parse2024

    • Author(s)
      Yuto Nakashima, Dominik Koeppl, Mitsuru Funakoshi, Shunsuke Inenaga, and Hideo Bannai
    • Organizer
      MFCS 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space2024

    • Author(s)
      Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, and Yuta Fujishige
    • Organizer
      IWOCA 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] Computing maximal palindromes in non-standard matching models2024

    • Author(s)
      Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
    • Organizer
      IWOCA 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] Computing Longest Common Subsequence under Cartesian-Tree Matching Model2024

    • Author(s)
      Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, and Shunsuke Inenaga
    • Organizer
      IWOCA 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] The multiplicative sensitivity of CDAWGs is constant2024

    • Author(s)
      Rikuya Hamai and Shunsuke Inenaga
    • Organizer
      WAAC 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] Enumerating Maximal Repeats in a Text Based on Bidirectional Indices2024

    • Author(s)
      Yuta Tsuruzono, Hiroki Arimura and Shunsuke Inenaga
    • Organizer
      WAAC 2024
    • Related Report
      2024 Research-status Report
    • Int'l Joint Research
  • [Presentation] CDAWGに基づく極小希少文字列の列挙2024

    • Author(s)
      稲永 俊介, 三重野 琢也, 有村 博紀 , 舩越 満, 藤重 雄大
    • Organizer
      夏のLAシンポジウム2024
    • Related Report
      2024 Research-status Report
  • [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
  • [Book] Proceesings of Combinatorial Pattern Matching (CPM 2024)2024

    • Author(s)
      Shunsuke Inenaga, Simon J. Puglisi
    • Total Pages
      -
    • Publisher
      Schloss Dagstuhl - Leibniz Center for Informatics
    • ISBN
      978-3-95977-326-3
    • Related Report
      2024 Research-status Report
  • [Remarks]

    • URL

      https://shunsuke-inenaga.github.io/

    • Related Report
      2024 Research-status Report

URL: 

Published: 2022-04-19   Modified: 2025-12-26  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi