2009 | ||
---|---|---|
85 | Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Lightweight Parameterized Suffix Array Construction. IWOCA 2009: 312-323 | |
84 | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Counting Parameterized Border Arrays for a Binary Alphabet. LATA 2009: 422-433 | |
83 | Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. Int. J. Found. Comput. Sci. 20(4): 717-733 (2009) | |
2008 | ||
82 | Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masayuki Takeda: Smooth Boosting for Margin-Based Ranking. ALT 2008: 227-239 | |
81 | Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda: A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. CIAA 2008: 201-211 | |
80 | Kosuke Ishibashi, Kohei Hatano, Masayuki Takeda: Online Learning of Maximum p-Norm Margin Classifiers with Bias. COLT 2008: 69-80 | |
79 | 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 | |
78 | Shirou Maruyama, Yohei Tanaka, Hiroshi Sakamoto, Masayuki Takeda: Context-Sensitive Grammar Transform: Compression and Pattern Matching. SPIRE 2008: 27-38 | |
77 | Masayuki Takeda: Compressed Pattern Matching. Encyclopedia of Algorithms 2008 | |
76 | Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. 19(1): 147-162 (2008) | |
2007 | ||
75 | Vincent Corruble, Masayuki Takeda, Einoshin Suzuki: Discovery Science, 10th International Conference, DS 2007, Sendai, Japan, October 1-4, 2007, Proceedings Springer 2007 | |
74 | Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 | |
73 | Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC 2007: 123-132 | |
72 | Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda: Unsupervised Spam Detection Based on String Alienness Measures. Discovery Science 2007: 161-172 | |
2006 | ||
71 | Tadanobu Furukawa, Tomofumi Matsuzawa, Yutaka Matsuo, Koki Uchiyama, Masayuki Takeda: Behavioral Analysis Based on Relations in Weblogs. ASWC 2006: 162-168 | |
70 | Shunsuke Inenaga, Masayuki Takeda: On-Line Linear-Time Construction of Word Suffix Trees. CPM 2006: 60-71 | |
69 | Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: A New Family of String Classifiers Based on Local Relatedness. Discovery Science 2006: 114-124 | |
68 | Shunsuke Inenaga, Masayuki Takeda: Sparse Directed Acyclic Word Graphs. SPIRE 2006: 61-73 | |
67 | Shunsuke Inenaga, Masayuki Takeda: Sparse compact directed acyclic word graphs. Stringology 2006: 197-211 | |
66 | Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on suffix tree graphs. Stringology 2006: 212-225 | |
2005 | ||
65 | Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda: Practical Algorithms for Pattern Based Linear Regression. Discovery Science 2005: 44-56 | |
64 | Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Fully Incremental LCS Computation. FCT 2005: 563-574 | |
63 | Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto: A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices. GECCO 2005: 1485-1492 | |
62 | Tetsuro Kitahara, Katsuhisa Ishida, Masayuki Takeda: ism: Improvisation Supporting Systems with Melody Correction and Key Vibration. ICEC 2005: 315-327 | |
61 | Tadanobu Furukawa, Tomofumi Matsuzawa, Yutaka Matsuo, Koki Uchiyama, Masayuki Takeda: Analysis of User's Relation and Reading Activity in Weblogs. JSAI Workshops 2005: 280-290 | |
60 | Hisashi Tsuji, Akira Ishino, Masayuki Takeda: A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's. SPIRE 2005: 388-398 | |
59 | 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) | |
58 | 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 | ||
57 | Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda: On Bit-Parallel Processing of Multi-byte Text. AIRS 2004: 289-300 | |
56 | 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 | |
55 | 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 | |
54 | Katsuhisa Ishida, Tetsuro Kitahara, Masayuki Takeda: ism: Improvisation Supporting System based on Melody Correction. NIME 2004: 177-180 | |
53 | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113 | |
52 | Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Patterns. WABI 2004: 450-462 | |
51 | 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) | |
50 | 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) | |
49 | 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) | |
48 | Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004) | |
2003 | ||
47 | Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara: Ternary Directed Acyclic Word Graphs. CIAA 2003: 120-130 | |
46 | Tomohiko Sugimachi, Akira Ishino, Masayuki Takeda, Fumihiro Matsuo: A Method of Extracting Related Words Using Standardized Mutual Information. Discovery Science 2003: 478-485 | |
45 | Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa: Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 | |
44 | 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 | |
43 | Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217 | |
42 | Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara: Linear-Time Off-Line Text Compression by Longest-First Substitution. SPIRE 2003: 137-152 | |
41 | 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) | |
40 | 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) | |
39 | Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda: Uniform characterizations of polynomial-query learnabilities. Theor. Comput. Sci. 292(2): 377-385 (2003) | |
38 | 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) | |
37 | Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri, Mayumi Yamasaki, Kouichi Tamari: Discovering instances of poetic allusion from anthologies of classical Japanese poems. Theor. Comput. Sci. 292(2): 497-524 (2003) | |
36 | Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri: Discovering characteristic expressions in literary works. Theor. Comput. Sci. 292(2): 525-546 (2003) | |
2002 | ||
35 | Alberto Apostolico, Masayuki Takeda: Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings Springer 2002 | |
34 | 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 | |
33 | Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 | |
32 | 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 | |
31 | Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga: Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317 | |
30 | Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri: Mining from Literary Texts: Pattern Discovery and Similarity Computation. Progress in Discovery Science 2002: 518-531 | |
29 | 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 | |
28 | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324 | |
2001 | ||
27 | Masayuki Takeda: String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music. CPM 2001: 147-151 | |
26 | 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 | |
25 | Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Multiple Pattern Matching Algorithms on Collage System. CPM 2001: 193-206 | |
24 | Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Faster Approximate String Matching over Compressed Text. Data Compression Conference 2001: 459-468 | |
23 | Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Compressed Pattern Matching for SEQUITUR. Data Compression Conference 2001: 469- | |
22 | 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 | |
21 | Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440 | |
20 | Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara: Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. ISAAC 2001: 719-730 | |
19 | T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo: Musical Sequence Comparison for Melodic and Rhythmic Similarities. SPIRE 2001: 111-122 | |
18 | 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 | ||
17 | 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 | |
16 | Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Boyer-Moore Type Algorithm for Compressed Pattern Matching. CPM 2000: 181-194 | |
15 | Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri: Discovering Characteristic Expressions from Literary Works: A New Text Analysis Method beyond N-Gram Statistics and KWIC. Discovery Science 2000: 112-126 | |
14 | Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: A Practical Algorithm to Find the Best Subsequence Patterns. Discovery Science 2000: 141-154 | |
13 | Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. SPIRE 2000: 132-138 | |
12 | Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Online Construction of Subsequence Automata for Multiple Texts. SPIRE 2000: 146-152 | |
11 | Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Bit-Parallel Approach to Approximate String Matching in Compressed Texts. SPIRE 2000: 221-228 | |
10 | Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri: Discovery Characteristic Patterns from Collections of Classical Japanese Poems. New Generation Comput. 18(1): 61-74 (2000) | |
1999 | ||
9 | Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Shift-And Approach to Pattern Matching in LZW Compressed Text. CPM 1999: 1-13 | |
8 | Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: Pattern Matching in Text Compressed by Using Antidictionaries. CPM 1999: 37-49 | |
7 | Kouichi Tamari, Mayumi Yamasaki, Takuya Kida, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri: Discovering Poetic Allusion in Anthologies of Classical Japanese Poems. Discovery Science 1999: 128-138 | |
6 | Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa: A Unifying Framework for Compressed Pattern Matching. SPIRE/CRIWG 1999: 89-96 | |
1998 | ||
5 | Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa: Multiple Pattern Matching in LZW Compressed Text. Data Compression Conference 1998: 103-112 | |
4 | Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri: Discovering Characteristic Patterns from Collections of Classical Japanese Poems. Discovery Science 1998: 129-140 | |
3 | Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda: Uniform Characterizations of Polynomial-Query Learnabilities. Discovery Science 1998: 84-92 | |
1997 | ||
2 | Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda: An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. CPM 1997: 1-11 | |
1993 | ||
1 | Noriyoshi Uratani, Masayuki Takeda: A Fast String-Searching Algorithm for Multiple Patterns. Inf. Process. Manage. 29(6): 775-792 (1993) |