2009 |
83 | EE | Wataru Matsubara,
Kazuhiko Kusano,
Hideo Bannai,
Ayumi Shinohara:
A Series of Run-Rich Strings.
LATA 2009: 578-587 |
82 | 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 |
81 | 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 |
80 | EE | 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 | EE | 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 | EE | 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 | EE | Yusuke Ishida,
Shunsuke Inenaga,
Ayumi Shinohara,
Masayuki Takeda:
Fully Incremental LCS Computation.
FCT 2005: 563-574 |
74 | EE | Heikki Hyyrö,
Yoan J. Pinzon,
Ayumi Shinohara:
Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.
SOFSEM 2005: 380-384 |
73 | EE | Heikki Hyyrö,
Yoan J. Pinzon,
Ayumi Shinohara:
New Bit-Parallel Indel-Distance Algorithm.
WEA 2005: 380-390 |
72 | 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) |
71 | 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) |
70 | EE | Zdenek Tronícek,
Ayumi Shinohara:
The size of subsequence automaton.
Theor. Comput. Sci. 341(1-3): 379-384 (2005) |
2004 |
69 | EE | Heikki Hyyrö,
Jun Takaba,
Ayumi Shinohara,
Masayuki Takeda:
On Bit-Parallel Processing of Multi-byte Text.
AIRS 2004: 289-300 |
68 | EE | Ayumi Shinohara:
String Pattern Discovery.
ALT 2004: 1-13 |
67 | 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 |
66 | 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 |
65 | EE | Shunsuke Inenaga,
Ayumi Shinohara,
Masayuki Takeda:
A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems.
Stringology 2004: 98-113 |
64 | EE | Hideo Bannai,
Heikki Hyyrö,
Ayumi Shinohara,
Masayuki Takeda,
Kenta Nakai,
Satoru Miyano:
Finding Optimal Pairs of Patterns.
WABI 2004: 450-462 |
63 | EE | 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 | 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) |
61 | 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) |
60 | EE | Satoru Miyamoto,
Shunsuke Inenaga,
Masayuki Takeda,
Ayumi Shinohara:
Ternary directed acyclic word graphs.
Theor. Comput. Sci. 328(1-2): 97-111 (2004) |
2003 |
59 | EE | Satoru Miyamoto,
Shunsuke Inenaga,
Masayuki Takeda,
Ayumi Shinohara:
Ternary Directed Acyclic Word Graphs.
CIAA 2003: 120-130 |
58 | 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 |
57 | EE | 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 | EE | Hideo Bannai,
Shunsuke Inenaga,
Ayumi Shinohara,
Masayuki Takeda:
Inferring Strings from Graphs and Arrays.
MFCS 2003: 208-217 |
55 | EE | Shunsuke Inenaga,
Takashi Funamoto,
Masayuki Takeda,
Ayumi Shinohara:
Linear-Time Off-Line Text Compression by Longest-First Substitution.
SPIRE 2003: 137-152 |
54 | EE | 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 | EE | 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 | 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 |
47 | EE | Shunsuke Inenaga,
Hideo Bannai,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa:
Discovering Best Variable-Length-Don't-Care Patterns.
Discovery Science 2002: 86-97 |
46 | 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 |
45 | EE | Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa,
Masahiro Hirao,
Hiromasa Hoshino,
Shunsuke Inenaga:
Finding Best Patterns Practically.
Progress in Discovery Science 2002: 307-317 |
44 | EE | 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 | EE | 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 | 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 |
40 | EE | Takuya Kida,
Tetsuya Matsumoto,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Multiple Pattern Matching Algorithms on Collage System.
CPM 2001: 193-206 |
39 | EE | Gonzalo Navarro,
Takuya Kida,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Faster Approximate String Matching over Compressed Text.
Data Compression Conference 2001: 459-468 |
38 | EE | Shuichi Mitarai,
Masahiro Hirao,
Tetsuya Matsumoto,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa:
Compressed Pattern Matching for SEQUITUR.
Data Compression Conference 2001: 469- |
37 | EE | 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 | 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 |
35 | EE | 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 | EE | 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 | EE | Yusuke Shibata,
Tetsuya Matsumoto,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
CPM 2000: 181-194 |
30 | EE | 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 | EE | Masahiro Hirao,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa:
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.
SPIRE 2000: 132-138 |
28 | EE | Hiromasa Hoshino,
Ayumi Shinohara,
Masayuki Takeda,
Setsuo Arikawa:
Online Construction of Subsequence Automata for Multiple Texts.
SPIRE 2000: 146-152 |
27 | EE | 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 | EE | Takuya Kida,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Shift-And Approach to Pattern Matching in LZW Compressed Text.
CPM 1999: 1-13 |
24 | EE | Yusuke Shibata,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
Pattern Matching in Text Compressed by Using Antidictionaries.
CPM 1999: 37-49 |
23 | EE | 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 | EE | Takuya Kida,
Yusuke Shibata,
Masayuki Takeda,
Ayumi Shinohara,
Setsuo Arikawa:
A Unifying Framework for Compressed Pattern Matching.
SPIRE/CRIWG 1999: 89-96 |
1998 |
21 | EE | Takuya Kida,
Masayuki Takeda,
Ayumi Shinohara,
Masamichi Miyazaki,
Setsuo Arikawa:
Multiple Pattern Matching in LZW Compressed Text.
Data Compression Conference 1998: 103-112 |
20 | EE | Yosuke Hayashi,
Satoshi Matsumoto,
Ayumi Shinohara,
Masayuki Takeda:
Uniform Characterizations of Polynomial-Query Learnabilities.
Discovery Science 1998: 84-92 |
19 | EE | 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 | EE | Marek Karpinski,
Wojciech Rytter,
Ayumi Shinohara:
Pattern-Matching for Strings with Short Descriptions
Electronic Colloquium on Computational Complexity (ECCC) 2(22): (1995) |
10 | EE | 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 |