Kyushu University Academic Staff Educational and Research Activities Database
List of Papers
Shunsuke Inenaga Last modified date:2019.06.24

Associate Professor / Mathematical Informatics / Department of Informatics / Faculty of Information Science and Electrical Engineering


Papers
1. Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Takuya Kida, MR-RePair: Grammar Compression based on Maximal Repeats, Data Compression Conference 2019 (DCC 2019), 2019.03.
2. Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays, 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018), 2018.10.
3. Keisuke Goto, Tomohiro I, Hideo Bannai and Shunsuke Inenaga, Block Palindromes: A New Generalization of Palindromes, 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018), 2018.10.
4. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, Right-to-left Online Construction of Parameterized Position Heaps, Prague Stringology Conference 2018 (PSC 2018), 2018.08.
5. Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, O(n log n)-time Text Compression by LZ-style Longest First Substitution, Prague Stringology Conference 2018 (PSC 2018), 2018.08.
6. Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Lyndon Factorization of Grammar Compressed Texts Revisited, Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018.07.
7. Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, Longest Lyndon Substring After Edit, Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018.07.
8. Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, and Masayuki Takeda, Computing longest common square subsequences, Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018.07.
9. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, Longest substring palindrome after edit, Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018.07.
10. Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Faster Online Elastic Degenerate String Matching, Proc. the 29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018.07.
11. 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, Journal of Foundations of Computer Science, http://dx.doi.org/10.1142/S0129054118400014, 143-163, 29(2):143-163, 2018.02.
12. Takaaki Nishimoto, I. Tomohiro, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Dynamic index and LZ factorization in compressed space, Discrete Applied Mathematics, 10.1016/j.dam.2019.01.014, 2019.01.
13. Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Algorithms and combinatorial properties on shortest unique palindromic substrings, Journal of Discrete Algorithms, 10.1016/j.jda.2018.11.009, 52-53, 122-132, 2018.09, A palindrome is a string that reads the same forward and backward. A palindromic substring P of a string S is called a shortest unique palindromic substring (SUPS) for an interval [s,t] in S, if P occurs exactly once in S, this occurrence of P contains interval [s,t], and every palindromic substring of S which contains interval [s,t] and is shorter than P occurs at least twice in S. The SUPS problem is, given a string S, to preprocess S so that for any subsequent query interval [s,t] all the SUPSs for interval [s,t] can be answered quickly. We present an optimal solution to this problem. Namely, we show how to preprocess a given string S of length n in O(n) time and space so that all SUPSs for any subsequent query interval can be answered in O(α+1) time, where α is the number of outputs. We also discuss the number of SUPSs in a string..
14. Heikki Hyyrö, Shunsuke Inenaga, Dynamic RLE-Compressed Edit Distance Tables under General Weighted Cost Functions, International Journal of Foundations of Computer Science, 10.1142/S0129054118410083, 29, 4, 623-645, 2018.06, Kim and Park [A dynamic edit distance table, J. Disc. Algo., 2:302-312, 2004] proposed a method (KP) based on a "dynamic edit distance table" that allows one to efficiently maintain unit cost edit distance information between two strings A of length m and B of length n when the strings can be modified by single-character edits to their left or right ends. This type of computation is useful e.g. in cyclic string comparison. KP uses linear time, O(m + n), to update the distance representation after each single edit. Recently Hyyrö et al. [Incremental string comparison, J. Disc. Algo., 34:2-17, 2015] presented an efficient method for maintaining the dynamic edit distance table under general weighted edit distance, running in O(c(m + n)) time per single edit, where c is the maximum weight of the cost function. The work noted that the Θ(mn) space requirement, and not the running time, may be the main bottleneck in using the dynamic edit distance table. In this paper we take the first steps towards reducing the space usage of the dynamic edit distance table by RLE compressing A and B. Let M and N be the lengths of RLE compressed versions of A and B, respectively. We propose how to store the dynamic edit distance table using Θ(mN + Mn) space while maintaining the same time complexity as the previous methods for uncompressed strings..
15. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto, Diverse Palindromic Factorization is NP-Complete, International Journal of Foundations of Computer Science, 10.1142/S0129054118400014, 29, 2, 143-163, 2018.02.
16. Shunsuke Inenaga and Heikki Hyyro, A hardness result and new algorithm for the longest common palindromic subsequence problem, Information Processing Letters, 10.1016/j.ipl.2017.08.006, 129, 11-15, 2018.01.
17. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Koppl, and Florin Manea, Inferring strings from Lyndon factorization, Theory of Computing Systems, 10.1007/s00224-017-9794-5, 62, 1, 162-191, 2018.01.
18. Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara, Efficient dynamic dictionary matching with DAWGs and AC-automata, Theoretical Computer Science, 10.1016/j.tcs.2018.04.016, 2018.01, The dictionary matching is a task to find all occurrences of pattern strings in a set D (called a dictionary) on a text string T. The Aho–Corasick-automaton (AC-automaton) which is built on D is a fundamental data structure which enables us to solve the dictionary matching problem in O(dlog⁡σ) preprocessing time and O(nlog⁡σ+occ) matching time, where d is the total length of the patterns in the dictionary D, n is the length of the text, σ is the alphabet size, and occ is the total number of occurrences of all the patterns in the text. The dynamic dictionary matching is a variant where patterns may dynamically be inserted into and deleted from the dictionary D. This problem is called semi-dynamic dictionary matching if only insertions are allowed. In this paper, we propose two efficient algorithms that can solve both problems with some modifications. For a pattern of length m, our first algorithm supports insertions in O(mlog⁡σ+log⁡d/log⁡log⁡d) time and pattern matching in O(nlog⁡σ+occ) for the semi-dynamic setting. This algorithm also supports both insertions and deletions in O(σm+log⁡d/log⁡log⁡d) time and pattern matching in O(n(log⁡d/log⁡log⁡d+log⁡σ)+occ(log⁡d/log⁡log⁡d)) time for the dynamic dictionary matching problem by some modifications. This algorithm is based on the directed acyclic word graph (DAWG) of Blumer et al. (JACM 1987). Our second algorithm, which is based on the AC-automaton, supports insertions in O(mlog⁡σ+uf+uo) time for the semi-dynamic setting and supports both insertions and deletions in O(σm+uf+uo) time for the dynamic setting, where uf and uo respectively denote the numbers of states in which the failure function and the output function need to be updated. This algorithm performs pattern matching in O(nlog⁡σ+occ) time for both settings. Our algorithm achieves optimal update time for AC-automaton based methods over constant-size alphabets, since any algorithm which explicitly maintains the AC-automaton requires Ω(m+uf+uo) update time..
19. Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, On the size of the smallest alphabet for Lyndon trees, Theoretical Computer Science, 10.1016/j.tcs.2018.06.044, 2018.01, We consider the problem of reverse-engineering the Lyndon tree, i.e., given a full binary ordered tree T with n leaves as input, we are to compute a string w of length n of which Lyndon tree is isomorphic to the input tree T. Hereby we call such a string a solution string. Although the problem is easily solvable in linear time for binary alphabets and unbounded-size alphabets, it is not known how to efficiently find the smallest alphabet size for a solution string. In this paper, we show several new observations concerning this problem. Namely, we show that: 1) For any positive integer n, there exists a full binary ordered tree T with n leaves, s.t. the smallest alphabet size of a solution string for T is ⌊[Formula presented]⌋+1. 2) For any full binary ordered tree T with n leaves, there exists a solution string w over an alphabet of size at most ⌊[Formula presented]⌋+1. 3) For any full binary ordered tree T, there exists a solution string w over an alphabet of size at most h+1, where h is the height of T. 4) For any complete binary ordered tree T with 2k leaves, there exists a solution string w over an alphabet of size at most 4..
20. Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Almost linear time computation of maximal repetitions in run length encoded strings, 28th International Symposium on Algorithms and Computation, ISAAC 2017, 10.4230/LIPIcs.ISAAC.2017.33, 92, 2017.12, We consider the problem of computing all maximal repetitions contained in a string that is given in run-length encoding. Given a run-length encoding of a string, we show that the maximum number of maximal repetitions contained in the string is at most m+k-1, where m is the size of the run-length encoding, and k is the number of run-length factors whose exponent is at least 2. We also show an algorithm for computing all maximal repetitions in O(m α (m)) time and O(m) space, where α denotes the inverse Ackermann function..
21. Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov and Simon Puglisi, On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation, Proc. 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), 10.1007/978-3-319-67428-5_5, LNCS 10508, 51-67, 2017.09.
22. Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga and Hiroki Arimura, Linear-size CDAWG: new repetition-aware indexing and grammar compression, Proc. 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), 10.1007/978-3-319-67428-5_26, LNCS 10508, 304-316, 2017.09.
23. Tenma Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Order preserving pattern matching on trees and DAGs, Proc. 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), 10.1007/978-3-319-67428-5_23, LNCS 10508, 271-277, 2017.09.
24. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, and Kazuya Tsuruta, The "Runs" Theorem, SIAM Journal of Computing, 10.1137/15M1011032, 46, 5, 1501-1514, 2017.09.
25. Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, and Hiroki Arimura, Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 10.1587/transfun.E100.A.1785, E100-A, 9, 1785-1793, 2017.09.
26. Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, On Reverse Engineering the Lyndon Tree, Prague Stringology Conference 2017 (PSC 2017), 108-117, 2017.08.
27. Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda, Small-space LCE data structure with constant-time queries, Proc. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 10.4230/LIPIcs.dMFCS.2017.10, 10:1-10:15, 2017.08.
28. Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Koppl, and Florin Manea, Inferring strings from Lyndon factorization, Theory of Computing Systems, 10.1007/s00224-017-9794-5, 62, 1, 162-191, 2017.08.
29. Hideo Bannai, Shunsuke Inenaga, Dominik Köppl, Computing All Distinct Squares in Linear Time for Integer Alphabets, Proc. the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017.07.
30. Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster STR-IC-LCS computation via RLE, Proc. the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017.07.
31. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tight bounds on the maximum number of shortest unique substrings, Proc. the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017.07.
32. Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Shortest Unique Palindromic Substring Queries in Optimal Time, The 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), 2017.07.
33. Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Abelian string regularities based on RLE, The 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), 2017.07.
34. Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Longest Common Subsequence in at Least k Length Order-isomorphic Substrings, 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017), 10.1007/978-3-319-51963-0_28, LNCS 10139, 363-374, 2017.01, [URL].
35. Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara, Computing longest single-arm-gapped palindromes in a string, 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017), 10.1007/978-3-319-51963-0_29, LNCS 10139, 375-386, 2017.01, [URL].
36. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, Theoretical Computer Science, 10.1016/j.tcs.2016.03.005, 656(B), 215-224, 2016.11.
37. Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Generalized pattern matching and periodicity under substring consistent equivalence relations, Theoretical Computer Science, 10.1016/j.tcs.2016.02.017, 656(B), 215-224, 2016.11.
38. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Shunsuke Inenaga, Costas S. Iliopoulos, Simon J. Puglisi, Shiho Sugimoto, Closed Factorization, Discrete Applied Mathematics, 10.1016/j.dam.2016.04.009, 212, 23-29, 2016.10.
39. Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Finding gapped palindromes online, Proc. 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), 10.1007/978-3-319-44543-4_15, Lecture Notes in Computer Science 9843, 191-202, 2016.08.
40. 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), 10.1007/978-3-319-44543-4_17, LNCS 9843, 213-225, 2016.08.
41. 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), 10.4230/LIPIcs.MFCS.2016.72, 72:1-72:15, 2016.08.
42. 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), 10.4230/LIPIcs.MFCS.2016.69, 69:1-69:11, 2016.08.
43. 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), 10.4230/LIPIcs.MFCS.2016.38, 38:1-38:14, 2016.08.
44. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Dynamic index and LZ factorization in compressed space, Proc. Prague Stringology Conference 2016, 153-171, 2016.08.
45. 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), 135-145, 2016.08.
46. Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Efficient Computation of Substring Equivalence Classes with Suffix Arrays, Algorithmica, 10.1007/s00453-016-0178-z, 2016.08.
47. 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), 10.4230/LIPIcs.CPM.2016.27, 27:1-27:12, 2016.06.
48. 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), 10.4230/LIPIcs.CPM.2016.1, 2016.06.
49. 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), 10.4230/LIPIcs.CPM.2016.22, 22:1-22:13, 2016.06.
50. 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), 10.4230/LIPIcs.STACS.2016.39, 39:1-39:14, 2016.02.
51. 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, 302-313, 2016.01, [URL].
52. 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.
53. 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, 655-659, 2015.09.
54. Heikki Hyyro, Kazuyuki Narisawa, Shunsuke Inenaga, Dynamic Edit Distance Table under a General Weighted Cost Function, Journal of Discrete Algorithms, 34, 2-17, 2015.09.
55. 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), 10.1007/978-3-319-23826-5_10, Lecture Notes in Computer Science 9309, 95-102, 2015.09.
56. 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), 10.1007/978-3-319-23826-5_13, Lecture Notes in Computer Science 9309, 124-136, 2015.09.
57. Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Left-Right Maximal Generic Words, Proc. the Prague Stringology Conference 2015 (PSC 2015), 5-16, 2015.08.
58. Shunsuke Inenaga, A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications, Proc. the Prague Stringology Conference 2015 (PSC 2015), 1-4, 2015.08.
59. 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), 10.1007/978-3-319-21500-6_6, Lecture Notes in Computer Science 9168, 85-96, 2015.07.
60. 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), 10.1007/978-3-319-19929-0_30, Lecture Notes in Computer Science 9133, 355-366, 2015.06.
61. 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), 10.1007/978-3-319-19929-0_19, Lecture Notes in Computer Science 9133, 219-230, 2015.06.
62. Tomihiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Compressed automata for dictionary matching, Theoretical Computer Science, 578, 30-41, 2015.05.
63. 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), 10.1007/978-3-319-18173-8_29, Lecture Notes in Computer Science 9079, 390-402, 2015.05.
64. 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, 10.1016/j.ic.2014.09.009, 240, 74-89, 2015.02.
65. 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), 10.1137/1.9781611973730.38, 562-571, 2015.01.
66. 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.
67. 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.
68. 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), 10.1007/978-3-662-44465-8_48, Lecture Notes in Computer Science 8635, 565-576, 2014.08.
69. 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), 10.1007/978-3-319-07566-2_16, Lecture Notes in Computer Science 8486, 150-161, 2014.06.
70. 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), 10.4230/LIPIcs.STACS.2014.675, Leibniz International Proceedings in Informatics (LIPIcs) 25, 675-686, 2014.03.
71. Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Inferring Strings from Suffix Trees and Links on a Binary Alphabet, Discrete Applied Mathematics, dx.doi.org/10.1016/j.dam.2013.02.033, 163, 3, 316-325, 2014.01.
72. 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), 10.1007/978-3-319-04298-5_44, LNCS 8327, 503-513, 2014.01.
73. 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), 10.1007/978-3-319-02432-5_21, Lecture Notes in Computer Science 8214, 174-185, 2013.10.
74. 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), 10.1007/978-3-642-39274-0_28, Lecture Notes in Computer Science 7982, 319-330, 2013.10.
75. 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), 10.1007/978-3-642-38905-4_6, Lecture Notes in Computer Science 7922, 38-49, 2013.10.
76. 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), 10.1007/978-3-642-38905-4_16, Lecture Notes in Computer Science 7922, 153-164, 2013.10.
77. 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.
78. 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), 10.1007/978-3-642-40313-2_51, Lecture Notes in Computer Science 8087, 571-582, 2013.08.
79. Tomohiro I, Shunsuke Inenaga, Masayuki Takeda, Palindrome Pattern Matching, Theoretical Computer Science, dx.doi.org/10.1016/j.tcs.2012.01.047, 483, 162-170, 2013.04.
80. 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.
81. 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.
82. 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), dx.doi.org/10.1007/978-3-642-35843-2_25, Lecture Notes in Computer Science 7741, 280-291, 2013.01.
83. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Fast q-gram mining on SLP compressed strings, Journal of Discrete Algorithms, dx.doi.org/10.1016/j.jda.2012.07.006, 18, 89-99, 2013.01.
84. 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), dx.doi.org/10.1007/978-3-642-34109-0_10, Lecture Notes in Computer Science 7608, 86-98, 2012.10.
85. 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), dx.doi.org/10.1007/978-3-642-34109-0_38, Lecture Notes in Computer Science 7608, 360-371, 2012.10.
86. 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, dx.doi.org/10.1016/j.ipl.2012.06.017, 122, 9, 711-714, 2012.10.
87. 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), dx.doi.org/10.1007/978-3-642-31265-6_18, Lecture Notes in Computer Science 7354, 220-231, 2012.07.
88. Shunsuke Inenaga and Hideo Bannai, Finding Characteristic Substrings from Compressed Texts, International Journal of Foundations of Computer Science, dx.doi.org/10.1142/S0129054112400126, 23, 2, 261-280, 2012.02.
89. Shunsuke Inenaga, Hideo Bannai, Finding Characteristic Substrings from Compressed Texts, International Journal of Foundations of Computer Science, dx.doi.org/10.1142/S0129054112400126, 23, 2, 261-280, 2012.02.
90. 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), dx.doi.org/10.1007/978-3-642-27660-6_25, Lecture Notes in Computer Science 7147, 301-312, 2012.01.
91. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, Verifying and Enumerating Parameterized Border Arrays, Theoretical Computer Science, dx.doi.org/10.1016/j.tcs.2011.09.008, 412, 50, 6959-6981, 2011.11.
92. 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.
93. 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.
94. 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.
95. 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.
96. Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda, A New Family of String Classifiers Based on Local Relatedness, Proc. 9th International Conference on Discovery Science (DS 2006), Lecture Notes in Artificial Intelligence (LNAI 4265), LNAI 4265, 114-124, 2006.10.
97. 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.
98. 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.
99. 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.
100. 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.
101. Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, and Masayuki Takeda, Practical Algorithms for Pattern Based Linear Regression, 8th International Conference on Discovery Science (DS'05), 3735, 44-56, Lecture Notes in Artificial Intelligence (LNAI3735), pp. 44-56, Springer-Verlag, 2005.10.
102. Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda, Fully Incremental LCS Computation, 15th International Symposium on Fundamentals of Computation Theory (FCT'05), 3623, 563-574, Lecture Notes in Computer Science (LNCS3623), pp. 563-574, Springer-Verlag, 2005.08.
103. 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, 225-236, Lecture Notes in Computer Science (LNCS3340), pp. 225-236, Springer-Verlag, 2004.12.
104. 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, 32-46, Lecture Notes in Artificial Intelligence (LNAI3245), pp. 32-46, Springer-Verlag, 2004.10.
105. 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.
106. Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda, A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems, The Prague Stringology Conference '04 (PSC '04), 10.1142/S0129054105003728, 16, 6, 1155-1166, pp. 98-113, Czech Technical University, 2004.08.
107. 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, 137-152, Lecture Notes in Computer Science (LNCS2857), pp. 137-152, Springer-Verlag, 2003.10.
108. Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, and Setsuo Arikawa, Discovering Most Classificatory Patterns for Very Expressive Pattern Classes, The 6th International Conference on Discovery Science (DS 2003), 2843, 486-493, Lecture Notes in Artificial Intelligence (LNAI2843), pp. 486-493, Springer-Verlag, 2003.10.
109. 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, 208-217, Lecture Notes in Computer Science (LNCS2747), pp. 208-217, Springer-Verlag, 2003.08.
110. 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, 120-130, Lecture Notes in Computer Science (LNCS2759), pp. 121-130, 2003.07.
111. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano, A String Pattern Regression Algorithm and Its Application to Pattern Discovery in Long Introns, The 13th International Conference on Genome Informatics (GIW 2002), pp. 3-11, Universal Academy Press, 2002.12.
112. 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, 86-97, Lecture Notes in Computer Science (LNCS2534), pp. 86-97, 2002.11.
113. 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.
114. Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, and Setsuo Arikawa, A Note on Randomized Algorithm for String Matching with Mismatches, The Prague Stringology Conference '02 (PSC '02), pp. 9-17, Czech Technical University, 2002.09.
115. Shunsuke Inenaga, Bidirectional Construction of Suffix Trees, The Prague Stringology Conference '02 (PSC '02), pp. 75-87, Czech Technical University, 2002.09.
116. 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, 153-167, Lecture Notes in Computer Science (LNCS 2373), pp. 153-167, 2002.07.
117. 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), 96-110, pp. 96-110, IEEE Computer Society, 2001.11.
118. 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.
119. 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.
120. 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), 10.1016/dam.2004.04.012, 146, 2, 156-179, Lecture Notes in Computer Science (LNCS 2089), pp. 169-180, 2001.07.