Kyushu University Academic Staff Educational and Research Activities Database
Researcher information (To researchers) Need Help? How to update
Shunsuke Inenaga Last modified date:2016.10.05



Graduate School
Undergraduate School


E-Mail
Phone
092-802-3790
Fax
092-802-3790
Academic Degree
Dr. Science
Field of Specialization
Computer Science
Outline Activities
Research interests: Data structures and algorithms for efficient string processing
Lectures: Foundations of Computer Science, Graph Theory, Advanced Data Structures
Research
Research Interests
  • String processing algorithms and its applications
    keyword : combinatorial pattern matching, pattern discovery, text compression
    2000.04~2021.03.
Current and Past Project
  • The project seeks efficient methods for mining compressed data.
  • The project seeks efficient methods for mining compressed data.
Academic Activities
Books
1. Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai, String Processing and Information Retrieval (SPIRE 2016), Springer, LNCS 9954, 2016.10.
2. Adrian Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide, Special issue of Language and Automata Theory and Applications 2011 (LATA 2011), International Journal of Computer Mathematics (Taylor & Francis), 2013.06.
3. Adrian Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide, Language and Automata Theory and Applications 2011 (LATA 2011), Springer, LNCS 6638, 2011.05.
Papers
1. Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Generalized pattern matching and periodicity under substring consistent equivalence relations, Theoretical Computer Science, 2016.02.
2. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, Theoretical Computer Science, 2016.02.
3. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Shunsuke Inenaga, Costas S. Iliopoulos, Simon J. Puglisi, Shiho Sugimoto, Closed Factorization, Discrete Applied Mathematics, 212, 2016.10.
4. Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Efficient Computation of Substring Equivalence Classes with Suffix Arrays, Algorithmica, 2016.08.
5. Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Smallest and Largest Repetition Factorizations in O(n log n) time, Proc. Prague Stringology Conference 2016 (PSC 2016), 2016.08.
6. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Dynamic index and LZ factorization in compressed space, Proc. Prague Stringology Conference 2016, 2016.08.
7. Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets, Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016.08.
8. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Shortest Unique Substring Queries on Run-Length Encoded Strings, Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016.08.
9. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Fully dynamic data structure for LCE queries in compressed space, Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016.08.
10. Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura, Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing, Proc. 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), LNCS 9843, 2016.08.
11. Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Finding gapped palindromes online, Proc. 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), Lecture Notes in Computer Science 9843, 2016.08.
12. Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Fully-online construction of suffix trees for multiple texts, Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016.06.
13. Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon Puglisi, Masayuki Takeda, Deterministic sub-linear space LCE data structures with efficient construction, Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016.06.
14. Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Factorizing a string into squares in linear time, Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016.06.
15. Paweł Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea, Efficiently Finding All Maximal α-gapped Repeats, Proc. the 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016.02.
16. Heikki Hyyro, Shunsuke Inenaga, Compacting a dynamic edit distance table by RLE compression, 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), 34, 2016.01, [URL].
17. Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring Strings from Full Abelian Periods, Proc. 26th International Symposium on Algorithms and Computation (ISAAC 2015), Lecture Notes in Computer Science, 2015.12.
18. Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, A faster algorithm for computing maximal α-gapped repeats in a string, Proc. the 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), Lecture Notes in Computer Science 9309, 2015.09.
19. Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Waleń, 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, 2015.09.
20. Shunsuke Inenaga, A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications, Proc. the Prague Stringology Conference 2015 (PSC 2015), 2015.08.
21. Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Left-Right Maximal Generic Words, Proc. the Prague Stringology Conference 2015 (PSC 2015), 2015.08.
22. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto, Diverse Palindromic Factorization is NP-Complete, Proc. the 19th International Conference on Developments in Language Theory (DLT 2015), Lecture Notes in Computer Science 9168, 2015.07.
23. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding, Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), Lecture Notes in Computer Science 9133, 2015.06.
24. Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Semi-dynamic compact index for short patterns and succinct van Emde Boas tree, Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), Lecture Notes in Computer Science 9133, 2015.06.
25. Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, An opportunistic text indexing structure based on run length encoding, Proc. the 9th International Conference on Algorithms and Complexity (CIAC 2015), Lecture Notes in Computer Science 9079, 2015.05.
26. Heikki Hyyro, Kazuyuki Narisawa, Shunsuke Inenaga, Dynamic Edit Distance Table under a General Weighted Cost Function, Journal of Discrete Algorithms, 34, 2015.09.
27. Yuto Nakashima, Tomihiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets, Information Processing Letters, 115, 9, 2015.09.
28. Tomihiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Compressed automata for dictionary matching, Theoretical Computer Science, 578, 2015.05.
29. Tomohiro I, Kouji Shimohira, Wataru Matsubara, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara, Detecting regularities on grammar-compressed strings, Information and Computation, 240, 2015.02.
30. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta, A new characterization of maximal repetitions by Lyndon trees, Proc. ACM-SIAM Symposium on Discrete Algorithms 2015 (SODA 2015), 562-571, 2015.01.
31. Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Abelian Covers and Abelian Runs, Proc. the Prague Stringology Conference 2014 (PSC 2014), 43-51, 2014.09.
32. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Shunsuke Inenaga, Costas S. Iliopoulos, Simon J. Puglisi, Shiho Sugimoto, Closed Factorization, Proc. the Prague Stringology Conference 2014 (PSC 2014), 162-168, 2014.09.
33. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring strings from Lyndon factorization, Proc. the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), Lecture Notes in Computer Science 8635, 565-576, 2014.08.
34. Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Palindromic Factorizations and Palindromic Covers On-line, Proc. 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), Lecture Notes in Computer Science 8486, 150-161, 2014.06.
35. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Efficient Lyndon factorization of grammar compressed text, Proc. 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), Lecture Notes in Computer Science 7922, 153-164, 2013.10.
36. Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda, Converting SLP to LZ78 in almost linear time, Proc. 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), Lecture Notes in Computer Science 7922, 38-49, 2013.10.
37. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Compressed Automata for Dictionary Matching, Proc. the 18th International Conference on Implementation and Application of Automata (CIAA 2013), Lecture Notes in Computer Science 7982, 319-330, 2013.10.
38. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Sninohara, Detecting Regularities on Grammar-compressed Strings, Proc. the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), Lecture Notes in Computer Science 8087, 571-582, 2013.08.
39. Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Reversed Lempel-Ziv Factorization Online, Proc. the Prague Stringology Conference 2013 (PSC 2013), 107-118, 2013.08.
40. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text, Proc. the 20th Symposium on String Processing and Information Retrieval (SPIRE 2013), Lecture Notes in Computer Science 8214, 174-185, 2013.10.
41. Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Shortest Unique Substrings Queries in Optimal Time, Proc. 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2014), LNCS 8327, 2014.01.
42. Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Faster Compact On-Line Lempel-Ziv Factorization, Proc. 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014), Leibniz International Proceedings in Informatics (LIPIcs) 25, 2014.03.
43. Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Inferring Strings from Suffix Trees and Links on a Binary Alphabet, Discrete Applied Mathematics, 163, 3, 2014.01.
44. Tomohiro I, Shunsuke Inenaga, Masayuki Takeda, Palindrome Pattern Matching, Theoretical Computer Science, 483, 2013.04.
45. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Fast q-gram mining on SLP compressed strings, Journal of Discrete Algorithms, 18, 2013.01.
46. Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein, An efficient algorithm to test square-freeness of strings compressed by straight-line programs, Information Processing Letters, 122, 9, 2012.10.
47. Shunsuke Inenaga, Hideo Bannai, Finding Characteristic Substrings from Compressed Texts, International Journal of Foundations of Computer Science, 23, 2, 2012.02.
48. Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing convolution on grammar-compressed text, Proc. Data Compression Conference 2013 (DCC 2013), 2013.03.
49. Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, From Run Length Encoding to LZ78 and Back Again, Proc. Data Compression Conference 2013 (DCC 2013), 2013.03.
50. Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, Permuted Pattern Matching on Multi-Track Strings, Proc. the 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013), Lecture Notes in Computer Science 7741, 280-291, 2013.01.
51. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, The Position Heap of a Trie, Proc. the 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), Lecture Notes in Computer Science 7608, 360-371, 2012.10.
52. Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Efficient LZ78 Factorization of Grammar Compressed Text, Proc. the 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), Lecture Notes in Computer Science 7608, 86-98, 2012.10.
53. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Speeding-up q-gram mining on grammar-based compressed texts, Proc. the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012), Lecture Notes in Computer Science 7354, 220-231, 2012.07.
54. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda, Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts, Proc. the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), Lecture Notes in Computer Science 7147, 301-312, 2012.01.
55. Shunsuke Inenaga and Hideo Bannai, Finding Characteristic Substrings from Compressed Texts, International Journal of Foundations of Computer Science, 23, 2, 261-280, 2012.02.
56. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, Verifying and Enumerating Parameterized Border Arrays, Theoretical Computer Science, 412, 50, 6959-6981, 2011.11.
57. Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, and Kazuo Hashimoto, Computing longest common substring and all palindromes from compressed strings, Proc. 34th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2008), LNCS 4910, 364-375, 2008.01.
58. Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, Efficient Computation of Substring Equivalence Classes with Suffix Arrays, Proc. 18th Annual Symposium on Combinatorial Pattern Matching (CPM 2007), LNCS 4580, 340-351, 2007.07.
59. Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda, Simple Linear-Time Off-Line Text Compression by Longest-First Substitution, Proc. Data Compression Conference 2007 (DCC 2007), 123-132, 2007.03.
60. Shunsuke Inenaga and Masayuki Takeda, Sparse Directed Acyclic Word Graphs, 13th International Symposium on String Processing and Information Retrieval (SPIRE'06), Lecture Notes in Computer Science (LNCS4209), pp. 61-73, Springer-Verlag, 2006.10.
61. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda, Reachability on Suffix Tree Graphs, The Prague Stringology Conference '06 (PSC'06), pp. 212-225, Czech Technical University, 2006.08.
62. Shunsuke Inenaga and Masayuki Takeda, Sparse Compact Directed Acyclic Word Graphs, The Prague Stringology Conference '06 (PSC'06), pp. 195-211, Czech Technical University, 2006.08.
63. Shunsuke Inenaga and Masayuki Takeda, On-line Linear-time Construction of Word Suffix Trees, 17th Annual Symposium on Combinatorial Pattern Matching (CPM'06), Lecture Notes in Computer Science (LNCS4009), pp. 60-71, Springer-Verlag, 2006.07.
64. Stanislav Angelov and Shunsuke Inenaga, Composite Pattern Discovery for PCR Application, 12th International Symposium on String Processing and Information Retrieval (SPIRE'05), Lecture Notes in Computer Science (LNCS3772), pp. 167-178, Springer-Verlag, 2005.11.
65. Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda, Fully Incremental LCS Computation, 15th International Symposium on Fundamentals of Computation Theory (FCT'05), 3623, Lecture Notes in Computer Science (LNCS3623), pp. 563-574, Springer-Verlag, 2005.08.
66. Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda, An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars, Eighth International Conference on Developments in Language Theory (DLT'04), 3340, Lecture Notes in Computer Science (LNCS3340), pp. 225-236, Springer-Verlag, 2004.12.
67. Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano, Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance, 7th International Conference on Discovery Science (DS 2004), 3245, Lecture Notes in Artificial Intelligence (LNAI3245), pp. 32-46, Springer-Verlag, 2004.10.
68. Shunsuke Inenaga, Teemu Kivioja, and Veli Mäkinen, Finding Missing Patterns, 4th Workshop on Algorithms in Bioinformatics (WABI 2004), Lecture Notes in Bioinformatics (LNBI3240), pp. 461-474, Springer-Verlag, 2004.09.
69. Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda, A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems, The Prague Stringology Conference '04 (PSC '04), 16, 6, pp. 98-113, Czech Technical University, 2004.08.
70. Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, and Ayumi Shinohara, Linear-Time Off-Line Text Compression by Longest-First Substitution, 10th International Symposium on String Processing and Information Retrieval (SPIRE 2003), 2857, Lecture Notes in Computer Science (LNCS2857), pp. 137-152, Springer-Verlag, 2003.10.
71. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda, Inferring Strings from Graphs and Arrays, 28th International Symposium on Mathematical Foundations of Computer Science (MFCS 2003), 2747, Lecture Notes in Computer Science (LNCS2747), pp. 208-217, Springer-Verlag, 2003.08.
72. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, and Ayumi Shinohara, Ternary Directed Acyclic Word Graphs, Eighth International Conference on Implementation and Application of Automata (CIAA 2003, 2759, Lecture Notes in Computer Science (LNCS2759), pp. 121-130, 2003.07.
73. Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa, Discovering Best Variable-Length-Don't-Care Patterns, The Fifth International Conference on Discovery Science (DS '02), 2534, Lecture Notes in Computer Science (LNCS2534), pp. 86-97, 2002.11.
74. Shunsuke Inenaga, Bidirectional Construction of Suffix Trees, The Prague Stringology Conference '02 (PSC '02), pp. 75-87, Czech Technical University, 2002.09.
75. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa, Compact Directed Acyclic Word Graphs for a Sliding Window, 9th International Symposium on String Processing and Information Retrieval (SPIRE 2002), Lecture Notes in Computer Science (LNCS 2476), pp. 310-324, 2002.09.
76. Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, and Setsuo Arikawa, The Minimum DAWG for All Suffixes of a String and Its Applications, 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), 2373, Lecture Notes in Computer Science (LNCS 2373), pp. 153-167, 2002.07.
77. Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa, A Practical Algorithm to Find the Best Episode Patterns, The Fourth International Conference on Discovery Science (DS '01), Lecture Notes in Artificial Intelligence (LNAI 2226), pp. 435-440, 2001.11.
78. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa, On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs, 8th International Symposium on String Processing and Information Retrieval (SPIRE '01), pp. 96-110, IEEE Computer Society, 2001.11.
79. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, and Giulio Pavesi, On-Line Construction of Compact Directed Acyclic Word Graphs, 12th Annual Symposium on Combinatorial Pattern Matching (CPM 2001), 146, 2, Lecture Notes in Computer Science (LNCS 2089), pp. 169-180, 2001.07.
80. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa, Construction of the CDAWG for a Trie, The Prague Stringology Conference '01 (PSC '01), pp. 37-48, Czech Technical University, 2001.09.
Presentations
1. Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Smallest and Largest Repetition Factorizations in O(n log n) time, Prague Stringology Conference 2016 (PSC 2016), 2016.08.
2. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Dynamic index and LZ factorization in compressed space, Prague Stringology Conference 2016 (PSC 2016), 2016.08.
3. Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016.08.
4. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Fully dynamic data structure for LCE queries in compressed space, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 2016.08.
5. Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura, Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing, 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), 2015.06.
6. Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Finding gapped palindromes online, 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), 2016.08.
7. Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Fully-online construction of suffix trees for multiple texts, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2015.06.
8. Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda, Deterministic sub-linear space LCE data structures with efficient construction, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2015.06.
9. Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Factorizing a string into squares in linear time, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2015.06.
10. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea, Efficiently Finding All Maximal α-gapped Repeats, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016.02.
11. Heikki Hyyrö, Shunsuke Inenaga, 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.01.
12. Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring Strings from Full Abelian Periods, 26th International Symposium on Algorithms and Computation (ISAAC 2015), 2015.12.
13. Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, A faster algorithm for computing maximal α-gapped repeats in a string, 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), 2015.09.
14. Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Waleń, Efficient Algorithms for Longest Closed Factor Array, 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), 2015.09.
15. Shunsuke Inenaga, A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications, Proc. Prague Stringology Conference 2015 (PSC 2015), 2015.08.
16. Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Left-Right Maximal Generic Words, Proc. Prague Stringology Conference 2015 (PSC 2015), 2015.08.
17. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto, Diverse Palindromic Factorization is NP-Complete, 19th International Conference on Developments in Language Theory (DLT 2015), 2015.07.
18. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding, 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), 2015.06.
19. Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Semi-dynamic compact index for short patterns and succinct van Emde Boas tree, 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), 2015.06.
20. Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, An opportunistic text indexing structure based on run length encoding, 9th International Conference on Algorithms and Complexity (CIAC 2015), 2015.05.
21. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta, A new characterization of maximal repetitions by Lyndon trees, ACM-SIAM Symposium on Discrete Algorithms 2015 (SODA 2015), 2015.01.
22. Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Abelian Covers and Abelian Runs, Prague Stringology Conference 2014 (PSC 2014), 2014.09.
23. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto, Closed Factorization, Prague Stringology Conference 2014 (PSC 2014), 2014.09.
24. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring strings from Lyndon factorization, 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), 2014.08.
25. Tomohiro I, Shiho Sugimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Computing Palindromic Factorizations and Palindromic Covers On-line, 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 2014.06.
26. Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Faster Compact On-Line Lempel-Ziv Factorization, 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014.03.
27. Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Shortest Unique Substrings Queries in Optimal Time, 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2014), 2014.01.
28. Tomohiro I, Yuto Nakashima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text, 20th Symposium on String Processing and Information Retrieval (SPIRE 2013), 2013.10.
29. Shiho Sugimoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Computing Reversed Lempel-Ziv Factorization Online, Prague Stringology Conference 2013 (PSC 2013), 2013.08.
30. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara, Detecting Regularities on Grammar-compressed Strings, 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), 2013.08.
31. Tomohiro I, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Compressed Automata for Dictionary Matching, 18th International Conference on Implementation and Application of Automata (CIAA 2013), 2013.07.
32. Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda, Converting SLP to LZ78 in almost linear time, 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 2013.06.
33. Tomohiro I, Yuto Nakashima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Efficient Lyndon factorization of grammar compressed text, 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), 2013.06.
34. Toshiya Tanaka, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Computing convolution on grammar-compressed text, Data Compression Conference 2013 (DCC 2013), 2013.03.
35. Yuya Tamakoshi, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, From Run Length Encoding to LZ78 and Back Again, Data Compression Conference 2013 (DCC 2013), 2013.03.
36. Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, Permuted Pattern Matching on Multi-Track Strings, 39th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013), 2013.01.
37. Yuto Nakashima, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, The Position Heap of a Trie, 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), 2012.10.
38. Yuto Nakashima, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, The Position Heap of a Trie, 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), 2012.10.
39. Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Efficient LZ78 Factorization of Grammar Compressed Text, 19th Symposium on String Processing and Information Retrieval (SPIRE 2012), 2012.10.
40. Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Speeding-up q-gram mining on grammar-based compressed texts, 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012), 2012.07.
41. Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts, 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), 2012.01.
42. Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Fast q-gram Mining on SLP Compressed Strings, 18th Symposium on String Processing and Information Retrieval (SPIRE 2011), 2011.10.
43. Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Longest Common Substring/Subsequence of Non-linear Texts, The Prague Stringology Conference 2011 (PSC 2011), 2011.08.
44. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring Strings from Suffix Trees and Links on a Binary Alphabet, The Prague Stringology Conference 2011 (PSC 2011), 2011.08.
45. Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts, 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011.06.
46. Tomohiro I, Shunsuke Inenaga, Masayuki Takeda, Palindrome Pattern Matching, 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), 2011.06.
47. Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura, An Anonymous Authentication Protocol with Single-database PIR, Australasian Information Security Conference 2011 (AISC 2011), 2011.01.
48. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Counting and Verifying Maximal Palindromes, 17th Symposium on String Processing and Information Retrieval (SPIRE 2010), 2010.10.
49. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Verifying a Parameterized Border Array in O(n^{1.5}) Time, 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), 2010.06.
Membership in Academic Society
  • EATCS
  • Information Processing Society of Japan
  • LA Symposium
Social
Professional and Outreach Activities
Outreach activities: Lectures at junior high schools, high schools, and symposiums
Professional activities: International joint work with researchers from Finland, Israel, Germany, etc..