Suffix Trees, DAWGs, and CDAWGs for Forward and Backward Tries Reviewed International journal

Shunsuke Inenaga

Proc. 14th Latin American Theoretical Informatics Symposium (LATIN 2020)   2021.1

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform Reviewed International journal

Proc. 47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2021)   2021.1

The Smallest Grammar Problem Revisited Reviewed International journal

IEEE Transactions on Information Theory   2021.1

A reduction of the dynamic time warping distance to the longest increasing subsequence length Reviewed International journal

Yoshifumi Sakai and Shunsuke Inenaga

31st International Symposium on Algorithms and Computation (ISAAC 2020)   2020.12

On repetitiveness measures of Thue-Morse words Reviewed International journal

Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)   2020.10

Dynamic index and LZ factorization in compressed space Reviewed

Takaaki Nishimoto, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Discrete Applied Mathematics   274 ( 15 )   116 - 129   2020.3

Dynamic Trie Tailored for Fast Prefix Searches Reviewed International journal

Data Compression Conference 2020 (DCC 2020)   2020.3

Efficient Dynamic Dictionary Matching with DAWGs and AC-automata Reviewed International journal

Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, and Ayumi Shinohara

Theoretical Computer Science   2019.11

Compact Data Structures for Shortest Unique Substring Queries Reviewed International journal

26th International Symposium on String Processing and Information Retrieval (SPIRE 2019)   2019.10

Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts Reviewed International journal

Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, and Diptarama Hendrian

Algorithmica   2019.10

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets Reviewed International journal

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

26th International Symposium on String Processing and Information Retrieval (SPIRE 2019)   2019.10

On Longest Common Property Preserved Substring Queries Reviewed International journal

Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, and Tomasz Kociumaka

26th International Symposium on String Processing and Information Retrieval (SPIRE 2019)   2019.10

Computing Maximal Palindromes and Distinct Palindromes in a Trie Reviewed International journal

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Prague Stringology Conference 2019 (PSC 2019)   2019.8

k-Abelian pattern matching: Revisited, corrected, and extended Reviewed International journal

Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga and Shiho Sugimoto

Prague Stringology Conference 2019 (PSC 2019)   2019.8

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings Reviewed International journal

Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

The 30th International Workshop on Combinatorial Algorithms (IWOCA 2019)   2019.7

Computing runs on a trie Reviewed International journal

Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)   2019.6

Online Algorithms for Constructing Linear-size Suffix Trie Reviewed International journal

Diptarama Hendrian, Takuya Takagi, and Shunsuke Inenaga

Proc. the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)   2019.6

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations Reviewed International journal

Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)   2019.6

Faster queries for longest substring palindrome after block edit Reviewed International journal

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)   2019.6

The Parameterized Position Heap of a Trie Reviewed International journal

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

11th International Conference on Algorithms and Complexity (CIAC 2019)   2019.5

MR-RePair: Grammar Compression based on Maximal Repeats Reviewed International journal

Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Takuya Kida

Data Compression Conference 2019 (DCC 2019)   2019.3

Block Palindromes: A New Generalization of Palindromes Reviewed International journal

Keisuke Goto, Tomohiro I, Hideo Bannai and Shunsuke Inenaga

25th International Symposium on String Processing and Information Retrieval (SPIRE 2018)   2018.10

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays Reviewed International journal

Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

25th International Symposium on String Processing and Information Retrieval (SPIRE 2018)   2018.10

Algorithms and combinatorial properties on shortest unique palindromic substrings Reviewed

Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Journal of Discrete Algorithms   52-53   122 - 132   2018.9

O(n log n)-time Text Compression by LZ-style Longest First Substitution Reviewed International journal

Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Prague Stringology Conference 2018 (PSC 2018)   2018.8

Right-to-left Online Construction of Parameterized Position Heaps Reviewed International journal

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Prague Stringology Conference 2018 (PSC 2018)   2018.8

Faster Online Elastic Degenerate String Matching Reviewed International journal

Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)   2018.7

Lyndon Factorization of Grammar Compressed Texts Revisited Reviewed International journal

Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)   2018.7

Longest Lyndon Substring After Edit Reviewed International journal

Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)   2018.7

Computing longest common square subsequences Reviewed International journal

Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)   2018.7

Longest substring palindrome after edit Reviewed International journal

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)   2018.7

Dynamic RLE-Compressed Edit Distance Tables under General Weighted Cost Functions Reviewed

International Journal of Foundations of Computer Science   29 ( 4 )   623 - 645   2018.6

Diverse Palindromic Factorization is NP-Complete Reviewed International journal

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto

International Journal of Foundations of Computer Science   29 ( 2 )   143 - 163   2018.2

Diverse Palindromic Factorization is NP-Complete Reviewed International journal

Journal of Foundations of Computer Science   143 - 163   2018.2

A hardness result and new algorithm for the longest common palindromic subsequence problem Reviewed International journal

Shunsuke Inenaga and Heikki Hyyro

Information Processing Letters   129   11 - 15   2018.1

On the size of the smallest alphabet for Lyndon trees Reviewed

Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science   2018.1

Efficient dynamic dictionary matching with DAWGs and AC-automata Reviewed

Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara

Theoretical Computer Science   2018.1

Inferring strings from Lyndon factorization Reviewed International journal

Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Koppl, and Florin Manea

Theory of Computing Systems   62 ( 1 )   162 - 191   2018.1

Almost linear time computation of maximal repetitions in run length encoded strings

Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

28th International Symposium on Algorithms and Computation, ISAAC 2017   92   2017.12

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation Reviewed International journal

Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov and Simon Puglisi

Proc. 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)   LNCS 10508   51 - 67   2017.9

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing Reviewed International journal

Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, and Hiroki Arimura

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E100-A ( 9 )   1785 - 1793   2017.9

The "Runs" Theorem Reviewed International journal

Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, and Kazuya Tsuruta

SIAM Journal of Computing   46 ( 5 )   1501 - 1514   2017.9

Order preserving pattern matching on trees and DAGs Reviewed International journal

Tenma Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Proc. 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)   LNCS 10508   271 - 277   2017.9

Linear-size CDAWG: new repetition-aware indexing and grammar compression Reviewed International journal

Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga and Hiroki Arimura

Proc. 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)   LNCS 10508   304 - 316   2017.9

On Reverse Engineering the Lyndon Tree Reviewed International journal

Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Prague Stringology Conference 2017 (PSC 2017)   108 - 117   2017.8

Inferring strings from Lyndon factorization Reviewed International journal

Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Koppl, and Florin Manea

Theory of Computing Systems   62 ( 1 )   162 - 191   2017.8

Small-space LCE data structure with constant-time queries Reviewed International journal

Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda

Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)   10:1 - 10:15   2017.8

Computing All Distinct Squares in Linear Time for Integer Alphabets Reviewed International journal

Proc. the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)   2017.7

Computing Abelian string regularities based on RLE Reviewed International journal

Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

The 28th International Workshop on Combinatorial Algorithms (IWOCA 2017)   2017.7

Shortest Unique Palindromic Substring Queries in Optimal Time Reviewed International journal

Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

The 28th International Workshop on Combinatorial Algorithms (IWOCA 2017)   2017.7

Tight bounds on the maximum number of shortest unique substrings Reviewed International journal

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)   2017.7

Faster STR-IC-LCS computation via RLE Reviewed International journal

Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)   2017.7

Longest Common Subsequence in at Least k Length Order-isomorphic Substrings Reviewed International journal

Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara

43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017)   LNCS 10139   363 - 374   2017.1

Computing longest single-arm-gapped palindromes in a string Reviewed International journal

Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara

43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017)   LNCS 10139   375 - 386   2017.1

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text Reviewed International journal

Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science   656(B)   215 - 224   2016.11

Generalized pattern matching and periodicity under substring consistent equivalence relations Reviewed International journal

Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science   656(B)   215 - 224   2016.11

Closed Factorization Reviewed International journal

Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Shunsuke Inenaga, Costas S. Iliopoulos, Simon J. Puglisi, Shiho Sugimoto

Discrete Applied Mathematics   212   23 - 29   2016.10

Finding gapped palindromes online Reviewed International journal

Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)   Lecture Notes in Computer Science 9843   191 - 202   2016.8

Efficient Computation of Substring Equivalence Classes with Suffix Arrays Reviewed International journal

Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Algorithmica   2016.8

Computing Smallest and Largest Repetition Factorizations in O(n log n) time Reviewed International journal

Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. Prague Stringology Conference 2016 (PSC 2016)   135 - 145   2016.8

Dynamic index and LZ factorization in compressed space Reviewed International journal

Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. Prague Stringology Conference 2016   153 - 171   2016.8

Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets Reviewed International journal

Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)   38:1 - 38:14   2016.8

Shortest Unique Substring Queries on Run-Length Encoded Strings Reviewed International journal

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)   69:1 - 69:11   2016.8

Fully dynamic data structure for LCE queries in compressed space Reviewed International journal

Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)   72:1 - 72:15   2016.8

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing Reviewed International journal

Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura

Proc. 27th International Workshop on Combinatorial Algorithms (IWOCA 2016)   LNCS 9843   213 - 225   2016.8

Factorizing a string into squares in linear time Reviewed International journal

Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)   27:1 - 27:12   2016.6

Fully-online construction of suffix trees for multiple texts Reviewed International journal

Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura

Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)   22:1 - 22:13   2016.6

Deterministic sub-linear space LCE data structures with efficient construction Reviewed International journal

Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon Puglisi, Masayuki Takeda

Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)   2016.6

Efficiently Finding All Maximal α-gapped Repeats Reviewed International journal

Paweł Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea

39:1 - 39:14   2016.2

Compacting a dynamic edit distance table by RLE compression Reviewed International journal

Heikki Hyyro, Shunsuke Inenaga

42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016)   34   302 - 313   2016.1

Inferring Strings from Full Abelian Periods Reviewed International journal

Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. 26th International Symposium on Algorithms and Computation (ISAAC 2015)   Lecture Notes in Computer Science   2015.12

Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets Reviewed International journal

Yuto Nakashima, Tomihiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Information Processing Letters   115 ( 9 )   655 - 659   2015.9

A faster algorithm for computing maximal α-gapped repeats in a string Reviewed International journal

Lecture Notes in Computer Science 9309   124 - 136   2015.9

Efficient Algorithms for Longest Closed Factor Array Reviewed International journal

Proc. the 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015)   Lecture Notes in Computer Science 9309   95 - 102   2015.9

Dynamic Edit Distance Table under a General Weighted Cost Function Reviewed International journal

Heikki Hyyro, Kazuyuki Narisawa, Shunsuke Inenaga

Journal of Discrete Algorithms   34   2 - 17   2015.9

Computing Left-Right Maximal Generic Words Reviewed International journal

Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the Prague Stringology Conference 2015 (PSC 2015)   5 - 16   2015.8

A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications Invited International journal

Shunsuke Inenaga

Proc. the Prague Stringology Conference 2015 (PSC 2015)   1 - 4   2015.8

Diverse Palindromic Factorization is NP-Complete Reviewed International journal

Proc. the 19th International Conference on Developments in Language Theory (DLT 2015)   Lecture Notes in Computer Science 9168   85 - 96   2015.7

Semi-dynamic compact index for short patterns and succinct van Emde Boas tree Reviewed International journal

Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015)   Lecture Notes in Computer Science 9133   355 - 366   2015.6

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding Reviewed International journal

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015)   Lecture Notes in Computer Science 9133   219 - 230   2015.6

Compressed automata for dictionary matching Reviewed International journal

Tomihiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science   578   30 - 41   2015.5

An opportunistic text indexing structure based on run length encoding Reviewed International journal

Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 9th International Conference on Algorithms and Complexity (CIAC 2015)   Lecture Notes in Computer Science 9079   390 - 402   2015.5

Detecting regularities on grammar-compressed strings Invited Reviewed International journal

Tomohiro I, Kouji Shimohira, Wataru Matsubara, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara

Information and Computation   240   74 - 89   2015.2

A new characterization of maximal repetitions by Lyndon trees Reviewed International journal

Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta

Proc. ACM-SIAM Symposium on Discrete Algorithms 2015 (SODA 2015)   2015.1

Closed Factorization Reviewed International journal

Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Shunsuke Inenaga, Costas S. Iliopoulos, Simon J. Puglisi, Shiho Sugimoto

Proc. the Prague Stringology Conference 2014 (PSC 2014)   2014.9

Computing Abelian Covers and Abelian Runs Reviewed International journal

Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the Prague Stringology Conference 2014 (PSC 2014)   2014.9

Inferring strings from Lyndon factorization Reviewed International journal

Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014)   Lecture Notes in Computer Science 8635   2014.8

Computing Palindromic Factorizations and Palindromic Covers On-line Reviewed International journal

Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014)   Lecture Notes in Computer Science 8486   2014.6

Faster Compact On-Line Lempel-Ziv Factorization Reviewed International journal

Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Proc. 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014)   Leibniz International Proceedings in Informatics (LIPIcs) 25   675 - 686   2014.3

Inferring Strings from Suffix Trees and Links on a Binary Alphabet Reviewed International journal

Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Discrete Applied Mathematics   163 ( 3 )   316 - 325   2014.1

Shortest Unique Substrings Queries in Optimal Time Reviewed International journal

Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Proc. 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2014)   LNCS 8327   503 - 513   2014.1

Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text Reviewed International journal

Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 20th Symposium on String Processing and Information Retrieval (SPIRE 2013)   Lecture Notes in Computer Science 8214   2013.10

Efficient Lyndon factorization of grammar compressed text Reviewed International journal

Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013)   Lecture Notes in Computer Science 7922   2013.10

Converting SLP to LZ78 in almost linear time Reviewed International journal

Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda

Proc. 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013)   Lecture Notes in Computer Science 7922   2013.10

Compressed Automata for Dictionary Matching Reviewed International journal

Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 18th International Conference on Implementation and Application of Automata (CIAA 2013)   Lecture Notes in Computer Science 7982   2013.10

Computing Reversed Lempel-Ziv Factorization Online Reviewed International journal

Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the Prague Stringology Conference 2013 (PSC 2013)   2013.8

Detecting Regularities on Grammar-compressed Strings Reviewed International journal

Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Sninohara

Proc. the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)   Lecture Notes in Computer Science 8087   2013.8

Palindrome Pattern Matching Reviewed International journal

Tomohiro I, Shunsuke Inenaga, Masayuki Takeda

Theoretical Computer Science   483   162 - 170   2013.4

From Run Length Encoding to LZ78 and Back Again Reviewed International journal

Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. Data Compression Conference 2013 (DCC 2013)   2013.3

Computing convolution on grammar-compressed text Reviewed International journal

Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. Data Compression Conference 2013 (DCC 2013)   2013.3

Permuted Pattern Matching on Multi-Track Strings Reviewed International journal

Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga

Proc. the 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013)   Lecture Notes in Computer Science 7741   2013.1

Fast q-gram mining on SLP compressed strings Reviewed International journal

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Journal of Discrete Algorithms   18   89 - 99   2013.1

Efficient LZ78 Factorization of Grammar Compressed Text Reviewed International journal

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Proc. the 19th Symposium on String Processing and Information Retrieval (SPIRE 2012)   Lecture Notes in Computer Science 7608   2012.10

An efficient algorithm to test square-freeness of strings compressed by straight-line programs Reviewed International journal

Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein

Information Processing Letters   122 ( 9 )   711 - 714   2012.10

The Position Heap of a Trie Reviewed International journal

Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the 19th Symposium on String Processing and Information Retrieval (SPIRE 2012)   Lecture Notes in Computer Science 7608   2012.10

Speeding-up q-gram mining on grammar-based compressed texts Reviewed International journal

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Proc. the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012)   Lecture Notes in Computer Science 7354   2012.7

Finding Characteristic Substrings from Compressed Texts Invited Reviewed International journal

Shunsuke Inenaga and Hideo Bannai

International Journal of Foundations of Computer Science   23 ( 2 )   2012.2

Finding Characteristic Substrings from Compressed Texts Reviewed International journal

Shunsuke Inenaga, Hideo Bannai

International Journal of Foundations of Computer Science   23 ( 2 )   261 - 280   2012.2

Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts Reviewed International journal

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda

Proc. the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012)   Lecture Notes in Computer Science 7147   2012.1

Verifying and Enumerating Parameterized Border Arrays Reviewed International journal

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Theoretical Computer Science   412 ( 50 )   2011.11

Palindrome Pattern Matching Reviewed International journal

Tomohiro I, Shunsuke Inenaga and Masayuki Takeda

Proc. the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011)   LNCS 6661   2011.6

Finding Missing Patterns Reviewed International journal

Journal of Discrete Algorithms   9 ( 2 )   2011.6

Password Based Anonymous Authentication with Private Information Retrieval Invited Reviewed International journal

Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, and Hiroto Yasuura

Journal of Digital Information Management   9 ( 2 )   2011.4

An Anonymous Authentication Protocol with Single-database PIR Reviewed International journal

Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, and Hiroto Yasuura

Proc. Australasian Information Security Conference 2011 (AISC 2011)   CRPIT Series Vol. 116   2011.1

Counting and Verifying Maximal Palindromes Reviewed International journal

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Proc. the 17th Symposium on String Processing and Information Retrieval (SPIRE 2010)   LNCS 6393   2010.10

Towards Modeling Stored-Value Electronic Money Systems Reviewed International journal

Shunsuke Inenaga, Kenichiro Oyama, and Hiroto Yasuura

IPSJ Transactions on Mathematical Modeling and its Applications   3 ( 3 )   2010.10

An Identifiable yet Unlinkable Authentication System with Smart Cards for Multiple Services Reviewed International journal

Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, and Hiroto Yasuura

IPSJ Transactions on Mathematical Modeling and its Applications   3 ( 3 )   2010.10

Verifying a Parameterized Border Array in $O(n^{1.5})$ Time Reviewed International journal

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Proc. the 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010),   LNCS 6129   2010.6

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs Invited Reviewed International journal

Wataru Matsubara, Shunsuke Inenaga, and Ayumi Shinohara

Chicago Journal of Theoretical Computer Science   2010.6

An Identifiable yet Unlinkable Authentication System with Smart Cards for Multiple Services Reviewed International journal

Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, and Hiroto Yasuura

Proc. The 2010 International Conference on Computational Science and Its Applications (ICCSA 2010)   LNCS 6019   2010.3

Towards Modeling Stored-Value Electronic Money Systems Reviewed International journal

Shunsuke Inenaga, Kenichiro Oyama, and Hiroto Yasuura

Proc. 8th International Conference on Computer Information Systems and Industrial Management Applications (CISIM 2009)   2009.12

Linear-Time Off-Line Text Compression by Longest-First Substitution Reviewed International journal

Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, and Ayumi Shinohara

Algorithms   2 ( 24 )   2009.11

Finding Characteristic Substrings from Compressed Texts Reviewed International journal

Shunsuke Inenaga and Hideo Bannai

Proc. The Prague Stringology Conference 2009 (PSC 2009)   2009.8

Modeling Costs of Access Control with Various Key Management Systems Reviewed International journal

Tomomi Yamasaki, Shunsuke Inenaga, Daisuke Ikeda, and Hiroto Yasuura

Proc. The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2009)   2009.7

Anonymous Authentication Systems Based on Private Information Retrieval Reviewed International journal

Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, and Hiroto Yasuura

Proc. 1st International Conference on Networked Digital Technologies (NDT 2009)   2009.7

Counting Parameterized Border Arrays for a Binary Alphabet Reviewed International journal

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Proc. 3rd International Conference on Language and Automata Theory and Applications (LATA 2009)   LNCS 5457   2009.4

Efficient Algorithms to Compute Compressed Longest Common Substrings and Compressed Palindromes Reviewed International journal

Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, and Kazuo Hashimoto

Theoretical Computer Science   410 ( 8-10 )   2009.3

Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program Reviewed International journal

Wataru Matsubara, Shunsuke Inenaga, and Ayumi Shinohara

Proc. 15th Computing: The Australasian Theory Symposium (CATS 2009)   CRPIT Series Vol. 94   2009.1

Computing longest common substring and all palindromes from compressed strings Reviewed International journal

Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, and Kazuo Hashimoto

Proc. 34th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2008)   LNCS 4910   2008.1

Efficient Computation of Substring Equivalence Classes with Suffix Arrays Reviewed International journal

Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007)   LNCS 4580   2007.7

Simple Linear-Time Off-Line Text Compression by Longest-First Substitution International journal

Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda

Proc. Data Compression Conference 2007 (DCC 2007)   2007.3

Sparse Directed Acyclic Word Graphs Reviewed International journal

Shunsuke Inenaga and Masayuki Takeda

13th International Symposium on String Processing and Information Retrieval (SPIRE'06)   2006.10

Sparse Compact Directed Acyclic Word Graphs Reviewed International journal

Shunsuke Inenaga and Masayuki Takeda

The Prague Stringology Conference '06 (PSC'06)   2006.8

Reachability on Suffix Tree Graphs Reviewed International journal

Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda

The Prague Stringology Conference '06 (PSC'06)   2006.8

On-line Linear-time Construction of Word Suffix Trees Reviewed International journal

Shunsuke Inenaga and Masayuki Takeda

17th Annual Symposium on Combinatorial Pattern Matching (CPM'06)   2006.7

A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems Invited Reviewed International journal

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda

International Journal of Foundations of Computer Science   16 ( 6 )   1155 - 1166   2005.12

Composite Pattern Discovery for PCR Application Reviewed International journal

Stanislav Angelov and Shunsuke Inenaga

12th International Symposium on String Processing and Information Retrieval (SPIRE'05)   2005.11

Fully Incremental LCS Computation Reviewed International journal

Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda

15th International Symposium on Fundamentals of Computation Theory (FCT'05)   3623   563 - 574   2005.8

On-Line Construction of Compact Directed Acyclic Word Graphs Invited Reviewed International journal

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, and Giulio Pavesi

Discrete Applied Mathematics   146 ( 2 )   156 - 179   2005.3

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars Reviewed International journal

Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda

Eighth International Conference on Developments in Language Theory (DLT'04)   3340   225 - 236   2004.12

Ternary Directed Acyclic Word Graphs Invited Reviewed International journal

Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, and Ayumi Shinohara

Theoretical Compututer Science   328 ( 1-2 )   97 - 111   2004.11

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance Reviewed International journal

7th International Conference on Discovery Science (DS 2004)   3245   32 - 46   2004.10

Finding Missing Patterns Reviewed International journal

4th Workshop on Algorithms in Bioinformatics (WABI 2004)   2004.9

A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems Reviewed International journal

Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda

The Prague Stringology Conference '04 (PSC '04)   16 ( 6 )   1155 - 1166   2004.8

Compact Directed Acyclic Word Graphs for a Sliding Window Invited Reviewed International journal

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa

Journal of Discrete Algorithms   2 ( 1 )   2004.3

Linear-Time Off-Line Text Compression by Longest-First Substitution Reviewed International journal

Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, and Ayumi Shinohara

10th International Symposium on String Processing and Information Retrieval (SPIRE 2003)   2857   137 - 152   2003.10

Inferring Strings from Graphs and Arrays Reviewed International journal

Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda

28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003)   2747   208 - 217   2003.8

Ternary Directed Acyclic Word Graphs Reviewed International journal

Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, and Ayumi Shinohara

Eighth International Conference on Implementation and Application of Automata (CIAA 2003   2759   120 - 130   2003.7

Bidirectional Construction of Suffix Trees Invited Reviewed

Shunsuke Inenaga

Nordic Journal of Computing   10 ( 1 )   2003.4

Discovering Best Variable-Length-Don't-Care Patterns Reviewed International journal

Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa

The Fifth International Conference on Discovery Science (DS '02)   2534   86 - 97   2002.11

Compact Directed Acyclic Word Graphs for a Sliding Window Reviewed International journal

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa

9th International Symposium on String Processing and Information Retrieval (SPIRE 2002)   2002.9

Bidirectional Construction of Suffix Trees Reviewed International journal

Shunsuke Inenaga

The Prague Stringology Conference '02 (PSC '02)   2002.9

The Minimum DAWG for All Suffixes of a String and Its Applications Reviewed International journal

Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, and Setsuo Arikawa

13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002)   2373   153 - 167   2002.7

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs Reviewed International journal

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa

8th International Symposium on String Processing and Information Retrieval (SPIRE '01)   96 - 110   2001.11

A Practical Algorithm to Find the Best Episode Patterns Reviewed International journal

Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa

The Fourth International Conference on Discovery Science (DS '01)   2001.11

Construction of the CDAWG for a Trie Reviewed International journal

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa

The Prague Stringology Conference '01 (PSC '01)   2001.9

On-Line Construction of Compact Directed Acyclic Word Graphs Reviewed International journal

Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, and Giulio Pavesi

12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001)   146 ( 2 )   156 - 179   2001.7

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph Reviewed International journal

Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima and Mizuki Sue

SPIRE 2023   2023.9

Largest Repetition Factorization of Fibonacci Words Reviewed International journal

Kaisei Kishi, Yuto Nakashima, and Shunsuke Inenaga

SPIRE 2023   2023.9

Linear-Time Computation of Generalized Minimal Absent Words of Multiple Strings Reviewed International journal

Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, and Hideo Bannai

SPIRE 2023   2023.9

Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets Reviewed

Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Theoretical Computer Science   973 ( 114093 )   2023.9

Computing SEQ-IC-LCS of non-linear texts Reviewed International journal

Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga

PSC 2023   2023.8

Bit Catastrophes for the Burrows-Wheeler Transform Reviewed International journal

Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina

LNCS 13911   86 - 99   2023.6

On Sensitivity of Compact Directed Acyclic Word Graphs Reviewed International journal

Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga

WORDS 2023   168 - 180   2023.6

Sensitivity of string compressors and repetitiveness measures. Reviewed International journal

Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga

Inf. Comput.   291   104999 - 104999   2023.3

Space-Efficient STR-IC-LCS Computation Reviewed International journal

Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, and Hideo Bannai

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

Parameterized DAWGs: Efficient constructions and bidirectional pattern searches Reviewed International journal

Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, and Masayuki Takeda

Theoretical Computer Science   2022.10

Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions Reviewed International journal

Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, and Takuya Mieno

Proc. 29th International Symposium on String Processing and Information Retrieval (SPIRE 2022)   2022.10

Combinatorics of minimal absent words for a sliding window Reviewed International journal

Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science   2022.6

Cartesian Tree Subsequence Matching Reviewed International journal

Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, and Hiroki Arimura

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

RePair Grammars are the Smallest Grammars for Fibonacci Words Reviewed International journal

Takuya Mieno, Shunsuke Inenaga, and Takashi Horiyama

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

Minimal Absent Words on Run-Length Encoded Strings Reviewed International journal

Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, and Shunsuke Inenaga

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

A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length Reviewed

Yoshifumi Sakai, Shunsuke Inenaga

Algorithmica   84 ( 9 )   2581 - 2596   2022.5

Factorizing Strings into Repetitions Reviewed International journal

Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Theory of Computing Systems   2022.4

Palindromic trees for a sliding window and its applications Reviewed International journal

Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Information Processing Letters   2022.1

Position Heaps for Cartesian-tree Matching on Strings and Tries Reviewed International journal

Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, and Shunsuke Inenaga

Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)   2021.10

Grammar Index By Induced Suffix Sorting Reviewed International journal

Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)   2021.10

Longest Common Rollercoasters Reviewed International journal

Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)   2021.10

On the approximation ratio of LZ-End to LZ77 Reviewed International journal

Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, and Masayuki Takeda

Proc. 28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)   2021.10

Counting Lyndon Subsequences Reviewed International journal

Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, and Masayuki Takeda

Proc. Prague Stringology Conference 2021 (PSC 2021)   2021.8

Longest previous overlapping factor array Reviewed International journal

Hideo Bannai, Shunsuke Inenaga, and Neerja Mhaskar

Information Processing Letters   2021.6

The Parameterized Suffix Tray Reviewed International journal

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. 12th International Conference on Algorithms and Complexity (CIAC 2021)   2021.5

Compressed Communication Complexity of Hamming Distance Reviewed International journal

Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Algorithms   2021.4

Space-efficient algorithms for computing minimal/shortest unique substrings Reviewed

Theoretical Computer Science   2020.12

Space-efficient algorithms for computing minimal/shortest unique substrings Reviewed International journal

Theoretical Computer Science   2020.12

Towards Efficient Interactive Computation of Dynamic Time Warping Distance Reviewed International journal

Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)   2020.10

Longest Square Subsequence Problem Revisited Reviewed International journal

Takafumi Inoue, Shunsuke Inenaga, and Hideo Bannai

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)   2020.10

Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings Reviewed International journal

Shunsuke Inenaga

Proc. Prague Stringology Conference 2020 (PSC 2020)   2020.8

Grammar-compressed Self-index with Lyndon Words Reviewed International journal

IPSJ Transactions on Mathematical Modeling and its Applications   2020.8

DAWGs for Parameterized Matching Online Construction and Related Indexing Structures

Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda

31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020   2020.6

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara

31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020   2020.6

Efficient computation of longest single-arm-gapped palindromes in a string Reviewed

Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara

Theoretical Computer Science   812   160 - 173   2020.4

Practical Grammar Compression Based on Maximal Repeats Reviewed International journal

Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida

Algorithms   13 ( 4 )   103   2020.4

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window Reviewed International journal

Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020)   2020.1

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings Reviewed

Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theory of Computing Systems   2020.1

Faster STR-EC-LCS Computation Reviewed International journal

Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020)   2020.1

An Improved Data Structure for Left-Right Maximal Generic Words Problem Reviewed International journal

Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

30th International Symposium on Algorithms and Computation, ISAAC 2019   40:1 - 40:12   2019.12

On the size of the smallest alphabet for Lyndon trees Reviewed

Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Theoretical Computer Science   792   131 - 143   2019.11

Diverse Palindromic Factorization is NP-Complete Reviewed

International Journal of Foundations of Computer Science   29 ( 2 )   143 - 163   2018.2

A hardness result and new algorithm for the longest common palindromic subsequence problem Reviewed

Shunsuke Inenaga, Heikki Hyyro

INFORMATION PROCESSING LETTERS   129   11 - 15   2018.1

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. Reviewed

Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea

62 ( 1 )   162 - 191   2018.1

Efficient Computation of Substring Equivalence Classes with Suffix Arrays Reviewed

Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

ALGORITHMICA   79 ( 2 )   291 - 318   2017.10

Packed compact tries: A fast and efficient data structure for online string processing Reviewed

Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E100A ( 9 )   1785 - 1793   2017.9

Inferring strings from Lyndon factorization Reviewed

Yuto Nakashima, Takashi Okabe, Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

THEORETICAL COMPUTER SCIENCE   689   147 - 156   2017.8

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text Reviewed

Tomohiro, I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

THEORETICAL COMPUTER SCIENCE   656   215 - 224   2016.12

Generalized pattern matching and periodicity under substring consistent equivalence relations Reviewed

Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

THEORETICAL COMPUTER SCIENCE   656   225 - 233   2016.12

Closed factorization Reviewed

Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro, I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto

DISCRETE APPLIED MATHEMATICS   212   23 - 29   2016.10

Deterministic sub-linear space LCE data structures with efficient construction Reviewed

Yuka Tanimura, I. Tomohiro, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda

Leibniz International Proceedings in Informatics, LIPIcs   54   1.1 - 1.10   2016.6

Efficiently finding all maximal α-gapped repeats Reviewed

Paweł Gawrychowski, I. Tomohiro, Shunsuke Inenaga, Dominik Köppl, Florin Manea

47   39:1-39:14   2016.2

Constructing LZ78 tries and position heaps in linear time for large alphabets Reviewed

Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Information Processing Letters   115 ( 9 )   655 - 659   2015.9

Dynamic edit distance table under a general weighted cost function Reviewed

Journal of Discrete Algorithms   34   2 - 17   2015.9

Compressed automata for dictionary matching Reviewed

Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

THEORETICAL COMPUTER SCIENCE   578   30 - 41   2015.5

Detecting regularities on grammar-compressed strings Reviewed

Tomohiro, I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara

INFORMATION AND COMPUTATION   240   74 - 89   2015.2

Inferring strings from suffix trees and links on a binary alphabet Reviewed

Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

DISCRETE APPLIED MATHEMATICS   163   316 - 325   2014.1

Palindrome pattern matching Reviewed

Tomohiro, I, Shunsuke Inenaga, Masayuki Takeda

THEORETICAL COMPUTER SCIENCE   483   162 - 170   2013.4

Fast q-gram mining on SLP compressed strings Reviewed

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Journal of Discrete Algorithms   18   89 - 99   2013.1

An efficient algorithm to test square-freeness of strings compressed by straight-line programs Reviewed

Hideo Bannai, Travis Gagie, Tomohiro, I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein

INFORMATION PROCESSING LETTERS   112 ( 19 )   711 - 714   2012.10

FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS Reviewed

Shunsuke Inenaga, Hideo Bannai

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE   23 ( 2 )   261 - 280   2012.2

Verifying and enumerating parameterized border arrays Reviewed

Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

THEORETICAL COMPUTER SCIENCE   412 ( 50 )   6959 - 6981   2011.11

Fast q-gram Mining on SLP Compressed Strings Reviewed International journal

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda

Proc. the 18th Symposium on String Processing and Information Retrieval (SPIRE 2011)   LNCS 7024   2011.10

Inferring Strings from Suffix Trees and Links on a Binary Alphabet Reviewed International journal

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. The Prague Stringology Conference 2011 (PSC 2011)   2011.8

Computing Longest Common Substring/Subsequence of Non-linear Texts Reviewed International journal

Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. The Prague Stringology Conference 2011 (PSC 2011)   2011.8

Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts Reviewed International journal

Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda

Proc. the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011)   LNCS 6661   2011.6

Missing pattern discovery Reviewed

Journal of Discrete Algorithms   9 ( 2 )   153 - 165   2011.6

Dynamic Edit Distance Table under a General Weighted Cost Function Reviewed International journal

Proc. 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010),   LNCS 5901   2010.1

Linear-Time text compression by longest-first substitution Reviewed

Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara

Algorithms   2 ( 4 )   1429 - 1448   2009.12

Lightweight Parameterized Suffix Array Construction Reviewed International journal

Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda

Proc. 20th International Workshop on Combinatorial Algorithms (IWOCA 2009)   LNCS 5874   2009.7

Efficient algorithms to compute compressed longest common substrings and compressed palindromes Reviewed

Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto

THEORETICAL COMPUTER SCIENCE   410 ( 8-10 )   900 - 913   2009.3

String Kernels Based on Variable-Length-Don't-Care Patterns Reviewed International journal

Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, and Masayuki Takeda

Proc. 11th International Conference on Discovery Science (DS 2008)   LNAI 5255   2008.10

Parameterized Suffix Arrays for Binary Strings Reviewed International journal

Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda

Proc. The Prague Stringology Conference 2008 (PSC 2008)   2008.9

Reachability on Suffix Tree Graphs Invited Reviewed International journal

Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda

International Journal of Foundations of Computer Science   19 ( 1 )   2008.2

Reachability on suffix tree graphs Reviewed

Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE   19 ( 1 )   147 - 162   2008.2

A New Family of String Classifiers Based on Local Relatedness Reviewed International journal

Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Proc. 9th International Conference on Discovery Science (DS 2006), Lecture Notes in Artificial Intelligence (LNAI 4265)   LNAI 4265   2006.10

A fully compressed pattern matching algorithm for simple collage systems Reviewed

S Inenaga, A Shinohara, M Takeda

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE   16 ( 6 )   1155 - 1166   2005.12

Practical Algorithms for Pattern Based Linear Regression Reviewed International journal

Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, and Masayuki Takeda

8th International Conference on Discovery Science (DS'05)   3735   44 - 56   2005.10

On-line construction of compact directed acyclic word graphs Reviewed

S Inenaga, H Hoshino, A Shinohara, M Takeda, S Arikawa, G Mauri, G Pavesi

DISCRETE APPLIED MATHEMATICS   146 ( 2 )   156 - 179   2005.3

Ternary directed acyclic word graphs Reviewed

S Miyamoto, S Inenaga, M Takeda, A Shinohara

THEORETICAL COMPUTER SCIENCE   328 ( 1-2 )   97 - 111   2004.11

Efficiently finding regulatory elements using correlation with gene expression Reviewed International journal

Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano

Journal of Bioinformatics and Computational Biology   2 ( 2 )   2004.6

Efficiently finding regulatory elements using correlation with gene expression Reviewed

Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano

Journal of Bioinformatics and Computational Biology   2 ( 2 )   273 - 288   2004.6

Compact directed acyclic word graphs for a sliding window Reviewed

Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Journal of Discrete Algorithms   2 ( 1 )   33 - 51   2004.3

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes Reviewed International journal

Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, and Setsuo Arikawa

The 6th International Conference on Discovery Science (DS 2003)   2843   486 - 493   2003.10

A Note on Randomized Algorithm for String Matching with Mismatches Invited Reviewed International journal

Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, and Setsuo Arikawa

Nordic Journal of Computing   10 ( 1 )   2003.4

A String Pattern Regression Algorithm and Its Application to Pattern Discovery in Long Introns Reviewed International journal

Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano

The 13th International Conference on Genome Informatics (GIW 2002)   2002.12

A Note on Randomized Algorithm for String Matching with Mismatches Reviewed International journal

Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, and Setsuo Arikawa

The Prague Stringology Conference '02 (PSC '02)   2002.9

Right-to-left Online Construction of Parameterized Position Heaps International conference

Prague Stringology Conference 2018 (PSC 2018)

Prague Stringology Conference 2018 (PSC 2018)  2018.8 

Longest lyndon substring after edit

Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018  2018.7 

Lyndon factorization of grammar compressed texts revisited

Isamu Furuya, Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018  2018.7 

Longest substring palindrome after edit

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018  2018.7 

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings International conference

Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

28th International Symposium on Algorithms and Computation (ISAAC 2017)  2017.12 

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation International conference

Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov and Simon Puglisi

24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)  2017.9 

Linear-size CDAWG: new repetition-aware indexing and grammar compression International conference

Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga and Hiroki Arimura

24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)  2017.9 

Order preserving pattern matching on trees and DAGs International conference

Tenma Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

24th International Symposium on String Processing and Information Retrieval (SPIRE 2017)  2017.9 

On Reverse Engineering the Lyndon Tree International conference

Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

Prague Stringology Conference 2017 (PSC 2017)  2017.8 

Small-space LCE data structure with constant-time queries International conference

Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda

42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)  2017.8 

Computing abelian string regularities based on RLE

Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

28th International Workshop on Combinational Algorithms, IWOCA 2017  2018.1 

Shortest unique palindromic substring queries in optimal time

Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

28th International Workshop on Combinational Algorithms, IWOCA 2017  2018.1 

Shortest Unique Palindromic Substring Queries in Optimal Time International conference

Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

28th International Workshop on Combinatorial Algorithms (IWOCA 2017)  2017.7 

Computing Abelian string regularities based on RLE International conference

Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

28th International Workshop on Combinatorial Algorithms (IWOCA 2017)  2017.7 

Tight bounds on the maximum number of shortest unique substrings International conference

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)  2017.7 

Faster STR-IC-LCS computation via RLE International conference

Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)  2017.7 

Computing All Distinct Squares in Linear Time for Integer Alphabets International conference

28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)  2017.7 

Fully dynamic data structure for LCE queries in compressed space International conference

Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)  2016.8 

Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing International conference

Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura

27th International Workshop on Combinatorial Algorithms (IWOCA 2016)  2015.6 

Computing Smallest and Largest Repetition Factorizations in O(n log n) time International conference

Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Prague Stringology Conference 2016 (PSC 2016)  2016.8 

Dynamic index and LZ factorization in compressed space International conference

Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Prague Stringology Conference 2016 (PSC 2016)  2016.8 

Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets International conference

Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)  2016.8 

Factorizing a string into squares in linear time International conference

Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)  2015.6 

Fully-online construction of suffix trees for multiple texts International conference

Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura

27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)  2015.6 

Deterministic sub-linear space LCE data structures with efficient construction International conference

Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda

27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)  2015.6 

Longest Common Subsequence in at Least k Length Order-isomorphic Substrings International conference

Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara

43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017)  2017.1 

Computing longest single-arm-gapped palindromes in a string International conference

Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara

43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017)  2017.1 

Compacting a dynamic edit distance table by RLE compression International conference

42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016)  2016.1 

Inferring Strings from Full Abelian Periods International conference

Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

26th International Symposium on Algorithms and Computation (ISAAC 2015)  2015.12 

Finding gapped palindromes online International conference

Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

27th International Workshop on Combinatorial Algorithms (IWOCA 2016)  2016.8 

Efficient Algorithms for Longest Closed Factor Array International conference

22nd Symposium on String Processing and Information Retrieval (SPIRE 2015)  2015.9 

A faster algorithm for computing maximal α-gapped repeats in a string International conference

2015.9 

Computing Left-Right Maximal Generic Words International conference

Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. Prague Stringology Conference 2015 (PSC 2015)  2015.8 

A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications Invited International conference

Shunsuke Inenaga

Proc. Prague Stringology Conference 2015 (PSC 2015)  2015.8 

Diverse Palindromic Factorization is NP-Complete International conference

19th International Conference on Developments in Language Theory (DLT 2015)  2015.7 

Semi-dynamic compact index for short patterns and succinct van Emde Boas tree International conference

Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015)  2015.6 

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding International conference

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015)  2015.6 

An opportunistic text indexing structure based on run length encoding International conference

Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

9th International Conference on Algorithms and Complexity (CIAC 2015)  2015.5 

動的な圧縮索引

西本 崇晃, 井 智弘, 稲永 俊介, 坂内 英夫, 竹田 正幸

LAシンポジウム 2014 冬  2015.1 

制約柔軟パターンを含む最長共通柔軟パターン問題

久保井 啓太, 稲永 俊介, 坂内 英夫, 竹田 正幸

LAシンポジウム 2014 冬  2015.1 

固定長ギャップ付き回文のオンライン計算

中村 道太郎, 稲永 俊介, 坂内 英夫, 竹田 正幸

LAシンポジウム 2014 冬  2015.1 

文字列中にある極大α-gapped repeatの列挙

谷村 優佳, 稲永 俊介, 坂内 英夫, 竹田 正幸

LAシンポジウム 2014 冬  2015.1 

重複のない文字列における α-ギャップ repeat の列挙

藤重 雄大, 稲永 俊介, 坂内 英夫, 竹田 正幸

LAシンポジウム 2014 冬  2015.1 

順序同型パターン照合アルゴリズム

青木 隆宏, 松岡 禎明, 稲永 俊介, 坂内 英夫, 竹田 正幸

LAシンポジウム 2014 冬  2015.1 

Lyndon ≦ LZ77 Conjecture

中島 祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸

LAシンポジウム 2014 冬  2015.1 

A new characterization of maximal repetitions by Lyndon trees International conference

Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta

ACM-SIAM Symposium on Discrete Algorithms 2015 (SODA 2015)  2015.1 

Closed Factorization International conference

Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto

Prague Stringology Conference 2014 (PSC 2014)  2014.9 

Computing Abelian Covers and Abelian Runs International conference

Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Prague Stringology Conference 2014 (PSC 2014)  2014.9 

Inferring strings from Lyndon factorization International conference

Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014)  2014.8 

Computing Palindromic Factorizations and Palindromic Covers On-line International conference

Tomohiro I, Shiho Sugimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014)  2014.6 

Faster Compact On-Line Lempel-Ziv Factorization International conference

Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

31st Symposium on Theoretical Aspects of Computer Science (STACS 2014)  2014.3 

Shortest Unique Substrings Queries in Optimal Time International conference

Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2014)  2014.1 

Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text International conference

Tomohiro I, Yuto Nakashima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

20th Symposium on String Processing and Information Retrieval (SPIRE 2013)  2013.10 

Detecting Regularities on Grammar-compressed Strings International conference

Tomohiro I, Wataru Matsubara, Kouji Shimohira, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara

38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013)  2013.8 

Computing Reversed Lempel-Ziv Factorization Online International conference

Shiho Sugimoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Prague Stringology Conference 2013 (PSC 2013)  2013.8 

Compressed Automata for Dictionary Matching International conference

Tomohiro I, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

18th International Conference on Implementation and Application of Automata (CIAA 2013)  2013.7 

Efficient Lyndon factorization of grammar compressed text International conference

Tomohiro I, Yuto Nakashima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013)  2013.6 

Converting SLP to LZ78 in almost linear time International conference

Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda

24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013)  2013.6 

From Run Length Encoding to LZ78 and Back Again International conference

Yuya Tamakoshi, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Data Compression Conference 2013 (DCC 2013)  2013.3 

Computing convolution on grammar-compressed text International conference

Toshiya Tanaka, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Data Compression Conference 2013 (DCC 2013)  2013.3 

Permuted Pattern Matching on Multi-Track Strings International conference

Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga

39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013)  2013.1 

Efficient LZ78 Factorization of Grammar Compressed Text International conference

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

19th Symposium on String Processing and Information Retrieval (SPIRE 2012)  2012.10 

The Position Heap of a Trie International conference

Yuto Nakashima, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

19th Symposium on String Processing and Information Retrieval (SPIRE 2012)  2012.10 

The Position Heap of a Trie International conference

Yuto Nakashima, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

19th Symposium on String Processing and Information Retrieval (SPIRE 2012)  2012.10 

Speeding-up q-gram mining on grammar-based compressed texts International conference

Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012)  2012.7 

Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts International conference

Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012)  2012.1 

Fast q-gram Mining on SLP Compressed Strings International conference

Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

18th Symposium on String Processing and Information Retrieval (SPIRE 2011)  2011.10 

Inferring Strings from Suffix Trees and Links on a Binary Alphabet International conference

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

The Prague Stringology Conference 2011 (PSC 2011)  2011.8 

Computing Longest Common Substring/Subsequence of Non-linear Texts International conference

Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

The Prague Stringology Conference 2011 (PSC 2011)  2011.8 

Palindrome Pattern Matching International conference

Tomohiro I, Shunsuke Inenaga, Masayuki Takeda

22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011)  2011.6 

Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts International conference

Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011)  2011.6 

An Anonymous Authentication Protocol with Single-database PIR International conference

Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura

Australasian Information Security Conference 2011 (AISC 2011)  2011.1 

Counting and Verifying Maximal Palindromes International conference

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

17th Symposium on String Processing and Information Retrieval (SPIRE 2010)  2010.10 

Counting and Verifying Maximal Palindromes

Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda

2010.9 

Verifying a Parameterized Border Array in $O(n^{1.5})$ Time

2010.9 

Finding Characteristic Substrings from Compressed Texts

2010.7 

Verifying a Parameterized Border Array in O(n^{1.5}) Time International conference

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010)  2010.6 

Modeling Costs of Access Control with Various Key Management Systems

Tomomi Yamasaki, Shunsuke Inenaga, Daisuke Ikeda, and Hiroto Yasuura

2009.7 

平衡直線的プログラムで圧縮された文字列の非反復性検証アルゴリズム

松原渉，稲永俊介，篠原歩

コンピュテーション研究会  2009.3 

マルチサービス環境における署名手法のリンク不能性に関する研究

中村徹，稲永俊介，馬場謙介，池田大輔，安浦寛人

2009年暗号と情報セキュリティシンポジウム（SCIS2009）  2009.1 

プライバシ保護とメモリ効率性の両立を実現するマルチサービス環境向け認証方式

中村徹，稲永俊介，馬場謙介，池田大輔，安浦寛人

コンピュータセキュリティシンポジウム2008  2008.10 

圧縮文字列における最長共通部分文字列および回文を求める多項式時間アルゴリズム

松原渉，稲永俊介，石野明，篠原歩，中村智将，橋本和夫

コンピュテーション研究会  2008.3 

認証システムのプライバシ保護評価のためのフレームワークの提案

中村徹，稲永俊介，池田大輔，馬場謙介，安浦寛人

暗号と情報セキュリティシンポジウム (SCIS2008)  2008.1 

プライバシ保護技術の評価のための権限認証モデル

中村徹，稲永俊介，馬場謙介，池田大輔，安浦寛人

コンピュータセキュリティシンポジウム2007 (CSS2007)  2007.10 

電子マネーシステムの価値保存形式を考慮したモデル化

小山健一郎，稲永俊介，安浦寛人

第63回数理モデル化と問題解決(MPS)研究会  2007.3 

単語接尾辞木再考

稲永俊介，竹田正幸

第61回人工知能基本問題研究会  2005.11 

漸増的最長共通部分列問題

石田祐介，稲永俊介，篠原歩，竹田正幸

日本応用数理学会2005年度年会  2005.9 

欠如パターン発見問題

稲永俊介

情報検索と発見科学に関する研究会  2003.3 

Unification of Algorithms to Construct Index Structures for Texts

2001.7 

連長圧縮に基づくLZ77分解

山本　淳一, 稲永 俊介, 坂内 英夫, 竹田 正幸

夏のLAシンポジウム2012  2012.7 

木構造で表現された複数文字列に対するポジションヒープ

中島　祐人, 井　智弘, 稲永 俊介, 坂内 英夫, 竹田 正幸

夏のLAシンポジウム2012  2012.7 

木構造で表現された複数文字列に対する接尾辞配列の構築

玉腰 裕也, 坂内 英夫, 稲永 俊介, 竹田 正幸

夏のLAシンポジウム2012  2012.7 

直線的プログラムで圧縮された文字列の非反復性検証アルゴリズム

井　智弘, 稲永 俊介, 坂内 英夫

夏のLAシンポジウム2012  2012.7 

極小不在パターンの列挙アルゴリズム

杉本　志穂, 稲永 俊介, 坂内 英夫, 竹田 正幸

夏のLAシンポジウム2012  2012.7 

圧縮テキストに対する畳み込み計算

田中　俊弥, 稲永 俊介, 坂内 英夫, 竹田 正幸

夏のLAシンポジウム2012  2012.7 

逆向きLZ77分解のオンライン計算について

杉本　志穂, 井　智弘, 稲永 俊介, 坂内 英夫, 竹田 正幸

冬のLAシンポジウム2012  2013.1 

圧縮テキスト上で動作するLyndon分解アルゴリズム

井　智弘, 中島　祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸

冬のLAシンポジウム2012  2013.1 

直線的プログラムに含まれる繰り返し構造の検出

西田　真, 井　智弘, 稲永 俊介, 坂内 英夫, 竹田 正幸

冬のLAシンポジウム2012  2013.1 

高速パターン照合を可能にする新しい文法圧縮型自己索引

西本　崇晃, 井　智弘, 稲永 俊介, 坂内 英夫, 竹田 正幸

冬のLAシンポジウム2012  2013.1 

Sorting, Indexing, Computing LCE and LCP of SLP Compressed Strings

2013.7 

Lyndon分解の逆問題

中島　祐人, 岡部 駿志, 井　智弘, 稲永 俊介, 坂内 英夫, 竹田 正幸

夏のLAシンポジウム2013  2013.7 

動的でコンパクトな索引構造

松岡 禎明, 井 智弘, 坂内 英夫, 稲永 俊介, 竹田 正幸

冬のLAシンポジウム2013  2014.1 

省スペースオンラインLZ分解

山本　淳一, 井 智弘, 坂内 英夫, 稲永 俊介, 竹田 正幸

冬のLAシンポジウム2013  2014.1 

連長圧縮と接尾辞配列について

玉腰 裕也, 後藤 啓介, 稲永 俊介, 坂内 英夫, 竹田 正幸

冬のLAシンポジウム2013  2014.1 

LZ78圧縮されたテキストに対するLyndon分解アルゴリズム

井　智弘, 中島　祐人, 稲永 俊介, 坂内 英夫, 竹田 正幸

冬のLAシンポジウム2013  2014.1 

回文による文字列の分解と被覆

杉本　志穂, 井　智弘, 稲永 俊介, 坂内 英夫, 竹田 正幸

冬のLAシンポジウム2013  2014.1 

文字列のアーベル被覆とアーベル連

松田 奨平, 稲永 俊介, 坂内 英夫, 竹田 正幸

夏のLAシンポジウム2014  2014.7 

文字列のアーベル周期の逆問題について

西田 真, 稲永 俊介, 坂内 英夫, 竹田 正幸

夏のLAシンポジウム2014  2014.7 

Efficiently Finding All Maximal α-gapped Repeats International conference

Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea

2016.2 

On repetitiveness measures of Thue-Morse words International conference

Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)  2020.10 

A reduction of the dynamic time warping distance to the longest increasing subsequence length International conference

Yoshifumi Sakai and Shunsuke Inenaga

31st International Symposium on Algorithms and Computation (ISAAC 2020)  2020.12 

Suffix Trees, DAWGs, and CDAWGs for Forward and Backward Tries International conference

Shunsuke Inenaga

14th Latin American Theoretical Informatics Symposium (LATIN 2020)  2021.1 

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform International conference

47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2021)  2021.1 

Computing SEQ-IC-LCS of non-linear texts International conference

Yuki Yonemoto, Yuto Nakashima and Shunsuke Inenaga

26th Prague Stringology Conference (PSC 2023)  2023.8 

On Sensitivity of Compact Directed Acyclic Word Graphs International conference

Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga

14th International Conference on Combinatorics on Words (WORDS 2023)  2023.6 

Bit Catastrophes for the Burrows-Wheeler Transform International conference

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

Space-Efficient STR-IC-LCS Computation International conference

Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai

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

Minimal Absent Words on Run-Length Encoded Strings International conference

Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, and Shunsuke Inenaga

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

Cartesian Tree Subsequence Matching International conference

Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, and Hiroki Arimura

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

RePair Grammars are the Smallest Grammars for Fibonacci Words International conference

Takuya Mieno, Shunsuke Inenaga, and Takashi Horiyama

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

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures International conference

Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda

31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)  2020.6 

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences International conference

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara

31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)  2020.6 

Faster STR-EC-LCS Computation

Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020  2020.1 

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

46th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2020  2020.1 

An improved data structure for left-right maximal generic words problem

Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

30th International Symposium on Algorithms and Computation, ISAAC 2019  2019.12 

Compact Data Structures for Shortest Unique Substring Queries

26th International Symposium on String Processing and Information Retrieval, SPIRE 2019  2019.1 

On Longest Common Property Preserved Substring Queries

Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka

26th International Symposium on String Processing and Information Retrieval, SPIRE 2019  2019.1 

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

26th International Symposium on String Processing and Information Retrieval, SPIRE 2019  2019.1 

Computing Maximal Palindromes and Distinct Palindromes in a Trie International conference

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Prague Stringology Conference 2019 (PSC 2019)  2019.8 

k-Abelian pattern matching: Revisited, corrected, and extended International conference

Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga and Shiho Sugimoto

Prague Stringology Conference 2019 (PSC 2019)  2019.8 

Shortest unique palindromic substring queries on run-length encoded strings

Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

30th International Workshop on Combinatorial Algorithms, IWOCA 2019  2019.1 

Computing runs on a trie

Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019  2019.6 

Online algorithms for constructing linear-size suffix trie

Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga

30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019  2019.6 

On the size of overlapping Lempel-Ziv and Lyndon factorizations

Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019  2019.6 

Faster queries for longest substring palindrome after block edit

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019  2019.6 

The Parameterized Position Heap of a Trie

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

11th International Conference on Algorithms and Complexity, CIAC 2019  2019.1 

MR-RePair Grammar Compression Based on Maximal Repeats

Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida

2019 Data Compression Conference, DCC 2019  2019.3 

Block palindromes A new generalization of palindromes

Keisuke Goto, I. Tomohiro, Hideo Bannai, Shunsuke Inenaga

25th International Symposium on String Processing and Information Retrieval, SPIRE 2018  2018.10 

O(n log n)-time Text Compression by LZ-style Longest First Substitution International conference

Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

Prague Stringology Conference 2018 (PSC 2018)  2018.8 

Computing longest common square subsequences

29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018  2018.7 

Faster online elastic degenerate string matching

Kotaro Aoyama, Yuto Nakashima, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018  2018.7 

一般的な重みに対する編集距離の動的計算

成澤和志，Heikki Hyyrö，稲永俊介

夏のLAシンポジウム2009  2009.7 

Lightweight Construction of Parameterized Suffix Arrays

2009.7 

Reachability on Suffix Tree Graphs

Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda

2006.9 

Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings International conference

Shunsuke Inenaga

Prague Stringology Conference 2020 (PSC 2020)  2020.8 

Towards Efficient Interactive Computation of Dynamic Time Warping Distance International conference

Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)  2020.10 

Longest Square Subsequence Problem Revisited International conference

Takafumi Inoue, Shunsuke Inenaga, and Hideo Bannai

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)  2020.10 

The Parameterized Suffix Tray International conference

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

12th International Conference on Algorithms and Complexity (CIAC 2021)  2021.5 

Counting Lyndon Subsequences International conference

Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, and Masayuki Takeda

Prague Stringology Conference 2021 (PSC 2021)  2021.8 

Grammar Index By Induced Suffix Sorting International conference

28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)  2021.10 

Longest Common Rollercoasters International conference

Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda

28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)  2021.10 

On the approximation ratio of LZ-End to LZ77 International conference

Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, and Masayuki Takeda

28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)  2021.10 

Position Heaps for Cartesian-tree Matching on Strings and Tries International conference

Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, and Shunsuke Inenaga

28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)  2021.10 

Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions International conference

Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, and Takuya Mieno

29th International Symposium on String Processing and Information Retrieval (SPIRE 2022)  2022.10 

Largest Repetition Factorization of Fibonacci Words International conference

Kaisei Kishi, Yuto Nakashima, and Shunsuke Inenaga

30th International Symposium on String Processing and Information Retrieval (SPIRE 2022)  2023.9 

Linear-Time Computation of Generalized Minimal Absent Words of Multiple Strings International conference

Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, and Hideo Bannai

30th International Symposium on String Processing and Information Retrieval (SPIRE 2022)  2023.9 

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph International conference

Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima and Mizuki Sue

30th International Symposium on String Processing and Information Retrieval (SPIRE 2022)  2023.9 

Proc. 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2023) International contribution

2023.6 - 2024.6

Proceedings of the Prague Stringology Conference 2023 (PSC 2023) International contribution

2023.4 - 2023.8

Proc. 30th International Symposium on String Processing and Information Retrieval (SPIRE 2023) International contribution

2023.3 - 2023.9

Proceedings of the 14th International Conference on Words (WORDS 2023) International contribution

Role(s)： Peer review

2023.3