Takuya MIENO
| Department of Computer and Network Engineering | Assistant Professor |
| Cluster I (Informatics and Computer Engineering) | Assistant Professor |
Researcher Information
Career
Educational Background
Member History
- Aug. 2026 - Present
38th Annual Symposium on Combinatorial Pattern Matching (CPM 2027) Program Committee - Apr. 2026 - Present
情報処理学会2026年度代表会員 - Jun. 2025 - Present
九州大学大学院システム情報科学府 博士後期課程アドバイザリ委員会 委員 - Apr. 2024 - Present
会誌編集委員会 専門委員会 基礎・理論分野 主査, 情報処理学会 - Mar. 2026 - Oct. 2026
33rd International Symposium on String Processing and Information Retrieval (SPIRE 2026) Program Committee - May 2025 - Jun. 2026
情報処理学会 第88回全国大会 プログラム委員 - Apr. 2025 - Mar. 2026
情報処理学会2025年度代表会員 - Apr. 2025 - Sep. 2025
32nd International Symposium on String Processing and Information Retrieval (SPIRE 2025) Program Committee - May 2024 - Jun. 2025
情報処理学会第87回全国大会 プログラム委員 - May 2023 - Jun. 2024
35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024) Organising Committee - Apr. 2023 - Mar. 2024
会誌編集委員会 専門委員会 基礎・理論分野 幹事, 情報処理学会
Research Activity Information
Award
Paper
- Online computation of maximal closed substrings
Hiroki Shibata; Haruki Umezaki; Takuya Mieno; Yuto Nakashima; Shunsuke Inenaga
33rd International Symposium on String Processing and Information Retrieval (SPIRE 2026), Oct. 2026, Peer-reviwed
International conference proceedings, English - Sliding suffix trees revisited
Laurentius Leonard; Shunsuke Inenaga; Hideo Bannai; Takuya Mieno
Last, Prague Stringology Conference 2026 (PSC 2026), Aug. 2026, Peer-reviwed
International conference proceedings, English - Relaxation of Square-Freeness
Hiroki Shibata; Takuya Mieno; Dominik Köppl; Shunsuke Inenaga
Prague Stringology Conference 2026 (PSC 2026), 58-70, Aug. 2026, Peer-reviwed
International conference proceedings, English - Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis
Mutsunori Banbara; Hideo Bannai; Takashi Horiyama; Dominik Köppl; Takuya Mieno; Hidetomo Nabeshima
Proceedings of the TwentyThird International Conference on Principles of Knowledge Representation and Reasoning, International Joint Conferences on Artificial Intelligence Organization, 700-710, Jul. 2026, Peer-reviwed, We develop an Answer Set Programming (ASP)-based approach forcomputing the smallest bidirectional macro schemes (BMSs),a fundamental NP-hard optimization problem in dictionary-based compression.Our approach relies on high-level ASP encodings and delegates both thegrounding and solving tasks to an off-the-shelf ASP solver.The proposed encoding is compact and extensible, andleverages advanced ASP techniques to improve scalability,including ASP modulo acyclicity and refined declarative encodings of acyclicity constraints.We further show that our ASP encoding can be naturally extended to computethe smallest straight-line programs (SLPs),another important NP-hard measure of repetitiveness.Furthermore, we establish the competitiveness of our approach byempirically contrasting it with a more dedicated MaxSAT-based approach.
International conference proceedings, English - Compact Representation of Maximal Palindromes
Takuya Mieno
Lead, 37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026), 4:1-4:12, Jun. 2026, Peer-reviwed
International conference proceedings, English - The Smallest String Attractors of Fibonacci and Period-Doubling Words.
Mutsunori Banbara; Hideo Bannai; Peaker Guo; Dominik Köppl; Takuya Mieno; Yoshio Okamoto
37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026), 33:1-33:21, Jun. 2026, Peer-reviwed
International conference proceedings, English - Longest Unbordered Factors on Run-Length Encoded Strings
Shoma Sekizaki; Takuya Mieno
Last, SPIRE 2025, Sep. 2025, Peer-reviwed
International conference proceedings, English - On the Number of MUSs Crossing a Position
Hiroto Fujimaru; Takuya Mieno; Shunsuke Inenaga
SPIRE 2025, Sep. 2025, Peer-reviwed
International conference proceedings, English - Space-Efficient Online Computation of String Net Occurrences
Takuya Mieno; Shunsuke Inenaga
Lead, CPM 2025, Jun. 2025, Peer-reviwed
International conference proceedings, English - Sorted Consecutive Occurrence Queries in Substrings
Waseem Akram; Takuya Mieno
Last, CPM 2025, Jun. 2025, Peer-reviwed
International conference proceedings, English - Subsequence Matching and LCS with Segment Number Constraints
Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara
CIAC 2025, May 2025, Peer-reviwed
International conference proceedings - Computing maximal palindromes in non-standard matching models
Takuya Mieno; Mitsuru Funakoshi; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Lead, Information and Computation, Elsevier BV, 304, 105283-105283, May 2025, Peer-reviwed
Scientific journal - Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Takuya Mieno; Shun Takahashi; Kazuhisa Seto; Takashi Horiyama
Lead, SOFSEM 2025, Feb. 2025, Peer-reviwed
International conference proceedings - Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings
Kouta Okabe; Takuya Mieno; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai
String Processing and Information Retrieval, Springer Nature Switzerland, 331-344, 20 Sep. 2023, Peer-reviwed
International conference proceedings - Finding top-k longest palindromes in substrings
Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama
Corresponding, Theoretical Computer Science, Elsevier BV, 114183-114183, Sep. 2023, Peer-reviwed
Scientific journal - Data Structures for Computing Unique Palindromes in Static and Non-Static Strings
Takuya Mieno; Mitsuru Funakoshi
Lead, Algorithmica, Springer Science and Business Media LLC, 30 Aug. 2023, Peer-reviwed
Scientific journal - Computing Palindromes on a Trie in Linear Time
Takuya Mieno; Mitsuru Funakoshi; Shunsuke Inenaga
Lead, 33rd International Symposium on Algorithms and Computation (ISAAC 2022), 248, Dec. 2022, Peer-reviwed
International conference proceedings - Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions
Laurentius Leonard; Shunsuke Inenaga; Hideo Bannai; Takuya Mieno
String Processing and Information Retrieval, Springer International Publishing, 24-37, 01 Nov. 2022, Peer-reviwed
International conference proceedings - Combinatorics of minimal absent words for a sliding window
Tooru Akagi; Yuki Kuhara; Takuya Mieno; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Theoretical Computer Science, Elsevier BV, 927, 109-119, Jun. 2022, Peer-reviwed
Scientific journal - Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
Takuya Mieno; Mitsuru Funakoshi
Lead, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 13270 LNCS, 425-438, 29 May 2022, Peer-reviwed
International conference proceedings - Computing Minimal Unique Substrings for a Sliding Window
Takuya Mieno; Yuta Fujishige; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Lead, Algorithmica, Springer Science and Business Media LLC, 84, 3, 670-693, Mar. 2022, Peer-reviwed, Abstract
A substring u of a string T is called a minimal unique substring (MUS) of T if u occurs exactly once in T and any proper substring of u occurs at least twice in T. In this paper, we study the problem of computing MUSs for a sliding window over a given string T. We first show how the set of MUSs can change when the window slides over T. We then present an $$O(n\log \sigma ')$$-time and O(d)-space algorithm to compute MUSs for a sliding window of size d over the input string T of length n, where $$\sigma '\le d$$ is the maximum number of distinct characters in every window.
Scientific journal - Palindromic trees for a sliding window and its applications
Takuya Mieno; Kiichi Watanabe; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Lead, Information Processing Letters, Elsevier BV, 173, 106174-106174, Jan. 2022, Peer-reviwed
Scientific journal - A Separation of γ and b via Thue–Morse Words
Hideo Bannai; Mitsuru Funakoshi; Tomohiro I; Dominik Köppl; Takuya Mieno; Takaaki Nishimoto
String Processing and Information Retrieval, Springer International Publishing, 12944 LNCS, 167-178, Sep. 2021, Peer-reviwed
International conference proceedings - On the Approximation Ratio of LZ-End to LZ77
Takumi Ideue; Takuya Mieno; Mitsuru Funakoshi; Yuto Nakashima; Shunsuke Inenaga; Masayuki Takeda
String Processing and Information Retrieval, Springer International Publishing, 12944 LNCS, 114-126, Sep. 2021, Peer-reviwed
International conference proceedings - String Sanitization Under Edit Distance: Improved and Generalized.
Takuya Mieno; Solon P. Pissis; Leen Stougie; Michelle Sweering
Lead, 32nd Annual Symposium on Combinatorial Pattern Matching(CPM), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 19-18, Jun. 2021, Peer-reviwed
International conference proceedings - Space-efficient algorithms for computing minimal/shortest unique substrings
Takuya Mieno; Dominik Köppl; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Lead, Theoretical Computer Science, Elsevier BV, 845, 230-242, Dec. 2020, Peer-reviwed
Scientific journal, English - Minimal Unique Substrings and Minimal Absent Words in a Sliding Window
Takuya Mieno; Yuki Kuhara; Tooru Akagi; Yuta Fujishige; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Lead, SOFSEM 2020: Theory and Practice of Computer Science, Springer International Publishing, 148-160, 2020, Peer-reviwed
In book - Algorithms and combinatorial properties on shortest unique palindromic substrings
Hiroe Inoue; Yuto Nakashima; Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Journal of Discrete Algorithms, Elsevier BV, 52-53, 122-132, Sep. 2018, Peer-reviwed
Scientific journal, English - Tight Bounds on the Maximum Number of Shortest Unique Substrings.
Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Lead, 28th Annual Symposium on Combinatorial Pattern Matching(CPM), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 24-11, 2017, Peer-reviwed
International conference proceedings - Shortest unique substring queries on run-length encoded strings
Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
Lead, Leibniz International Proceedings in Informatics, LIPIcs, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 58, 01 Aug. 2016, Peer-reviwed
International conference proceedings, English
Lectures, oral presentations, etc.
- Compact Representation of Maximal Palindromes
Takuya Mieno
Oral presentation, English, 37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026), Peer-reviewed
17 Jun. 2026
15 Jun. 2026- 17 Jun. 2026 - 極大回文部分文字列のコンパクト表現
三重野琢也
Oral presentation, 第205回アルゴリズム研究会
13 Nov. 2025
13 Nov. 2025- 14 Nov. 2025 - Space-Efficient Online Computation of String Net Occurrences
Takuya Mieno; Shunsuke Inenaga
CPM 2025, Peer-reviewed
19 Jun. 2025
17 Jun. 2025- 19 Jun. 2025 - 部分文字列中のトップ k 近接連続出現クエリ
Waseem Akram; 三重野琢也
第203回アルゴリズム研究会
08 May 2025
07 May 2025- 08 May 2025 - Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
Takuya Mieno; Shun Takahashi; Kazuhisa Seto; Takashi Horiyama
SOFSEM 2025, Peer-reviewed
22 Jan. 2025
20 Jan. 2025- 23 Jan. 2025 - 閉部分文字列数え上げのためのオンライン及びオフラインアルゴリズム
三重野琢也; 高橋駿; 脊戸和寿; 堀山 貴史
Oral presentation, Japanese, 第200回アルゴリズム研究会
26 Nov. 2024
26 Nov. 2024- 27 Nov. 2024 - Computing maximal palindromes in non-standard matching models
Mitsuru Funakoshi; Takuya Mieno; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda
IWOCA 2024, Peer-reviewed
03 Jul. 2024
01 Jul. 2024- 03 Jul. 2024 - Shortest cover after edit
Kazuki Mitani; Takuya Mieno; Kazuhisa Seto; Takashi Horiyama
CPM 2024, Peer-reviewed
26 Jun. 2024
25 Jun. 2024- 27 Jun. 2024 - 基盤的文字列索引構造の拡張とその応用
三重野琢也
2024年 電子情報通信学会 総合大会 COMP-AFSA学生シンポジウム, Invited
06 Mar. 2024 - Computing Palindromes on a Trie in Linear Time
Takuya Mieno; Mitsuru Funakoshi; Shunsuke Inenaga
ISAAC 2022, Peer-reviewed
20 Dec. 2022
19 Dec. 2022- 21 Dec. 2022 - デカルト木部分列照合問題
三重野琢也
Invited oral presentation, JCCA-2022・離散数学とその応用研究集会2022, Invited
19 Aug. 2022
17 Aug. 2022- 19 Aug. 2022 - RePair Grammars are the Smallest Grammars for Fibonacci Words
Takuya Mieno; Shunsuke Inenaga; Takashi Horiyama
CPM 2022, Peer-reviewed
27 Jun. 2022
27 Jun. 2022- 29 Jun. 2022 - Shortest Unique Palindromic Substring Queries in Semi-dynamic Settings
Takuya Mieno; Mitsuru Funakoshi
IWOCA 2022, Peer-reviewed
07 Jun. 2022
07 Jun. 2022- 09 Jun. 2022
Research Themes
- 不在/稀少文字列の計算技法と一般化文字列への展開
三重野 琢也
日本学術振興会, 科学研究費助成事業, 電気通信大学, 若手研究, 24K20734
Apr. 2024 - Mar. 2027 - 文字列処理におけるNP困難問題の高速解法の追求
三重野 琢也
日本学術振興会, 科学研究費助成事業 学術変革領域研究(A), 電気通信大学, 学術変革領域研究(A), 23H04381
01 Apr. 2023 - 31 Mar. 2025 - 動的文字列処理に対するアルゴリズム技法の開発と計算限界の解明
三重野 琢也
日本学術振興会, 科学研究費助成事業 研究活動スタート支援, 電気通信大学, 研究活動スタート支援, 22K21273
31 Aug. 2022 - 31 Mar. 2024 - 最先端文字列アルゴリズム理論に基づく巨大データ解析技法
三重野 琢也
日本学術振興会, 科学研究費助成事業 特別研究員奨励費, 九州大学, 特別研究員奨励費, 前から読んでも後ろから読んでも同じ文字列を回文という。文字列から回文構造を発見する問題は特に生物情報科学の分野で重要視され、盛んに研究されている。 本研究期間においては、文字列中の回文構造を効率よく検出するためのデータ構造・アルゴリズムの開発を主として行った。他にも文字列圧縮アルゴリズムの性能に関する研究などを行い、以下の6つの成果を得た。 1つ目の成果は、入力文字列に対して特定の編集操作が許された設定において、ユニーク回文部分文字列を計算するアルゴリズムの提案である。ユニーク回文部分文字列とは、文字列中にちょうど一度だけ出現する回文である。本成果は国際会議 SPIRE 2021 に採択されており、さらにその結果を応用した研究成果は国際会議 IWOCA 2022 に投稿された。 2つ目の成果は、双方向マクロスキームと呼ばれる文字列圧縮形式に対する圧縮性能限界の解明である。3つ目の成果は、LZEnd 圧縮と呼ばれる文字列圧縮手法の圧縮性能に関する新たな結果の証明である。文字列圧縮手法の性能を比較・解析する研究は文字列圧縮研究の分野で近年盛んに行われており、特に2つ目の成果は同分野で注目されていた未解決問題のひとつを解決したものである。2つ目と3つ目の成果は国際会議 SPIRE 2021 に採択されている。 4つ目の成果は、RePair という文字列圧縮手法の圧縮性能に関する新たな結果の証明である。5つ目の成果は、デカルト木部分列照合問題と呼ばれる緩和された部分列照合問題に対するアルゴリズムの提案である。6つ目の成果は、圧縮表現された文字列上で、その文字列中に存在しない不在文字列を計算するアルゴリズムの提案である。上記3つの成果はいずれも国際会議 CPM 2022 に採択されている。, 20J11983
24 Apr. 2020 - 31 Mar. 2022
Academic Contribution Activities
- CPM 2027 Program Committee
Academic society etc, Planning etc, Aug. 2026 - Present - SPIRE 2026 Program Committee
Planning etc, Mar. 2026 - Oct. 2026 - Computer Science Review review
Peer review, Apr. 2026 - Sep. 2026 - Theory of Computing Systems review
Peer review, Jan. 2026 - Aug. 2026 - IEICE Transactions on Information and Systems review
Peer review, Apr. 2026 - May 2026 - Information processing letters review
Peer review, Oct. 2025 - May 2026 - Acta Informatica, reviewer
Peer review, Nov. 2025 - Mar. 2026 - CPM 2026 subreviewer
Peer review, Nov. 2025 - Dec. 2025 - Theory of Computing Systems, reviewer
Peer review, Jun. 2025 - Sep. 2025 - SPIRE 2025 Program Committee
Academic society etc, Planning etc, Apr. 2025 - Sep. 2025 - ISAAC 2025 subreviewer
Peer review, Jul. 2025 - Aug. 2025 - ESA 2025 subreviewer
Peer review, Apr. 2025 - May 2025 - DLT 2025 subreviewer
Peer review, Apr. 2025 - May 2025 - DCFS 2025 subreviewer
Peer review, Apr. 2025 - Apr. 2025 - Information Processing Letters, reviewer
Peer review, Nov. 2024 - Apr. 2025 - ICALP 2025 subreviewer
Peer review, Feb. 2025 - Mar. 2025 - CPM 2025 subreviewer
Peer review, Nov. 2024 - Dec. 2024 - CPM 2024 Organising Committee
Planning etc, 25 Jun. 2024 - 27 Jun. 2024 - Pre-CPM 2024 summer school Co-chair
Planning etc, 20 Jun. 2024 - 21 Jun. 2024 - CPM 2022 subreviewer
Peer review, 2022 - 2022 - SPIRE 2021 subreviewer
Peer review, 2021 - 2021 - PSC 2019 subreviewer
Peer review, 2019 - 2019