Shunsuke Inenaga

2009
38	EE	Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Counting Parameterized Border Arrays for a Binary Alphabet. LATA 2009: 422-433
37	EE	Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto: Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8-10): 900-913 (2009)
2008
36	EE	Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda: String Kernels Based on Variable-Length-Don't-Care Patterns. Discovery Science 2008: 308-318
35	EE	Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto: Computing Longest Common Substring and All Palindromes from Compressed Strings. SOFSEM 2008: 364-375
34	EE	Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. 19(1): 147-162 (2008)
2007
33	EE	Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351
32	EE	Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC 2007: 123-132
2006
31	EE	Shunsuke Inenaga, Masayuki Takeda: On-Line Linear-Time Construction of Word Suffix Trees. CPM 2006: 60-71
30	EE	Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: A New Family of String Classifiers Based on Local Relatedness. Discovery Science 2006: 114-124
29	EE	Shunsuke Inenaga, Masayuki Takeda: Sparse Directed Acyclic Word Graphs. SPIRE 2006: 61-73
28	EE	Shunsuke Inenaga, Masayuki Takeda: Sparse compact directed acyclic word graphs. Stringology 2006: 197-211
27	EE	Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on suffix tree graphs. Stringology 2006: 212-225
2005
26	EE	Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda: Practical Algorithms for Pattern Based Linear Regression. Discovery Science 2005: 44-56
25	EE	Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Fully Incremental LCS Computation. FCT 2005: 563-574
24	EE	Stanislav Angelov, Shunsuke Inenaga: Composite Pattern Discovery for PCR Application. SPIRE 2005: 167-178
23	EE	Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics 146(2): 156-179 (2005)
22	EE	Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: A fully compressed pattern matching algorithm for simple collage systems. Int. J. Found. Comput. Sci. 16(6): 1155-1166 (2005)
2004
21	EE	Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. Developments in Language Theory 2004: 225-236
20	EE	Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. Discovery Science 2004: 32-46
19	EE	Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113
18	EE	Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen: Finding Missing Patterns. WABI 2004: 463-474
17	EE	Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano: Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. J. Bioinformatics and Computational Biology 2(2): 273-288 (2004)
16	EE	Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact directed acyclic word graphs for a sliding window. J. Discrete Algorithms 2(1): 33-51 (2004)
15	EE	Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004)
2003
14	EE	Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary Directed Acyclic Word Graphs. CIAA 2003: 120-130
13	EE	Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa: Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493
12	EE	Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217
11	EE	Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara: Linear-Time Off-Line Text Compression by Longest-First Substitution. SPIRE 2003: 137-152
10		Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa: A Note on Randomized Algorithm for String Matching with Mismatches. Nord. J. Comput. 10(1): 2-12 (2003)
9		Shunsuke Inenaga: Bidirectional Construction of Suffix Trees. Nord. J. Comput. 10(1): 52- (2003)
2002
8	EE	Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa: The Minimum DAWG for All Suffixes of a String and Its Applications. CPM 2002: 153-167
7	EE	Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97
6	EE	Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa: Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS 2002: 341-352
5	EE	Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga: Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317
4	EE	Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324
2001
3	EE	Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi: On-Line Construction of Compact Directed Acyclic Word Graphs. CPM 2001: 169-180
2	EE	Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440
1		Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110

Coauthor Index

1	Stanislav Angelov	[24]
2	Setsuo Arikawa	[1] [2] [3] [4] [5] [6] [7] [8] [10] [13] [16] [23]
3	Kensuke Baba	[10]
4	Hideo Bannai	[6] [7] [12] [13] [17] [20] [26] [27] [30] [32] [33] [34] [36] [38]
5	Takashi Funamoto	[11]
6	Kazuo Hashimoto	[35] [37]
7	Kohei Hatano	[26] [36]
8	Yasuto Higa	[27] [30] [34]
9	Masahiro Hirao	[2] [5]
10	Hiromasa Hoshino	[1] [3] [5] [8] [23]
11	Heikki Hyyrö	[20]
12	Tomohiro I	[38]
13	Yusuke Ishida	[25]
14	Akira Ishino	[35] [37]
15	Teemu Kivioja	[18]
16	Veli Mäkinen	[18]
17	Wataru Matsubara	[35] [37]
18	Giancarlo Mauri	[3] [23]
19	Satoru Miyamoto	[14] [15]
20	Satoru Miyano	[17] [20]
21	Kenta Nakai	[20]
22	Ryosuke Nakamura	[32]
23	Tomoyuki Nakamura	[35] [37]
24	Kazuyuki Narisawa	[33] [36]
25	Giulio Pavesi	[3] [23]
26	Ayumi Shinohara	[1] [2] [3] [4] [5] [6] [7] [8] [10] [11] [12] [13] [14] [15] [16] [17] [19] [20] [21] [22] [23] [25] [35] [37]
27	Masayuki Takeda	[1] [2] [3] [4] [5] [6] [7] [8] [10] [11] [12] [13] [14] [15] [16] [17] [19] [20] [21] [22] [23] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [36] [38]

Colors in the list of coauthors