Suffix Trees, DAWGs, and CDAWGs for Forward and Backward Tries 査読 国際誌

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 査読 国際誌

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

The Smallest Grammar Problem Revisited 査読 国際誌

IEEE Transactions on Information Theory   2021年1月

A reduction of the dynamic time warping distance to the longest increasing subsequence length 査読 国際誌

Yoshifumi Sakai and Shunsuke Inenaga

31st International Symposium on Algorithms and Computation (ISAAC 2020)   2020年12月

On repetitiveness measures of Thue-Morse words 査読 国際誌

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 査読

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 査読 国際誌

Data Compression Conference 2020 (DCC 2020)   2020年3月

Efficient Dynamic Dictionary Matching with DAWGs and AC-automata 査読 国際誌

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

Theoretical Computer Science   2019年11月

Compact Data Structures for Shortest Unique Substring Queries 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 and Masayuki Takeda

The 30th International Workshop on Combinatorial Algorithms (IWOCA 2019)   2019年7月

Computing runs on a trie 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)   2018年7月

Longest substring palindrome after edit 査読 国際誌

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 査読

International Journal of Foundations of Computer Science   29 ( 4 )   623 - 645   2018年6月

Diverse Palindromic Factorization is NP-Complete 査読 国際誌

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 査読 国際誌

Journal of Foundations of Computer Science   143 - 163   2018年2月

A hardness result and new algorithm for the longest common palindromic subsequence problem 査読 国際誌

Shunsuke Inenaga and Heikki Hyyro

Information Processing Letters   129   11 - 15   2018年1月

On the size of the smallest alphabet for Lyndon trees 査読

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

Theoretical Computer Science   2018年1月

Efficient dynamic dictionary matching with DAWGs and AC-automata 査読

Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara

Theoretical Computer Science   2018年1月

Inferring strings from Lyndon factorization 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

Proc. the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)   2017年7月

Computing Abelian string regularities based on RLE 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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

Theoretical Computer Science   656(B)   215 - 224   2016年11月

Closed Factorization 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

Lecture Notes in Computer Science 9309   124 - 136   2015年9月

Efficient Algorithms for Longest Closed Factor Array 査読 国際誌

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 査読 国際誌

Heikki Hyyro, Kazuyuki Narisawa, Shunsuke Inenaga

Journal of Discrete Algorithms   34   2 - 17   2015年9月

Computing Left-Right Maximal Generic Words 査読 国際誌

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 招待 国際誌

Shunsuke Inenaga

Proc. the Prague Stringology Conference 2015 (PSC 2015)   1 - 4   2015年8月

Diverse Palindromic Factorization is NP-Complete 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 招待 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Proc. the Prague Stringology Conference 2014 (PSC 2014)   2014年9月

Inferring strings from Lyndon factorization 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Discrete Applied Mathematics   163 ( 3 )   316 - 325   2014年1月

Shortest Unique Substrings Queries in Optimal Time 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

Tomohiro I, Shunsuke Inenaga, Masayuki Takeda

Theoretical Computer Science   483   162 - 170   2013年4月

From Run Length Encoding to LZ78 and Back Again 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

Journal of Discrete Algorithms   18   89 - 99   2013年1月

Efficient LZ78 Factorization of Grammar Compressed Text 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 招待 査読 国際誌

Shunsuke Inenaga and Hideo Bannai

International Journal of Foundations of Computer Science   23 ( 2 )   2012年2月

Finding Characteristic Substrings from Compressed Texts 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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

Theoretical Computer Science   412 ( 50 )   2011年11月

Palindrome Pattern Matching 査読 国際誌

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 査読 国際誌

Journal of Discrete Algorithms   9 ( 2 )   2011年6月

Password Based Anonymous Authentication with Private Information Retrieval 招待 査読 国際誌

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 査読 国際誌

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月

Towards Modeling Stored-Value Electronic Money Systems 査読 国際誌

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 査読 国際誌

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

IPSJ Transactions on Mathematical Modeling and its Applications   3 ( 3 )   2010年10月

Counting and Verifying Maximal Palindromes 査読 国際誌

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月

Verifying a Parameterized Border Array in $O(n^{1.5})$ Time 査読 国際誌

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 招待 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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

Algorithms   2 ( 24 )   2009年11月

Finding Characteristic Substrings from Compressed Texts 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 国際誌

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

Proc. Data Compression Conference 2007 (DCC 2007)   2007年3月

Sparse Directed Acyclic Word Graphs 査読 国際誌

Shunsuke Inenaga and Masayuki Takeda

13th International Symposium on String Processing and Information Retrieval (SPIRE'06)   2006年10月

Sparse Compact Directed Acyclic Word Graphs 査読 国際誌

Shunsuke Inenaga and Masayuki Takeda

The Prague Stringology Conference '06 (PSC'06)   2006年8月

Reachability on Suffix Tree Graphs 査読 国際誌

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 査読 国際誌

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 招待 査読 国際誌

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 査読 国際誌

Stanislav Angelov and Shunsuke Inenaga

12th International Symposium on String Processing and Information Retrieval (SPIRE'05)   2005年11月

Fully Incremental LCS Computation 査読 国際誌

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 招待 査読 国際誌

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 査読 国際誌

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 招待 査読 国際誌

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 査読 国際誌

7th International Conference on Discovery Science (DS 2004)   3245   32 - 46   2004年10月

Finding Missing Patterns 査読 国際誌

4th Workshop on Algorithms in Bioinformatics (WABI 2004)   2004年9月

A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems 査読 国際誌

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 招待 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 招待 査読

Shunsuke Inenaga

Nordic Journal of Computing   10 ( 1 )   2003年4月

Discovering Best Variable-Length-Don't-Care Patterns 査読 国際誌

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 査読 国際誌

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 査読 国際誌

Shunsuke Inenaga

The Prague Stringology Conference '02 (PSC '02)   2002年9月

The Minimum DAWG for All Suffixes of a String and Its Applications 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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

SPIRE 2023   2023年9月

Largest Repetition Factorization of Fibonacci Words 査読 国際誌

Kaisei Kishi, Yuto Nakashima, and Shunsuke Inenaga

SPIRE 2023   2023年9月

Linear-Time Computation of Generalized Minimal Absent Words of Multiple Strings 査読 国際誌

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 査読

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 査読 国際誌

Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga

PSC 2023   2023年8月

On Sensitivity of Compact Directed Acyclic Word Graphs 査読 国際誌

Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga

WORDS 2023   168 - 180   2023年6月

Bit Catastrophes for the Burrows-Wheeler Transform 査読 国際誌

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

LNCS 13911   86 - 99   2023年6月

Sensitivity of string compressors and repetitiveness measures. 査読 国際誌

Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga

Inf. Comput.   291   104999 - 104999   2023年3月

Space-Efficient STR-IC-LCS Computation 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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

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

Minimal Absent Words on Run-Length Encoded Strings 査読 国際誌

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

Proc. 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022)   2022年6月

Combinatorics of minimal absent words for a sliding window 査読 国際誌

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

Theoretical Computer Science   2022年6月

Cartesian Tree Subsequence Matching 査読 国際誌

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 査読 国際誌

Takuya Mieno, Shunsuke Inenaga, and Takashi Horiyama

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 査読

Yoshifumi Sakai, Shunsuke Inenaga

Algorithmica   84 ( 9 )   2581 - 2596   2022年5月

Factorizing Strings into Repetitions 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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

Longest Common Rollercoasters 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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

Proc. Prague Stringology Conference 2021 (PSC 2021)   2021年8月

Longest previous overlapping factor array 査読 国際誌

Hideo Bannai, Shunsuke Inenaga, and Neerja Mhaskar

Information Processing Letters   2021年6月

The Parameterized Suffix Tray 査読 国際誌

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 査読 国際誌

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

Algorithms   2021年4月

Space-efficient algorithms for computing minimal/shortest unique substrings 査読 国際誌

Theoretical Computer Science   2020年12月

Space-efficient algorithms for computing minimal/shortest unique substrings 査読

Theoretical Computer Science   2020年12月

Longest Square Subsequence Problem Revisited 査読 国際誌

Takafumi Inoue, Shunsuke Inenaga, and Hideo Bannai

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)   2020年10月

Towards Efficient Interactive Computation of Dynamic Time Warping Distance 査読 国際誌

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

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)   2020年10月

Grammar-compressed Self-index with Lyndon Words 査読 国際誌

IPSJ Transactions on Mathematical Modeling and its Applications   2020年8月

Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings 査読 国際誌

Shunsuke Inenaga

Proc. Prague Stringology Conference 2020 (PSC 2020)   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 査読

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 査読 国際誌

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 査読 国際誌

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 査読

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

Theory of Computing Systems   2020年1月

Faster STR-EC-LCS Computation 査読 国際誌

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 査読 国際誌

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 査読

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

Theoretical Computer Science   792   131 - 143   2019年11月

Diverse Palindromic Factorization is NP-Complete 査読

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 査読

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. 査読

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 査読

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 査読

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 査読

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 査読

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 査読

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

THEORETICAL COMPUTER SCIENCE   656   225 - 233   2016年12月

Closed factorization 査読

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 査読

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 査読

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 査読

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 査読

Journal of Discrete Algorithms   34   2 - 17   2015年9月

Compressed automata for dictionary matching 査読

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

THEORETICAL COMPUTER SCIENCE   578   30 - 41   2015年5月

Detecting regularities on grammar-compressed strings 査読

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 査読

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

DISCRETE APPLIED MATHEMATICS   163   316 - 325   2014年1月

Palindrome pattern matching 査読

Tomohiro, I, Shunsuke Inenaga, Masayuki Takeda

THEORETICAL COMPUTER SCIENCE   483   162 - 170   2013年4月

Fast q-gram mining on SLP compressed strings 査読

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 査読

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 査読

Shunsuke Inenaga, Hideo Bannai

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE   23 ( 2 )   261 - 280   2012年2月

Verifying and enumerating parameterized border arrays 査読

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 査読

Journal of Discrete Algorithms   9 ( 2 )   153 - 165   2011年6月

Dynamic Edit Distance Table under a General Weighted Cost Function 査読 国際誌

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 査読

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

Algorithms   2 ( 4 )   1429 - 1448   2009年12月

Lightweight Parameterized Suffix Array Construction 査読 国際誌

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 査読

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 査読 国際誌

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 査読 国際誌

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 招待 査読 国際誌

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 査読

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 査読 国際誌

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 査読

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 査読 国際誌

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 査読

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 査読

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 査読 国際誌

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 査読

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 査読

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 査読 国際誌

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 招待 査読 国際誌

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 査読 国際誌

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 査読 国際誌

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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月 

Computing All Distinct Squares in Linear Time for Integer Alphabets 国際会議

28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)  2017年7月 

Shortest Unique Palindromic Substring Queries in Optimal Time 国際会議

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 国際会議

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 国際会議

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 国際会議

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

28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017)  2017年7月 

Fully dynamic data structure for LCE queries in compressed space 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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

Inferring Strings from Full Abelian Periods 国際会議

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 国際会議

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 国際会議

22nd Symposium on String Processing and Information Retrieval (SPIRE 2015)  2015年9月 

A faster algorithm for computing maximal α-gapped repeats in a string 国際会議

2015年9月 

Computing Left-Right Maximal Generic Words 国際会議

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 招待 国際会議

Shunsuke Inenaga

Proc. Prague Stringology Conference 2015 (PSC 2015)  2015年8月 

Diverse Palindromic Factorization is NP-Complete 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Prague Stringology Conference 2014 (PSC 2014)  2014年9月 

Inferring strings from Lyndon factorization 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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

Prague Stringology Conference 2013 (PSC 2013)  2013年8月 

Compressed Automata for Dictionary Matching 国際会議

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 国際会議

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 国際会議

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 国際会議

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

Data Compression Conference 2013 (DCC 2013)  2013年3月 

Computing convolution on grammar-compressed text 国際会議

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 国際会議

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 国際会議

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda

19th Symposium on String Processing and Information Retrieval (SPIRE 2012)  2012年10月 

The Position Heap of a Trie 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

The Prague Stringology Conference 2011 (PSC 2011)  2011年8月 

Palindrome Pattern Matching 国際会議

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 国際会議

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 国際会議

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

Australasian Information Security Conference 2011 (AISC 2011)  2011年1月 

Counting and Verifying Maximal Palindromes 国際会議

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 国際会議

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 国際会議

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

2016年2月 

On repetitiveness measures of Thue-Morse words 国際会議

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 国際会議

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 国際会議

Shunsuke Inenaga

14th Latin American Theoretical Informatics Symposium (LATIN 2020)  2021年1月 

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform 国際会議

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 国際会議

Yuki Yonemoto, Yuto Nakashima and Shunsuke Inenaga

26th Prague Stringology Conference (PSC 2023)  2023年8月 

On Sensitivity of Compact Directed Acyclic Word Graphs 国際会議

Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga

14th International Conference on Combinatorics on Words (WORDS 2023)  2023年6月 

Bit Catastrophes for the Burrows-Wheeler Transform 国際会議

27th International Conference on Developments in Language Theory (DLT 2023)  2023年6月 

Space-Efficient STR-IC-LCS Computation 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

Shunsuke Inenaga

Prague Stringology Conference 2020 (PSC 2020)  2020年8月 

Towards Efficient Interactive Computation of Dynamic Time Warping Distance 国際会議

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 国際会議

Takafumi Inoue, Shunsuke Inenaga, and Hideo Bannai

27th International Symposium on String Processing and Information Retrieval (SPIRE 2020)  2020年10月 

The Parameterized Suffix Tray 国際会議

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 国際会議

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

Prague Stringology Conference 2021 (PSC 2021)  2021年8月 

Grammar Index By Induced Suffix Sorting 国際会議

28th International Symposium on String Processing and Information Retrieval (SPIRE 2021)  2021年10月 

Longest Common Rollercoasters 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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 国際会議

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) 国際学術貢献

2023年6月 - 2024年6月

Proceedings of the Prague Stringology Conference 2023 (PSC 2023) 国際学術貢献

2023年4月 - 2023年8月