![]() | ![]() |
| 2012 | ||
|---|---|---|
| 60 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM 2012: 301-312 | |
| 59 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Speeding-up $q$-gram mining on grammar-based compressed texts CoRR abs/1202.3311: (2012) | |
| 58 | 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) | |
| 57 | Shunsuke Inenaga, Hideo Bannai: Finding Characteristic Substrings from Compressed Texts. Int. J. Found. Comput. Sci. 23(2): 261-280 (2012) | |
| 2011 | ||
| 56 | Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. CPM 2011: 309-322 | |
| 55 | Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda: Music Genre Classification using Similarity Functions. ISMIR 2011: 693-698 | |
| 54 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Fast q-gram Mining on SLP Compressed Strings. SPIRE 2011: 278-289 | |
| 53 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Fast $q$-gram Mining on SLP Compressed Strings CoRR abs/1103.3114: (2011) | |
| 52 | Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda: Restructuring Compressed Texts without Explicit Decompression CoRR abs/1107.2729: (2011) | |
| 51 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-gram Frequencies on Collage Systems CoRR abs/1107.3019: (2011) | |
| 50 | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts CoRR abs/1107.3022: (2011) | |
| 49 | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50): 6959-6981 (2011) | |
| 2010 | ||
| 48 | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Verifying a Parameterized Border Array in O(n1.5) Time. CPM 2010: 238-250 | |
| 47 | Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda: Sparse Substring Pattern Set Discovery Using Linear Programming Boosting. Discovery Science 2010: 132-143 | |
| 46 | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Counting and Verifying Maximal Palindromes. SPIRE 2010: 135-146 | |
| 2009 | ||
| 45 | Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano: Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. Discovery Science 2009: 465-472 | |
| 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 | Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara: A Series of Run-Rich Strings. LATA 2009: 578-587 | |
| 41 | Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara: Bit-parallel Algorithms for Computing all the Runs in a String. Stringology 2009: 203-213 | |
| 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) | |
| 2008 | ||
| 38 | 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 | |
| 37 | Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara: New Lower Bounds for the Maximum Number of Runs in a String. Stringology 2008: 140-145 | |
| 36 | Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Parameterized Suffix Arrays for Binary Strings. Stringology 2008: 84-94 | |
| 35 | 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) | |
| 34 | Eiichi Bannai, Etsuko Bannai, Hideo Bannai: Uniqueness of certain association schemes. Eur. J. Comb. 29(6): 1379-1395 (2008) | |
| 33 | Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. 19(1): 147-162 (2008) | |
| 2007 | ||
| 32 | Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 | |
| 31 | Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC 2007: 123-132 | |
| 30 | Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda: Unsupervised Spam Detection Based on String Alienness Measures. Discovery Science 2007: 161-172 | |
| 29 | Hideo Bannai: Algorithms for String Pattern Discovery. MDAI 2007: 24-29 | |
| 28 | Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott: On the complexity of deriving position specific score matrices from positive and negative sequences. Discrete Applied Mathematics 155(6-7): 676-685 (2007) | |
| 2006 | ||
| 27 | Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: A New Family of String Classifiers Based on Local Relatedness. Discovery Science 2006: 114-124 | |
| 26 | Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on suffix tree graphs. Stringology 2006: 212-225 | |
| 2005 | ||
| 25 | Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda: Practical Algorithms for Pattern Based Linear Regression. Discovery Science 2005: 44-56 | |
| 24 | Osamu Hirose, Naoki Nariai, Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Satoru Miyano: Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks. ICCSA (3) 2005: 349-356 | |
| 23 | Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Toshiaki Katayama, Minoru Kanehisa, Satoru Miyano: Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models. J. Bioinformatics and Computational Biology 3(6): 1295-1314 (2005) | |
| 2004 | ||
| 22 | 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 | |
| 21 | Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Patterns. WABI 2004: 450-462 | |
| 20 | 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) | |
| 19 | 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) | |
| 2003 | ||
| 18 | Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa: Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 | |
| 17 | Yoshinori Tamada, SunYong Kim, Hideo Bannai, Seiya Imoto, Kousuke Tashiro, Satoru Kuhara, Satoru Miyano: Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection. ECCB 2003: 227-236 | |
| 16 | Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217 | |
| 15 | Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano: Intrasplicing - Analysis of Long Intron Sequences. Pacific Symposium on Biocomputing 2003: 339-350 | |
| 14 | Eijiro Sumii, Hideo Bannai: The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation. Journal of Functional and Logic Programming 2003: (2003) | |
| 2002 | ||
| 13 | Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott: On the Complexity of Deriving Position Specific Score Matrices from Examples. CPM 2002: 168-177 | |
| 12 | Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 | |
| 11 | Eijiro Sumii, Hideo Bannai: VM lambda: A Functional Calculusfor Scientific Discovery. FLOPS 2002: 290-304 | |
| 10 | Osamu Maruyama, Satoru Kuhara, Hideo Bannai, Satoru Miyano, Yoshinori Tamada: Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations. JCIS 2002: 1180-1185 | |
| 9 | 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 | |
| 8 | Yoshinori Tamada, Hideo Bannai, Osamu Maruyama, Satoru Miyano: Foundations of Designing Computational Knowledge Discovery Processes. Progress in Discovery Science 2002: 459-470 | |
| 7 | Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano: Extensive feature detection of N-terminal protein sorting signals. Bioinformatics 18(2): 298-305 (2002) | |
| 6 | Osamu Maruyama, Hideo Bannai, Yoshinori Tamada, Satoru Kuhara, Satoru Miyano: Fast algorithm for extracting multiple unordered short motifs using bit operations. Inf. Sci. 146(1-4): 115-126 (2002) | |
| 2001 | ||
| 5 | Eijiro Sumii, Hideo Bannai: VM lambda: a Functional Calculus for Scientific Discovery. APLAS 2001: 265-275 | |
| 4 | Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano: VML: A View Modeling Language for Computational Knowledge Discovery. Discovery Science 2001: 30-44 | |
| 3 | Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano: Views: Fundamental Building Blocks in the Process of Knowledge Discovery. FLAIRS Conference 2001: 233-238 | |
| 2 | Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano: HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process. Electron. Trans. Artif. Intell. 5(B): 73-83 (2001) | |
| 1999 | ||
| 1 | Hideo Bannai, Satoru Miyano: A Definition of Discovery in Terms of Generalized Descriptional Complexity. Discovery Science 1999: 316-318 | |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page