フォロー
Ayumi Shinohara
Ayumi Shinohara
Professor of GSIS, Tohoku University
確認したメール アドレス: ecei.tohoku.ac.jp - ホームページ
タイトル
引用先
引用先
Byte pair encoding: A text compression scheme that accelerates pattern matching
Y Shibata, T Kida, S Fukamachi, M Takeda, A Shinohara, T Shinohara, ...
Technical Report DOI-TR-161, Department of Informatics, Kyushu University, 1999
1991999
Teachability in computational learning
A Shinohara, S Miyano
New Generation Computing 8, 337-347, 1991
1791991
Knowledge acquisition from amino acid sequences by machine learning system BONSAI
S Shimozono, A Shinohara, T Shinohara, S Miyano, S Kuhara, S Arikawa
Research Institute of Fundamental Information Science, Kyushu University, 1992
1501992
A machine discovery from amino acid sequences by decision trees over regular patterns
S Arikawa, S Miyano, A Shinohara, S Kuhara, Y Mukouchi, T Shinohara
New Generation Computing 11, 361-375, 1993
1371993
An improved pattern matching algorithm for strings in terms of straight-line programs
M Miyazaki, A Shinohara, M Takeda
Combinatorial Pattern Matching: 8th Annual Symposium, CPM 97 Aarhus, Denmark …, 1997
1221997
Collage system: a unifying framework for compressed pattern matching
T Kida, T Matsumoto, Y Shibata, M Takeda, A Shinohara, S Arikawa
Theoretical Computer Science 298 (1), 253-272, 2003
1152003
An efficient pattern-matching algorithm for strings with short descriptions
M Karpinski, W Rytter, A Shinohara
Nord. J. Comput. 4 (2), 172-186, 1997
1101997
Speeding up pattern matching by text compression
Y Shibata, T Kida, S Fukamachi, M Takeda, A Shinohara, T Shinohara, ...
Algorithms and Complexity: 4th Italian Conference, CIAC 2000 Rome, Italy …, 2000
1022000
Multiple pattern matching in LZW compressed text
T Kida, M Takeda, A Shinohara, M Miyazaki, S Arikawa
Proceedings DCC'98 Data Compression Conference (Cat. No. 98TB100225), 103-112, 1998
1001998
A boyer—moore type algorithm for compressed pattern matching
Y Shibata, T Matsumoto, M Takeda, A Shinohara, S Arikawa
Combinatorial Pattern Matching: 11th Annual Symposium, CPM 2000 Montreal …, 2000
852000
Shift-And approach to pattern matching in LZW compressed text
T Kida, M Takeda, A Shinohara, S Arikawa
Combinatorial Pattern Matching: 10th Annual Symposium, CPM 99 Warwick …, 1999
801999
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
W Matsubara, S Inenaga, A Ishino, A Shinohara, T Nakamura, ...
Theoretical Computer Science 410 (8-10), 900-913, 2009
732009
Pattern-matching for strings with short descriptions
M Karpinski, W Rytter, A Shinohara
Combinatorial Pattern Matching: 6th Annual Symposium, CPM 95 Espoo, Finland …, 1995
681995
Which classes of elementary formal systems are polynomial-time learnable
S Miyano, A Shinohara, T Shinohara
Proc. 2nd Int. Workshop on Algorithmic Learning Theory, 139-150, 1992
641992
Inferring strings from graphs and arrays
H Bannai, S Inenaga, A Shinohara, M Takeda
Mathematical Foundations of Computer Science 2003: 28th International …, 2003
622003
On-line construction of compact directed acyclic word graphs
S Inenaga, H Hoshino, A Shinohara, M Takeda, S Arikawa, G Mauri, ...
Discrete Applied Mathematics 146 (2), 156-179, 2005
612005
A unifying framework for compressed pattern matching
T Kida, Y Shibata, M Takeda, A Shinohara, S Arikawa
6th International Symposium on String Processing and Information Retrieval …, 1999
611999
A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains
S Arikawa, S Kuhara, S Miyano, A Shinohara, T Shinohara
Research Institute of Fundamental Information Science, Kyushu University, 1991
591991
On-Line Construction of Compact Directed Acyclic Word Graphs*
GM Landau, S Inenaga, H Hoshino, A Shinohara, M Takeda, S Arikawa, ...
Combinatorial Pattern Matching: 12th Annual Symposium, CPM 2001 Jerusalem …, 2001
582001
Faster approximate string matching over compressed text
G Navarro, T Kida, M Takeda, A Shinohara, S Arikawa
Proceedings DCC 2001. Data Compression Conference, 459-468, 2001
552001
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20