Shunsuke Inenaga

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 193

Top Venues

Publications

Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. IWOCA (2024)
Shunsuke Inenaga
Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved. CoRR (2024)
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA (2024)
Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Faster space-efficient STR-IC-LCS computation. Theor. Comput. Sci. 1003 (2024)
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina
Bit catastrophes for the Burrows-Wheeler Transform. CoRR (2024)
Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi
Linear time online algorithms for constructing linear-size suffix trie. Theor. Comput. Sci. 1015 (2024)
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
Edit and Alphabet-Ordering Sensitivity of Lex-Parse. MFCS (2024)
Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Computing Longest Common Subsequence under Cartesian-Tree Matching Model. CoRR (2024)
Masaru Kikuchi, Shunsuke Inenaga
All-Pairs Suffix-Prefix on Dynamic Set of Strings. CoRR (2024)
Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga
The CDAWG Index and Pattern Matching on Grammar-Compressed Strings. CoRR (2024)
Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR (2024)
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR (2024)
Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga
Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. CoRR (2024)
Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
Subsequence Pattern Matching with Segment Number Constraint. CoRR (2024)
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA (2024)
Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga
Largest Repetition Factorization of Fibonacci Words. SPIRE (2023)
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE (2023)
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Space-Efficient STR-IC-LCS Computation. SOFSEM (2023)
Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga
Computing SEQ-IC-LCS of Labeled Graphs. PSC (2023)
Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
On Sensitivity of Compact Directed Acyclic Word Graphs. WORDS (2023)
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga
Computing SEQ-IC-LCS of Labeled Graphs. CoRR (2023)
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina
Bit Catastrophes for the Burrows-Wheeler Transform. DLT (2023)
Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga
Sensitivity of string compressors and repetitiveness measures. Inf. Comput. 291 (2023)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Sliding suffix trees simplified. CoRR (2023)
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR (2023)
Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE (2023)
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets. CoRR (2023)
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Linear-time computation of generalized minimal absent words for multiple strings. CoRR (2023)
Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie. CoRR (2023)
Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga
On Sensitivity of Compact Directed Acyclic Word Graphs. CoRR (2023)
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theor. Comput. Sci. 973 (2023)
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
Computing palindromes on a trie in linear time. CoRR (2022)
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
Space-Efficient STR-IC-LCS Computation. CoRR (2022)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. Theor. Comput. Sci. 933 (2022)
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Palindromic trees for a sliding window and its applications. Inf. Process. Lett. 173 (2022)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
c-trie++: A dynamic trie tailored for fast prefix searches. Inf. Comput. 285 (Part) (2022)
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Minimal Unique Substrings for a Sliding Window. Algorithmica 84 (3) (2022)
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Combinatorics of minimal absent words for a sliding window. Theor. Comput. Sci. 927 (2022)
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM (2022)
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Minimal Absent Words on Run-Length Encoded Strings. CoRR (2022)
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
Computing Palindromes on a Trie in Linear Time. ISAAC (2022)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. CoRR (2022)
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
RePair Grammars are the Smallest Grammars for Fibonacci Words. CoRR (2022)
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
Cartesian Tree Subsequence Matching. CoRR (2022)
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Factorizing Strings into Repetitions. Theory Comput. Syst. 66 (2) (2022)
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing maximal generalized palindromes. CoRR (2022)
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura
Cartesian Tree Subsequence Matching. CPM (2022)
Yoshifumi Sakai, Shunsuke Inenaga
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. Algorithmica 84 (9) (2022)
Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga
Minimal Absent Words on Run-Length Encoded Strings. CPM (2022)
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. SPIRE (2022)
Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar
Longest previous overlapping factor array. Inf. Process. Lett. 168 (2021)
Shunsuke Inenaga
Towards a Complete Perspective on Labeled Tree Indexing: New Size Bounds, Efficient Constructions, and Beyond. J. Inf. Process. 29 (2021)
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compressed Communication Complexity of Hamming Distance. CoRR (2021)
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Efficiently computing runs on a trie. Theor. Comput. Sci. 887 (2021)
Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
Position Heaps for Cartesian-Tree Matching on Strings and Tries. SPIRE (2021)
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
On the Approximation Ratio of LZ-End to LZ77. SPIRE (2021)
Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga
Position Heaps for Cartesian-tree Matching on Strings and Tries. CoRR (2021)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing longest palindromic substring after single-character or block-wise edits. Theor. Comput. Sci. 859 (2021)
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM (2021)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Suffix Tray. CIAC (2021)
Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga
Sensitivity of string compressors and repetitiveness measures. CoRR (2021)
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
On the approximation ratio of LZ-End to LZ77. CoRR (2021)
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Combinatorics of minimal absent words for a sliding window. CoRR (2021)
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
The Smallest Grammar Problem Revisited. IEEE Trans. Inf. Theory 67 (1) (2021)
Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Longest Common Rollercoasters. SPIRE (2021)
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
Counting Lyndon Subsequences. Stringology (2021)
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
Counting Lyndon Subsequences. CoRR (2021)
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compressed Communication Complexity of Hamming Distance. Algorithms 14 (4) (2021)
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar Index By Induced Suffix Sorting. CoRR (2021)
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar Index by Induced Suffix Sorting. SPIRE (2021)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR (2020)
Shunsuke Inenaga
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. LATIN (2020)
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13 (4) (2020)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE (2020)
Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica 82 (5) (2020)
Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
Efficient computation of longest single-arm-gapped palindromes in a string. Theor. Comput. Sci. 812 (2020)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. 845 (2020)
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar-compressed Self-index with Lyndon Words. CoRR (2020)
Yoshifumi Sakai, Shunsuke Inenaga
A reduction of the dynamic time warping distance to the longest increasing subsequence length. CoRR (2020)
Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR (2020)
Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
Longest Square Subsequence Problem Revisited. SPIRE (2020)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
DAWGs for parameterized matching: online construction and related indexing structures. CoRR (2020)
Shunsuke Inenaga
Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. Stringology (2020)
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274 (2020)
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. Theory Comput. Syst. 64 (7) (2020)
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster STR-EC-LCS Computation. SOFSEM (2020)
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR (2020)
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR (2020)
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Faster STR-EC-LCS Computation. CoRR (2020)
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On Repetitiveness Measures of Thue-Morse Words. SPIRE (2020)
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
On repetitiveness measures of Thue-Morse words. CoRR (2020)
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. CPM (2020)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC (2020)
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
The Parameterized Suffix Tray. CoRR (2020)
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. SOFSEM (2020)
Yoshifumi Sakai, Shunsuke Inenaga
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. ISAAC (2020)
Shunsuke Inenaga
Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. CoRR (2020)
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM (2020)
Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
Longest Square Subsequence Problem Revisited. CoRR (2020)
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
An Improved Data Structure for Left-Right Maximal Generic Words Problem. ISAAC (2019)

Shunsuke Inenaga.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Shunsuke Inenaga