Shunsuke Inenaga

	2012
64		Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM 2012: 301-312
63		Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Speeding-up $q$-gram mining on grammar-based compressed texts CoRR abs/1202.3311: (2012)
62		Jun-ichi Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding CoRR abs/1204.5524: (2012)
61		Shunsuke Inenaga, Hideo Bannai: Finding Characteristic Substrings from Compressed Texts. Int. J. Found. Comput. Sci. 23(2): 261-280 (2012)
	2011
60		Adrian Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide: Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings Springer 2011
59		Tomohiro I, Shunsuke Inenaga, Masayuki Takeda: Palindrome Pattern Matching. CPM 2011: 232-245
58		Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. CPM 2011: 309-322
57		Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Fast q-gram Mining on SLP Compressed Strings. SPIRE 2011: 278-289
56		Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Fast $q$-gram Mining on SLP Compressed Strings CoRR abs/1103.3114: (2011)
55		Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda: Restructuring Compressed Texts without Explicit Decompression CoRR abs/1107.2729: (2011)
54		Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-gram Frequencies on Collage Systems CoRR abs/1107.3019: (2011)
53		Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts CoRR abs/1107.3022: (2011)
52		Stanislav Angelov, Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen: Missing pattern discovery. J. Discrete Algorithms 9(2): 153-165 (2011)
51		Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura: Password Based Anonymous Authentication with Private Information Retrieval. JDIM 9(2): 72-78 (2011)
50		Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50): 6959-6981 (2011)
	2010
49		Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Verifying a Parameterized Border Array in O(n1.5) Time. CPM 2010: 238-250
48		Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura: An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services. ICCSA (4) 2010: 236-251
47		Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga: Dynamic Edit Distance Table under a General Weighted Cost Function. SOFSEM 2010: 515-527
46		Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Counting and Verifying Maximal Palindromes. SPIRE 2010: 135-146
45		Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara: An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. Chicago J. Theor. Comput. Sci. 2010: (2010)
	2009
44		Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Lightweight Parameterized Suffix Array Construction. IWOCA 2009: 312-323
43		Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Counting Parameterized Border Arrays for a Binary Alphabet. LATA 2009: 422-433
42		Shunsuke Inenaga, Kenichirou Oyama, Hiroto Yasuura: Towards Modeling Stored-value Electronic Money Systems. NaBIC 2009: 902-907
41		Tomomi Yamasaki, Shunsuke Inenaga, Daisuke Ikeda, Hiroto Yasuura: Modeling Costs of Access Control with Various Key Management Systems. PDPTA 2009: 676-682
40		Shunsuke Inenaga, Hideo Bannai: Finding Characteristic Substrings from Compressed Texts. Stringology 2009: 40-54
39		Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara: Linear-Time Text Compression by Longest-First Substitution. Algorithms 2(4): 1429-1448 (2009)
38		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
37		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
36		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
35		Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Parameterized Suffix Arrays for Binary Strings. Stringology 2008: 84-94
34		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		Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351
32		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		Shunsuke Inenaga, Masayuki Takeda: On-Line Linear-Time Construction of Word Suffix Trees. CPM 2006: 60-71
30		Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: A New Family of String Classifiers Based on Local Relatedness. Discovery Science 2006: 114-124
29		Shunsuke Inenaga, Masayuki Takeda: Sparse Directed Acyclic Word Graphs. SPIRE 2006: 61-73
28		Shunsuke Inenaga, Masayuki Takeda: Sparse compact directed acyclic word graphs. Stringology 2006: 197-211
27		Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on suffix tree graphs. Stringology 2006: 212-225
	2005
26		Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda: Practical Algorithms for Pattern Based Linear Regression. Discovery Science 2005: 44-56
25		Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Fully Incremental LCS Computation. FCT 2005: 563-574
24		Stanislav Angelov, Shunsuke Inenaga: Composite Pattern Discovery for PCR Application. SPIRE 2005: 167-178
23		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		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		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		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		Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113
18		Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen: Finding Missing Patterns. WABI 2004: 463-474
17		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		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		Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004)
	2003
14		Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary Directed Acyclic Word Graphs. CIAA 2003: 120-130
13		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		Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217
11		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		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		Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97
6		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		Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga: Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317
4		Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324
	2001
3		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		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] [52]
2	Setsuo Arikawa	[1] [2] [3] [4] [5] [6] [7] [8] [10] [13] [16] [23]
3	Kensuke Baba	[10] [48] [51]
4	Hideo Bannai	[6] [7] [12] [13] [17] [20] [26] [27] [30] [32] [33] [34] [35] [37] [39] [40] [43] [44] [46] [49] [50] [53] [54] [55] [56] [57] [58] [61] [62] [63] [64]
5	Adrian Horia Dediu	[60]
6	Satoshi Deguchi	[35] [44]
7	Takashi Funamoto	[11] [39]
8	Keisuke Goto	[53] [54] [55] [56] [57] [63] [64]
9	Kazuo Hashimoto	[36] [38]
10	Kohei Hatano	[26] [37]
11	Yasuto Higa	[27] [30] [34]
12	Fumihito Higashijima	[35]
13	Masahiro Hirao	[2] [5]
14	Hiromasa Hoshino	[1] [3] [5] [8] [23]
15	Heikki Hyyrö	[20] [47]
16	Tomohiro I	[43] [44] [46] [49] [50] [59]
17	Daisuke Ikeda	[41] [48] [51]
18	Yusuke Ishida	[25]
19	Akira Ishino	[36] [38]
20	Teemu Kivioja	[18] [52]
21	Veli Mäkinen	[18] [52]
22	Carlos Martín-Vide	[60]
23	Shirou Maruyama	[55]
24	Wataru Matsubara	[36] [38] [45]
25	Giancarlo Mauri	[3] [23]
26	Satoru Miyamoto	[14] [15]
27	Satoru Miyano	[17] [20]
28	Kenta Nakai	[20]
29	Ryosuke Nakamura	[32] [39]
30	Tomoyuki Nakamura	[36] [38]
31	Toru Nakamura	[48] [51]
32	Kazuyuki Narisawa	[33] [37] [47]
33	Kenichirou Oyama	[42]
34	Giulio Pavesi	[3] [23]
35	Hiroshi Sakamoto	[55]
36	Ayumi Shinohara	[1] [2] [3] [4] [5] [6] [7] [8] [10] [11] [12] [13] [14] [15] [16] [17] [19] [20] [21] [22] [23] [25] [36] [38] [39] [45]
37	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] [35] [37] [39] [43] [44] [46] [49] [50] [53] [54] [55] [56] [57] [58] [59] [62] [63] [64]
38	Jun-ichi Yamamoto	[62]
39	Takanori Yamamoto	[58]
40	Tomomi Yamasaki	[41]
41	Hiroto Yasuura	[41] [42] [48] [51]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page