A Practical Algorithm to Find the Best Episode Patterns. - Masahiro Hirao; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Discovery Science, 2001)

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (SPIRE, 2001)

Construction of the CDAWG for a Trie. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Stringology, 2001)

The Minimum DAWG for All Suffixes of a String and Its Applications. - Shunsuke Inenaga; Masayuki Takeda; Ayumi Shinohara; Hiromasa Hoshino; Setsuo Arikawa (CPM, 2002)

Discovering Best Variable-Length-Don't-Care Patterns. - Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Discovery Science, 2002)

Finding Best Patterns Practically. - Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Masahiro Hirao; Hiromasa Hoshino; Shunsuke Inenaga (Progress in Discovery Science, 2002)

Space-Economical Construction of Index Structures for All Suffixes of a String. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Hideo Bannai; Setsuo Arikawa (MFCS, 2002)

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. - Masayuki Takeda; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Setsuo Arikawa (Discovery Science, 2003)

Inferring Strings from Graphs and Arrays. - Hideo Bannai; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda (MFCS, 2003)

Linear-Time Off-Line Text Compression by Longest-First Substitution. - Shunsuke Inenaga; Takashi Funamoto; Masayuki Takeda; Ayumi Shinohara (SPIRE, 2003)

A Note on Randomized Algorithm for String Matching with Mismatches. - Kensuke Baba; Ayumi Shinohara; Masayuki Takeda; Shunsuke Inenaga; Setsuo Arikawa (Nord. J. Comput., 2003)

Bidirectional Construction of Suffix Trees. - Shunsuke Inenaga (Nord. J. Comput., 2003)

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. - Shunsuke Inenaga; Hideo Bannai; Heikki Hyyrö; Ayumi Shinohara; Masayuki Takeda; Kenta Nakai; Satoru Miyano (Discovery Science, 2004)

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda (Developments in Language Theory, 2004)

Finding Missing Patterns. - Shunsuke Inenaga; Teemu Kivioja; Veli Mäkinen (WABI, 2004)

Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. - Hideo Bannai; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Satoru Miyano (J. Bioinform. Comput. Biol., 2004)

Compact directed acyclic word graphs for a sliding window. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (J. Discrete Algorithms, 2004)

Ternary directed acyclic word graphs. - Satoru Miyamoto; Shunsuke Inenaga; Masayuki Takeda; Ayumi Shinohara (Theor. Comput. Sci., 2004)

Practical Algorithms for Pattern Based Linear Regression. - Hideo Bannai; Kohei Hatano; Shunsuke Inenaga; Masayuki Takeda (Discovery Science, 2005)

Fully Incremental LCS Computation. - Yusuke Ishida; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda (FCT, 2005)

Composite Pattern Discovery for PCR Application. - Stanislav Angelov; Shunsuke Inenaga (SPIRE, 2005)

On-line construction of compact directed acyclic word graphs. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Giancarlo Mauri; Giulio Pavesi (Discret. Appl. Math., 2005)

A fully compressed pattern matching algorithm for simple collage systems. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda (Int. J. Found. Comput. Sci., 2005)

On-Line Linear-Time Construction of Word Suffix Trees. - Shunsuke Inenaga; Masayuki Takeda (CPM, 2006)

A New Family of String Classifiers Based on Local Relatedness. - Yasuto Higa; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Discovery Science, 2006)

Sparse Directed Acyclic Word Graphs. - Shunsuke Inenaga; Masayuki Takeda (SPIRE, 2006)

Sparse compact directed acyclic word graphs. - Shunsuke Inenaga; Masayuki Takeda (Stringology, 2006)

Efficient Computation of Substring Equivalence Classes with Suffix Arrays. - Kazuyuki Narisawa; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2007)

Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. - Ryosuke Nakamura; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (DCC, 2007)

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program. - Wataru Matsubara; Shunsuke Inenaga; Ayumi Shinohara (Structure-Based Compression of Complex Massive Data, 2008)

String Kernels Based on Variable-Length-Don't-Care Patterns. - Kazuyuki Narisawa; Hideo Bannai; Kohei Hatano; Shunsuke Inenaga; Masayuki Takeda (Discovery Science, 2008)

Computing Longest Common Substring and All Palindromes from Compressed Strings. - Wataru Matsubara; Shunsuke Inenaga; Akira Ishino; Ayumi Shinohara; Tomoyuki Nakamura; Kazuo Hashimoto (SOFSEM, 2008)

Parameterized Suffix Arrays for Binary Strings. - Satoshi Deguchi; Fumihito Higashijima; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (Stringology, 2008)

Reachability on Suffix Tree Graphs. - Yasuto Higa; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (Int. J. Found. Comput. Sci., 2008)

Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. - Wataru Matsubara; Shunsuke Inenaga; Ayumi Shinohara (CATS, 2009)

Lightweight Parameterized Suffix Array Construction. - Tomohiro I; Satoshi Deguchi; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (IWOCA, 2009)

Counting Parameterized Border Arrays for a Binary Alphabet. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (LATA, 2009)

Modeling Costs of Access Control with Various Key Management Systems. - Tomomi Yamasaki; Shunsuke Inenaga; Daisuke Ikeda; Hiroto Yasuura (PDPTA, 2009)

Linear-Time Text Compression by Longest-First Substitution. - Ryosuke Nakamura; Shunsuke Inenaga; Hideo Bannai; Takashi Funamoto; Masayuki Takeda; Ayumi Shinohara (Algorithms, 2009)

Efficient algorithms to compute compressed longest common substrings and compressed palindromes. - Wataru Matsubara; Shunsuke Inenaga; Akira Ishino; Ayumi Shinohara; Tomoyuki Nakamura; Kazuo Hashimoto (Theor. Comput. Sci., 2009)

Verifying a Parameterized Border Array in O(n1.5) Time. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2010)

An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services. - Toru Nakamura; Shunsuke Inenaga; Daisuke Ikeda; Kensuke Baba; Hiroto Yasuura (ICCSA (4), 2010)

Counting and Verifying Maximal Palindromes. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2010)

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. - Wataru Matsubara; Shunsuke Inenaga; Ayumi Shinohara (Chic. J. Theor. Comput. Sci., 2010)

An Anonymous Authentication Protocol with Single-database PIR. - Toru Nakamura; Shunsuke Inenaga; Kensuke Baba; Daisuke Ikeda; Hiroto Yasuura (AISC, 2011)

Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. - Takanori Yamamoto; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CPM, 2011)

Computing Longest Common Substring/Subsequence of Non-linear Texts. - Kouji Shimohira; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2011)

Restructuring Compressed Texts without Explicit Decompression - Keisuke Goto 001; Shirou Maruyama; Shunsuke Inenaga; Hideo Bannai; Hiroshi Sakamoto; Masayuki Takeda (CoRR, 2011)

Computing q-gram Frequencies on Collage Systems - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CoRR, 2011)

Towards Modeling Stored-value Electronic Money Systems. - Shunsuke Inenaga; Kenichirou Oyama; Hiroto Yasuura (Inf. Media Technol., 2011)

Missing pattern discovery. - Stanislav Angelov; Shunsuke Inenaga; Teemu Kivioja; Veli Mäkinen (J. Discrete Algorithms, 2011)

Password Based Anonymous Authentication with Private Information Retrieval. - Toru Nakamura; Shunsuke Inenaga; Daisuke Ikeda; Kensuke Baba; Hiroto Yasuura (J. Digit. Inf. Manag., 2011)

Verifying and enumerating parameterized border arrays. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2011)

Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CPM, 2012)

Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (SOFSEM, 2012)

Efficient LZ78 Factorization of Grammar Compressed Text. - Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (SPIRE, 2012)

The Position Heap of a Trie. - Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2012)

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding - Jun-ichi Yamamoto; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CoRR, 2012)

Finding Characteristic Substrings from Compressed Texts. - Shunsuke Inenaga; Hideo Bannai (Int. J. Found. Comput. Sci., 2012)

An efficient algorithm to test square-freeness of strings compressed by straight-line programs. - Hideo Bannai; Travis Gagie; Tomohiro I; Shunsuke Inenaga; Gad M. Landau; Moshe Lewenstein (Inf. Process. Lett., 2012)

Converting SLP to LZ78 in almost Linear Time. - Hideo Bannai; Pawel Gawrychowski; Shunsuke Inenaga; Masayuki Takeda (CPM, 2013)

Efficient Lyndon Factorization of Grammar Compressed Text. - Tomohiro I; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2013)

From Run Length Encoding to LZ78 and Back Again. - Yuya Tamakoshi; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (DCC, 2013)

Computing Convolution on Grammar-Compressed Text. - Toshiya Tanaka; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (DCC, 2013)

Permuted Pattern Matching on Multi-track Strings. - Takashi Katsura; Kazuyuki Narisawa; Ayumi Shinohara; Hideo Bannai; Shunsuke Inenaga (SOFSEM, 2013)

Computing Reversed Lempel-Ziv Factorization Online. - Shiho Sugimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2013)

Foreword. - Shunsuke Inenaga; Carlos Martín-Vide (Int. J. Comput. Math., 2013)

Fast q-gram mining on SLP compressed strings. - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (J. Discrete Algorithms, 2013)

Palindrome pattern matching. - Tomohiro I; Shunsuke Inenaga; Masayuki Takeda (Theor. Comput. Sci., 2013)

Computing Palindromic Factorizations and Palindromic Covers On-line. - Tomohiro I; Shiho Sugimoto; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2014)

Shortest Unique Substrings Queries in Optimal Time. - Kazuya Tsuruta; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SOFSEM, 2014)

Faster Compact On-Line Lempel-Ziv Factorization. - Jun-ichi Yamamoto; Tomohiro I; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (STACS, 2014)

Computing Abelian Covers and Abelian Runs. - Shohei Matsuda; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2014)

Inferring strings from suffix trees and links on a binary alphabet. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Discret. Appl. Math., 2014)

An Opportunistic Text Indexing Structure Based on Run Length Encoding. - Yuya Tamakoshi; Keisuke Goto 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CIAC, 2015)

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CPM, 2015)

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. - Yoshiaki Matsuoka; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2015)

Diverse Palindromic Factorization Is NP-complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (DLT, 2015)

Inferring Strings from Full Abelian Periods. - Makoto Nishida; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2015)

A new characterization of maximal repetitions by Lyndon trees. - Hideo Bannai; Tomohiro I; Shunsuke Inenaga; Yuto Nakashima 001; Masayuki Takeda; Kazuya Tsuruta (SODA, 2015)

Efficient Algorithms for Longest Closed Factor Array. - Hideo Bannai; Shunsuke Inenaga; Tomasz Kociumaka; Arnaud Lefebvre; Jakub Radoszewski; Wojciech Rytter; Shiho Sugimoto; Tomasz Walen (SPIRE, 2015)

A Faster Algorithm for Computing Maximal alpha -gapped Repeats in a String. - Yuka Tanimura; Yuta Fujishige; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2015)

A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications. - Shunsuke Inenaga (Stringology, 2015)

Computing Left-Right Maximal Generic Words. - Takaaki Nishimoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2015)

Diverse Palindromic Factorization is NP-Complete. - Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (CoRR, 2015)

Efficiently Finding All Maximal $α$-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (CoRR, 2015)

Dynamic index, LZ factorization, and LCE queries in compressed space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2015)

Fully-online construction of suffix trees and DAWGs for multiple texts. - Takuya Takagi; Shunsuke Inenaga; Hiroki Arimura (CoRR, 2015)

Detecting regularities on grammar-compressed strings. - Tomohiro I; Wataru Matsubara; Kouji Shimohira; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Kazuyuki Narisawa; Ayumi Shinohara (Inf. Comput., 2015)

Constructing LZ78 tries and position heaps in linear time for large alphabets. - Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Process. Lett., 2015)

Dynamic edit distance table under a general weighted cost function. - Heikki Hyyrö; Kazuyuki Narisawa; Shunsuke Inenaga (J. Discrete Algorithms, 2015)

Compressed automata for dictionary matching. - Tomohiro I; Takaaki Nishimoto; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2015)

Factorizing a String into Squares in Linear Time. - Yoshiaki Matsuoka; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Florin Manea (CPM, 2016)

Fully-online Construction of Suffix Trees for Multiple Texts. - Takuya Takagi; Shunsuke Inenaga; Hiroki Arimura (CPM, 2016)

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. - Yuka Tanimura; Tomohiro I; Hideo Bannai; Shunsuke Inenaga; Simon J. Puglisi; Masayuki Takeda (CPM, 2016)

Finding Gapped Palindromes Online. - Yuta Fujishige; Michitaro Nakamura; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2016)

Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. - Yuta Fujishige; Yuki Tsujimaru; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (MFCS, 2016)

Shortest Unique Substring Queries on Run-Length Encoded Strings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (MFCS, 2016)

Fully Dynamic Data Structure for LCE Queries in Compressed Space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (MFCS, 2016)

Compacting a Dynamic Edit Distance Table by RLE Compression. - Heikki Hyyrö; Shunsuke Inenaga (SOFSEM, 2016)

Efficiently Finding All Maximal alpha-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (STACS, 2016)

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time. - Hiroe Inoue; Yoshiaki Matsuoka; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2016)

Tight bound on the maximum number of shortest unique substrings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2016)

Closed factorization. - Golnaz Badkobeh; Hideo Bannai; Keisuke Goto 001; Tomohiro I; Costas S. Iliopoulos; Shunsuke Inenaga; Simon J. Puglisi; Shiho Sugimoto (Discret. Appl. Math., 2016)

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. - Tomohiro I; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2016)

Generalized pattern matching and periodicity under substring consistent equivalence relations. - Yoshiaki Matsuoka; Takahiro Aoki; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2016)

Computing All Distinct Squares in Linear Time for Integer Alphabets. - Hideo Bannai; Shunsuke Inenaga; Dominik Köppl (CPM, 2017)

Faster STR-IC-LCS Computation via RLE. - Keita Kuboi; Yuta Fujishige; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2017)

Tight Bounds on the Maximum Number of Shortest Unique Substrings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2017)

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. - Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2017)

Shortest Unique Palindromic Substring Queries in Optimal Time. - Yuto Nakashima 001; Hiroe Inoue; Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2017)

Computing Abelian String Regularities Based on RLE. - Shiho Sugimoto; Naoki Noda; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2017)

Small-Space LCE Data Structure with Constant-Time Queries. - Yuka Tanimura; Takaaki Nishimoto; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (MFCS, 2017)

Computing Longest Single-arm-gapped Palindromes in a String. - Shintaro Narisada; Diptarama; Kazuyuki Narisawa; Shunsuke Inenaga; Ayumi Shinohara (SOFSEM, 2017)

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. - Yohei Ueki; Diptarama; Masatoshi Kurihara; Yoshiaki Matsuoka; Kazuyuki Narisawa; Ryo Yoshinaka; Hideo Bannai; Shunsuke Inenaga; Ayumi Shinohara (SOFSEM, 2017)

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. - Golnaz Badkobeh; Travis Gagie; Shunsuke Inenaga; Tomasz Kociumaka; Dmitry Kosolobov; Simon J. Puglisi (SPIRE, 2017)

Order Preserving Pattern Matching on Trees and DAGs. - Temma Nakamura; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2017)

Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. - Takuya Takagi; Keisuke Goto 001; Yuta Fujishige; Shunsuke Inenaga; Hiroki Arimura (SPIRE, 2017)

On Reverse Engineering the Lyndon Tree. - Yuto Nakashima 001; Takuya Takagi; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2017)

Efficient Computation of Substring Equivalence Classes with Suffix Arrays. - Kazuyuki Narisawa; Hideharu Hiratsuka; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Algorithmica, 2017)

Computing Abelian regularities on RLE strings. - Shiho Sugimoto; Naoki Noda; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2017)

Small-space encoding LCE data structure with constant-time queries. - Yuka Tanimura; Takaaki Nishimoto; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CoRR, 2017)

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. - Takuya Takagi; Shunsuke Inenaga; Kunihiko Sadakane; Hiroki Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017)

The "Runs" Theorem. - Hideo Bannai; Tomohiro I; Shunsuke Inenaga; Yuto Nakashima 001; Masayuki Takeda; Kazuya Tsuruta (SIAM J. Comput., 2017)

Inferring strings from Lyndon factorization. - Yuto Nakashima 001; Takashi Okabe; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2017)

Faster Online Elastic Degenerate String Matching. - Kotaro Aoyama; Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Longest substring palindrome after edit. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Lyndon Factorization of Grammar Compressed Texts Revisited. - Isamu Furuya; Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Computing longest common square subsequences. - Takafumi Inoue; Shunsuke Inenaga; Heikki Hyyrö; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Longest Lyndon Substring After Edit. - Yuki Urabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Block Palindromes: A New Generalization of Palindromes. - Keisuke Goto 001; Tomohiro I; Hideo Bannai; Shunsuke Inenaga (SPIRE, 2018)

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. - Yuki Kuhara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2018)

Right-to-left Online Construction of Parameterized Position Heaps. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2018)

O(n log n)-time Text Compression by LZ-style Longest First Substitution. - Akihiro Nishi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2018)

Diverse Palindromic Factorization is NP-Complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Shiho Sugimoto (Int. J. Found. Comput. Sci., 2018)

Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions. - Heikki Hyyrö; Shunsuke Inenaga (Int. J. Found. Comput. Sci., 2018)

A hardness result and new algorithm for the longest common palindromic subsequence problem. - Shunsuke Inenaga; Heikki Hyyrö (Inf. Process. Lett., 2018)

Algorithms and combinatorial properties on shortest unique palindromic substrings. - Hiroe Inoue; Yuto Nakashima 001; Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (J. Discrete Algorithms, 2018)

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (Theory Comput. Syst., 2018)

The Parameterized Position Heap of a Trie. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CIAC, 2019)

Faster Queries for Longest Substring Palindrome After Block Edit. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

Online Algorithms for Constructing Linear-Size Suffix Trie. - Diptarama Hendrian; Takuya Takagi; Shunsuke Inenaga (CPM, 2019)

Computing Runs on a Trie. - Ryo Sugahara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. - Yuki Urabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

MR-RePair: Grammar Compression Based on Maximal Repeats. - Isamu Furuya; Takuya Takagi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Takuya Kida (DCC, 2019)

An Improved Data Structure for Left-Right Maximal Generic Words Problem. - Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2019)

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. - Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2019)

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2019)

On Longest Common Property Preserved Substring Queries. - Kazuki Kai; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Tomasz Kociumaka (SPIRE, 2019)

Compact Data Structures for Shortest Unique Substring Queries. - Takuya Mieno; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2019)

k-Abelian Pattern Matching: Revisited, Corrected, and Extended. - Golnaz Badkobeh; Hideo Bannai; Maxime Crochemore; Tomohiro I; Shunsuke Inenaga; Shiho Sugimoto (Stringology, 2019)

Computing Maximal Palindromes and Distinct Palindromes in a Trie. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2019)

Dynamic Packed Compact Tries Revisited. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2019)

Efficient dynamic dictionary matching with DAWGs and AC-automata. - Diptarama Hendrian; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (Theor. Comput. Sci., 2019)

On the size of the smallest alphabet for Lyndon trees. - Yuto Nakashima 001; Takuya Takagi; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2019)

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Ayumi Shinohara (CPM, 2020)

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. - Katsuhito Nakashima; Noriki Fujisato; Diptarama Hendrian; Yuto Nakashima 001; Ryo Yoshinaka; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda (CPM, 2020)

A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. - Yoshifumi Sakai; Shunsuke Inenaga (ISAAC, 2020)

Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. - Shunsuke Inenaga (LATIN, 2020)

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. - Takuya Mieno; Yuki Kuhara; Tooru Akagi; Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SOFSEM, 2020)

Faster STR-EC-LCS Computation. - Kohei Yamada; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SOFSEM, 2020)

Longest Square Subsequence Problem Revisited. - Takafumi Inoue; Shunsuke Inenaga; Hideo Bannai (SPIRE, 2020)

On Repetitiveness Measures of Thue-Morse Words. - Kanaru Kutsukake; Takuya Matsumoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2020)

Towards Efficient Interactive Computation of Dynamic Time Warping Distance. - Akihiro Nishi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2020)

Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. - Shunsuke Inenaga (Stringology, 2020)

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. - Takuya Takagi; Shunsuke Inenaga; Hiroki Arimura; Dany Breslauer; Diptarama Hendrian (Algorithmica, 2020)

Practical Grammar Compression Based on Maximal Repeats. - Isamu Furuya; Takuya Takagi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Takuya Kida (Algorithms, 2020)

Grammar-compressed Self-index with Lyndon Words. - Kazuya Tsuruta; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2020)

Computing Palindromic Trees for a Sliding Window and Its Applications. - Takuya Mieno; Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2020)

Dynamic index and LZ factorization in compressed space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Discret. Appl. Math., 2020)

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. - Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theory Comput. Syst., 2020)

Space-efficient algorithms for computing minimal/shortest unique substrings. - Takuya Mieno; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2020)

Efficient computation of longest single-arm-gapped palindromes in a string. - Shintaro Narisada; Diptarama Hendrian; Kazuyuki Narisawa; Shunsuke Inenaga; Ayumi Shinohara (Theor. Comput. Sci., 2020)

The Parameterized Suffix Tray. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CIAC, 2021)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. - Sara Giuliani; Shunsuke Inenaga; Zsuzsanna Lipták; Nicola Prezza; Marinella Sciortino; Anna Toffanello (SOFSEM, 2021)

Grammar Index by Induced Suffix Sorting. - Tooru Akagi; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2021)

Longest Common Rollercoasters. - Kosuke Fujita; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2021)

On the Approximation Ratio of LZ-End to LZ77. - Takumi Ideue; Takuya Mieno; Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Masayuki Takeda (SPIRE, 2021)

Position Heaps for Cartesian-Tree Matching on Strings and Tries. - Akio Nishimoto; Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga (SPIRE, 2021)

Counting Lyndon Subsequences. - Ryo Hirakawa; Yuto Nakashima 001; Shunsuke Inenaga; Masayuki Takeda (Stringology, 2021)

Compressed Communication Complexity of Hamming Distance. - Shiori Mitsuya; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Algorithms, 2021)

Longest previous overlapping factor array. - Hideo Bannai; Shunsuke Inenaga; Neerja Mhaskar (Inf. Process. Lett., 2021)

Towards a Complete Perspective on Labeled Tree Indexing: New Size Bounds, Efficient Constructions, and Beyond. - Shunsuke Inenaga (J. Inf. Process., 2021)

Computing longest palindromic substring after single-character or block-wise edits. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2021)

Efficiently computing runs on a trie. - Ryo Sugahara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2021)

The Smallest Grammar Problem Revisited. - Hideo Bannai; Momoko Hirayama; Danny Hucke; Shunsuke Inenaga; Artur Jez; Markus Lohrey; Carl Philipp Reh (IEEE Trans. Inf. Theory, 2021)

Minimal Absent Words on Run-Length Encoded Strings. - Tooru Akagi; Kouta Okabe; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga (CPM, 2022)

{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. - Takuya Mieno; Shunsuke Inenaga; Takashi Horiyama (CPM, 2022)

Cartesian Tree Subsequence Matching. - Tsubasa Oizumi; Takeshi Kai; Takuya Mieno; Shunsuke Inenaga; Hiroki Arimura (CPM, 2022)

Computing Palindromes on a Trie in Linear Time. - Takuya Mieno; Mitsuru Funakoshi; Shunsuke Inenaga (ISAAC, 2022)

Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. - Laurentius Leonard; Shunsuke Inenaga; Hideo Bannai; Takuya Mieno (SPIRE, 2022)

Computing Minimal Unique Substrings for a Sliding Window. - Takuya Mieno; Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Algorithmica, 2022)

A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. - Yoshifumi Sakai; Shunsuke Inenaga (Algorithmica, 2022)

Computing maximal generalized palindromes. - Mitsuru Funakoshi; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2022)

c-trie++: A dynamic trie tailored for fast prefix searches. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Comput., 2022)

Palindromic trees for a sliding window and its applications. - Takuya Mieno; Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Process. Lett., 2022)

Factorizing Strings into Repetitions. - Hiroe Inoue; Yoshiaki Matsuoka; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theory Comput. Syst., 2022)

Combinatorics of minimal absent words for a sliding window. - Tooru Akagi; Yuki Kuhara; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2022)

Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. - Katsuhito Nakashima; Noriki Fujisato; Diptarama Hendrian; Yuto Nakashima 001; Ryo Yoshinaka; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda (Theor. Comput. Sci., 2022)

On Sensitivity of Compact Directed Acyclic Word Graphs. - Hiroto Fujimaru; Yuto Nakashima 001; Shunsuke Inenaga (WORDS, 2023)

Space-Efficient STR-IC-LCS Computation. - Yuuki Yonemoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (SOFSEM, 2023)

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. - Hiroki Arimura; Shunsuke Inenaga; Yasuaki Kobayashi; Yuto Nakashima 001; Mizuki Sue (SPIRE, 2023)

Largest Repetition Factorization of Fibonacci Words. - Kaisei Kishi; Yuto Nakashima 001; Shunsuke Inenaga (SPIRE, 2023)

Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. - Kouta Okabe; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (SPIRE, 2023)

Computing SEQ-IC-LCS of Labeled Graphs. - Yuuki Yonemoto; Yuto Nakashima 001; Shunsuke Inenaga (PSC, 2023)

Sliding suffix trees simplified. - Laurentius Leonard; Shunsuke Inenaga; Hideo Bannai; Takuya Mieno (CoRR, 2023)

Sensitivity of string compressors and repetitiveness measures. - Tooru Akagi; Mitsuru Funakoshi; Shunsuke Inenaga (Inf. Comput., 2023)

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. - Yuta Fujishige; Yuki Tsujimaru; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2023)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. - Shunsuke Inenaga; Takuya Mieno; Hiroki Arimura; Mitsuru Funakoshi; Yuta Fujishige (IWOCA, 2024)

Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. - Taketo Tsujimoto; Hiroki Shibata 001; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga (IWOCA, 2024)

Edit and Alphabet-Ordering Sensitivity of Lex-Parse. - Yuto Nakashima 001; Dominik Köppl; Mitsuru Funakoshi; Shunsuke Inenaga; Hideo Bannai (MFCS, 2024)

Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. - Alan M. Cleary; Joseph Winjum; Jordan Dood; Shunsuke Inenaga (SPIRE, 2024)

On the Number of Non-equivalent Parameterized Squares in a String. - Rikuya Hamai; Kazushi Taketsugu; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (SPIRE, 2024)

All-Pairs Suffix-Prefix on Dynamic Set of Strings. - Masaru Kikuchi; Shunsuke Inenaga (SPIRE, 2024)

Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. - Wataru Sumiyoshi; Takuya Mieno; Shunsuke Inenaga (SPIRE, 2024)

Simple Linear-Time Repetition Factorization. - Yuki Yonemoto; Shunsuke Inenaga (SPIRE, 2024)

Computing Longest Common Subsequence under Cartesian-Tree Matching Model. - Taketo Tsujimoto; Koki Shibata; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga (CoRR, 2024)

The CDAWG Index and Pattern Matching on Grammar-Compressed Strings. - Alan M. Cleary; Joseph Winjum; Jordan Dood; Shunsuke Inenaga (CoRR, 2024)

Subsequence Pattern Matching with Segment Number Constraint. - Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2024)

Faster and Simpler Online Computation of String Net Frequency. - Shunsuke Inenaga (CoRR, 2024)

Relating Left and Right Extensions of Maximal Repeats. - Shunsuke Inenaga; Dmitry Kosolobov (CoRR, 2024)

Linear time online algorithms for constructing linear-size suffix trie. - Diptarama Hendrian; Takuya Takagi; Shunsuke Inenaga; Keisuke Goto 001; Mitsuru Funakoshi (Theor. Comput. Sci., 2024)

Faster space-efficient STR-IC-LCS computation. - Yuki Yonemoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (Theor. Comput. Sci., 2024)

Linear-size suffix tries and linear-size CDAWGs simplified and improved. - Shunsuke Inenaga (Acta Informatica, 2024)

Subsequence Matching and LCS with Segment Number Constraints. - Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (CIAC (2), 2025)

Space-Efficient Online Computation of String Net Occurrences. - Takuya Mieno; Shunsuke Inenaga (CPM, 2025)

Packed Acyclic Deterministic Finite Automata. - Hiroki Shibata 001; Masakazu Ishihata; Shunsuke Inenaga (SOFSEM (2), 2025)

Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access. - Alan M. Cleary; Joseph Winjum; Jordan Dood; Hiroki Shibata 001; Shunsuke Inenaga (SEA, 2025)

Computing maximal palindromes in non-standard matching models. - Takuya Mieno; Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Comput., 2025)

Constant sensitivity on the CDAWGs. - Rikuya Hamai; Hiroto Fujimaru; Shunsuke Inenaga (CoRR, 2025)

Tight bounds for the sensitivity of CDAWGs with left-end edits. - Hiroto Fujimaru; Yuto Nakashima 001; Shunsuke Inenaga (Acta Informatica, 2025)

On the sensitivity of CDAWG-grammars. - Hiroto Fujimaru; Shunsuke Inenaga (CoRR, 2025)

LZSE: an LZ-style compressor supporting O(log n)-time random access. - Hiroki Shibata 001; Yuto Nakashima 001; Yutaro Yamaguchi 001; Shunsuke Inenaga (CoRR, 2025)

Counting distinct (non-)crossing substrings. - Haruki Umezaki; Hiroki Shibata 001; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (CoRR, 2025)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors. - Yuto Fujie; Hiroki Shibata 001; Yuto Nakashima 001; Shunsuke Inenaga (CoRR, 2025)

Bit Catastrophes for the Burrows-Wheeler Transform. - Sara Giuliani; Shunsuke Inenaga; Zsuzsanna Lipták; Giuseppe Romana; Marinella Sciortino; Cristian Urbina (Theory Comput. Syst., 2025)

Nyldon Factorization of Thue-Morse Words and Fibonacci Words. - Kaisei Kishi; Kazuki Kai; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (CoRR, 2025)