Ayumi Shinohara

	2009
86		Tatsuya Kasai, Hayato Kobayashi, Ayumi Shinohara: Improvement of the performance using received message on learning of communication codes. AAMAS (2) 2009: 1229-1230
85		Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara: A Series of Run-Rich Strings. LATA 2009: 578-587
84		Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara: Average Value of Sum of Exponents of Runs in a String. Int. J. Found. Comput. Sci. 20(6): 1135-1146 (2009)
83		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
82		Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Akira Ishino, Ayumi Shinohara: Development of an Augmented Environment and Autonomous Learning for Quadruped Robots. RoboCup 2008: 109-120
81		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
80		Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Hideo Bannai, Ayumi Shinohara: New Lower Bounds for the Maximum Number of Runs in a String CoRR abs/0804.1214: (2008)
	2007
79		Hayato Kobayashi, Kohei Hatano, Akira Ishino, Ayumi Shinohara: Reducing Trials by Thinning-Out in Skill Discovery. Discovery Science 2007: 127-138
	2006
78		Hayato Kobayashi, Akira Ishino, Ayumi Shinohara: A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language. IAS 2006: 660-667
77		Jun Inoue, Akira Ishino, Ayumi Shinohara: Ball tracking with velocity based on Monte-Carlo localization. IAS 2006: 686-693
76		Hayato Kobayashi, Tsugutoyo Osaki, Eric Williams, Akira Ishino, Ayumi Shinohara: Autonomous Learning of Ball Trapping in the Four-Legged Robot League. RoboCup 2006: 86-97
	2005
75		Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Fully Incremental LCS Computation. FCT 2005: 563-574
74		Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara: Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. SOFSEM 2005: 380-384
73		Heikki Hyyrö, Yoan J. Pinzon, Ayumi Shinohara: New Bit-Parallel Indel-Distance Algorithm. WEA 2005: 380-390
72		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)
71		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)
70		Zdenek Tronícek, Ayumi Shinohara: The size of subsequence automaton. Theor. Comput. Sci. 341(1-3): 379-384 (2005)
	2004
69		Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda: On Bit-Parallel Processing of Multi-byte Text. AIRS 2004: 289-300
68		Ayumi Shinohara: String Pattern Discovery. ALT 2004: 1-13
67		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
66		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
65		Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113
64		Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Patterns. WABI 2004: 450-462
63		Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. IEEE/ACM Trans. Comput. Biology Bioinform. 1(4): 159-170 (2004)
62		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)
61		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)
60		Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004)
	2003
59		Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary Directed Acyclic Word Graphs. CIAA 2003: 120-130
58		Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa: Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493
57		Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda: On the Length of the Minimum Solution of Word Equations in One Variable. MFCS 2003: 189-197
56		Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217
55		Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara: Linear-Time Off-Line Text Compression by Longest-First Substitution. SPIRE 2003: 137-152
54		Zdenek Tronícek, Ayumi Shinohara: The Size of Subsequence Automaton. SPIRE 2003: 304-310
53		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)
52		Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 1(298): 253-272 (2003)
51		Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda: Uniform characterizations of polynomial-query learnabilities. Theor. Comput. Sci. 292(2): 377-385 (2003)
50		Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A practical algorithm to find the best subsequence patterns. Theor. Comput. Sci. 292(2): 465-479 (2003)
	2002
49		Setsuo Arikawa, Ayumi Shinohara: Progress in Discovery Science, Final Report of the Japanese Discovery Science Project Springer 2002
48		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
47		Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97
46		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
45		Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga: Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317
44		Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa: Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. SPIRE 2002: 170-186
43		Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324
	2001
42		Klaus P. Jantke, Ayumi Shinohara: Discovery Science, 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001, Proceedings Springer 2001
41		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
40		Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Multiple Pattern Matching Algorithms on Collage System. CPM 2001: 193-206
39		Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Faster Approximate String Matching over Compressed Text. Data Compression Conference 2001: 459-468
38		Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compressed Pattern Matching for SEQUITUR. Data Compression Conference 2001: 469-
37		Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, Ichiro Nanri: Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems. Discovery Science 2001: 416-428
36		Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440
35		Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara: Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. ISAAC 2001: 719-730
34		T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo: Musical Sequence Comparison for Melodic and Rhythmic Similarities. SPIRE 2001: 111-122
33		Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110
	2000
32		Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa: Speeding Up Pattern Matching by Text Compression. CIAC 2000: 306-315
31		Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Boyer-Moore Type Algorithm for Compressed Pattern Matching. CPM 2000: 181-194
30		Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Subsequence Patterns. Discovery Science 2000: 141-154
29		Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. SPIRE 2000: 132-138
28		Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Online Construction of Subsequence Automata for Multiple Texts. SPIRE 2000: 146-152
27		Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Bit-Parallel Approach to Approximate String Matching in Compressed Texts. SPIRE 2000: 221-228
26		Satoru Miyano, Ayumi Shinohara, Takeshi Shinohara: Polynomial-time Learning of Elementary Formal Systems. New Generation Comput. 18(3): 217-242 (2000)
	1999
25		Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Shift-And Approach to Pattern Matching in LZW Compressed Text. CPM 1999: 1-13
24		Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Pattern Matching in Text Compressed by Using Antidictionaries. CPM 1999: 37-49
23		Toru Takae, Minoru Chikamune, Hiroki Arimura, Ayumi Shinohara, Hitoshi Inoue, Shun-ichi Takeya, Keiko Uezono, Terukazu Kawasaki: Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. Discovery Science 1999: 359-361
22		Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Unifying Framework for Compressed Pattern Matching. SPIRE/CRIWG 1999: 89-96
	1998
21		Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa: Multiple Pattern Matching in LZW Compressed Text. Data Compression Conference 1998: 103-112
20		Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda: Uniform Characterizations of Polynomial-Query Learnabilities. Discovery Science 1998: 84-92
19		Shinichi Shimozono, Kouichi Hirata, Ayumi Shinohara: On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram. Inf. Process. Lett. 66(4): 165-170 (1998)
	1997
18		Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda: An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. CPM 1997: 1-11
17		Satoshi Matsumoto, Ayumi Shinohara: Learning Pattern Languages Using Queries. EuroCOLT 1997: 185-197
16		Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. Nord. J. Comput. 4(2): 172-186 (1997)
	1996
15		Kouichi Hirata, Shinichi Shimozono, Ayumi Shinohara: On the Hardness of Approximating the Minimum Consistent OBDD Problem. SWAT 1996: 112-123
	1995
14		Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions. CPM 1995: 205-214
13		Takayoshi Shoudai, Michael Lappe, Satoru Miyano, Ayumi Shinohara, Takeo Okazaki, Setsuo Arikawa, Tomoyuki Uchida, Shinichi Shimozono, Takeshi Shinohara, Satoru Kuhara: BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. ISMB 1995: 359-358
12		Setsuo Arikawa, Masako Sato, Ayumi Shinohara, Takeshi Shinohara: Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. Machine Intelligence 15 1995: 227-247
11		Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions Electronic Colloquium on Computational Complexity (ECCC) 2(22): (1995)
10		Ayumi Shinohara: Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions. Theor. Comput. Sci. 137(1): 129-144 (1995)
	1994
9		Satoshi Matsumoto, Ayumi Shinohara: Refutably Probably Approximately Correct Learning. AII/ALT 1994: 469-483
8		Ayumi Shinohara: Complexity of Computing Generalized VC-Dimensions. ECML 1994: 415-418
7		Satoru Miyano, Ayumi Shinohara: Machine Learning and Discovery for Bloinformatics: Introduction. HICSS (5) 1994: 111-112
	1993
6		Ayumi Shinohara: Complexity of Computing Vapnik-Chervonenkis Dimension. ALT 1993: 279-287
5		Setsuo Arikawa, Satoru Miyano, Ayumi Shinohara, Satoru Kuhara, Yasuhito Mukouchi, Takeshi Shinohara: A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. New Generation Comput. 11(3): 361-375 (1993)
	1992
4		Setsuo Arikawa, Satoru Kuhara, Satoru Miyano, Yasuhito Mukouchi, Ayumi Shinohara, Takeshi Shinohara: A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. FGCS 1992: 618-625
	1991
3		Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara: More About Learning Elementary Formal Systems. Nonmonotonic and Inductive Logic 1991: 107-117
2		Ayumi Shinohara: Teachability in Computational Learning. New Generation Comput. 8(4): 337- (1991)
	1990
1		Ayumi Shinohara, Satoru Miyano: Teachability in Computational Learning. ALT 1990: 247-255

Coauthor Index

1	Setsuo Arikawa	[3] [4] [5] [12] [13] [21] [22] [24] [25] [27] [28] [29] [30] [31] [32] [33] [36] [38] [39] [40] [41] [43] [44] [45] [46] [47] [48] [49] [50] [52] [53] [58] [61] [72]
2	Hiroki Arimura	[23]
3	Kensuke Baba	[53] [57]
4	Hideo Bannai	[46] [47] [56] [58] [62] [63] [64] [66] [80] [85]
5	Minoru Chikamune	[23]
6	Shuichi Fukamachi	[32] [44]
7	Tomoko Fukuda	[37]
8	Takashi Funamoto	[55]
9	Kazuo Hashimoto	[81] [83]
10	Kohei Hatano	[79]
11	Yosuke Hayashi	[20] [51]
12	Masahiro Hirao	[29] [30] [34] [36] [38] [45] [50]
13	Kouichi Hirata	[15] [19]
14	Hideaki Hori	[35]
15	Hiromasa Hoshino	[28] [30] [33] [41] [45] [48] [50] [72]
16	Heikki Hyyrö	[63] [64] [66] [69] [73] [74]
17	Shunsuke Inenaga	[33] [36] [41] [43] [45] [46] [47] [48] [53] [55] [56] [58] [59] [60] [61] [62] [65] [66] [67] [71] [72] [75] [81] [83]
18	Hitoshi Inoue	[23]
19	Jun Inoue	[77]
20	Yusuke Ishida	[75]
21	Akira Ishino	[34] [76] [77] [78] [79] [80] [81] [82] [83] [84]
22	Klaus P. Jantke	[42]
23	T. Kadota	[34]
24	Marek Karpinski	[11] [14] [16]
25	Tatsuya Kasai	[86]
26	Terukazu Kawasaki	[23]
27	Takuya Kida	[21] [22] [25] [27] [32] [39] [40] [44] [52]
28	Hayato Kobayashi	[76] [78] [79] [82] [86]
29	Satoru Kuhara	[4] [5] [13]
30	Kazuhiko Kusano	[80] [84] [85]
31	Michael Lappe	[13]
32	Wataru Matsubara	[80] [81] [83] [84] [85]
33	Satoshi Matsumoto	[9] [17] [20] [51]
34	Tetsuya Matsumoto	[27] [31] [38] [40] [52]
35	Fumihiro Matsuo	[34]
36	Giancarlo Mauri	[41] [72]
37	Shuichi Mitarai	[38]
38	Satoru Miyamoto	[44] [59] [60]
39	Satoru Miyano	[1] [3] [4] [5] [7] [13] [26] [62] [63] [64] [66]
40	Masamichi Miyazaki	[18] [21]
41	Yasuhito Mukouchi	[4] [5]
42	Kenta Nakai	[63] [64] [66]
43	Tomoyuki Nakamura	[81] [83]
44	Ichiro Nanri	[37]
45	Gonzalo Navarro	[39]
46	Takeo Okazaki	[13]
47	Tetsuro Okuyama	[82]
48	Tsugutoyo Osaki	[76] [82]
49	Giulio Pavesi	[41] [72]
50	Yoan J. Pinzon (Yoan José Pinzón Ardila)	[73] [74]
51	Wojciech Rytter	[11] [14] [16]
52	Masako Sato	[12]
53	Yusuke Shibata	[22] [24] [31] [32] [52]
54	Shinichi Shimozono	[13] [15] [19] [35]
55	Takeshi Shinohara	[3] [4] [5] [12] [13] [26] [32] [44]
56	Takayoshi Shoudai	[13]
57	Jun Takaba	[69]
58	Toru Takae	[23]
59	Masayuki Takeda	[18] [20] [21] [22] [24] [25] [27] [28] [29] [30] [31] [32] [33] [34] [35] [36] [37] [38] [39] [40] [41] [43] [44] [45] [46] [47] [48] [50] [51] [52] [53] [55] [56] [57] [58] [59] [60] [61] [62] [63] [64] [65] [66] [67] [69] [71] [72] [75]
60	Shun-ichi Takeya	[23]
61	Zdenek Tronícek	[54] [70]
62	Satoshi Tsuruta	[57]
63	Tomoyuki Uchida	[13]
64	Keiko Uezono	[23]
65	Eric Williams	[76]
66	Koichiro Yamamoto	[37]

Colors in the list of coauthors