- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j15 |      | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms 18: 89-99 (2013) |
| c53 | | Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda: Converting SLP to LZ78 in almost Linear Time. CPM 2013: 38-49 |
| c52 | | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Lyndon Factorization of Grammar Compressed Text. CPM 2013: 153-164 |
| c51 | | Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga: Permuted Pattern Matching on Multi-track Strings. SOFSEM 2013: 280-291 |
| i12 | | Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Computing convolution on grammar-compressed text. CoRR abs/1303.3945 (2013) |
| i11 | | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Lyndon factorization of grammar compressed text. CoRR abs/1304.7061 (2013) |
| i10 | | Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara: Detecting regularities on grammar-compressed strings. CoRR abs/1304.7067 (2013) |
| 2012 | ||
| j14 | | Shunsuke Inenaga, Hideo Bannai: Finding Characteristic Substrings from Compressed Texts. Int. J. Found. Comput. Sci. 23(2): 261-280 (2012) |
| j13 | | Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein: An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. 112(19): 711-714 (2012) |
| c50 | | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. CPM 2012: 220-231 |
| c49 | | Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, Ken Satoh: Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions. ISMIR 2012: 229-234 |
| c48 | | Tomohiro I, Yuki Enokuma, Hideo Bannai, Masayuki Takeda: General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations. ECML/PKDD (2) 2012: 435-450 |
| c47 | | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM 2012: 301-312 |
| c46 | | Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Efficient LZ78 Factorization of Grammar Compressed Text. SPIRE 2012: 86-98 |
| c45 | | Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda: Eager XPath Evaluation over XML Streams. SPIRE 2012: 245-250 |
| c44 | | Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: The Position Heap of a Trie. SPIRE 2012: 360-371 |
| i9 | | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Speeding-up $q$-gram mining on grammar-based compressed texts. CoRR abs/1202.3311 (2012) |
| i8 | | 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) |
| i7 | | Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Efficient LZ78 factorization of grammar compressed text. CoRR abs/1207.4607 (2012) |
| i6 | | |
| 2011 | ||
| j12 | | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50): 6959-6981 (2011) |
| c43 | | Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. CPM 2011: 309-322 |
| c42 | | Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda: Music Genre Classification using Similarity Functions. ISMIR 2011: 693-698 |
| c41 | | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Fast q-gram Mining on SLP Compressed Strings. SPIRE 2011: 278-289 |
| c40 | | Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda: Efficient Eager XPath Filtering over XML Streams. Stringology 2011: 30-44 |
| c39 | | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Inferring Strings from Suffix Trees and Links on a Binary Alphabet. Stringology 2011: 121-130 |
| c38 | | Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Computing Longest Common Substring/Subsequence of Non-linear Texts. Stringology 2011: 197-208 |
| i5 | | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Fast $q$-gram Mining on SLP Compressed Strings. CoRR abs/1103.3114 (2011) |
| i4 | | Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda: Restructuring Compressed Texts without Explicit Decompression. CoRR abs/1107.2729 (2011) |
| i3 | | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-gram Frequencies on Collage Systems. CoRR abs/1107.3019 (2011) |
| i2 | | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts. CoRR abs/1107.3022 (2011) |
| 2010 | ||
| c37 | | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Verifying a Parameterized Border Array in O(n1.5) Time. CPM 2010: 238-250 |
| c36 | | Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda: Sparse Substring Pattern Set Discovery Using Linear Programming Boosting. Discovery Science 2010: 132-143 |
| c35 | | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Counting and Verifying Maximal Palindromes. SPIRE 2010: 135-146 |
| c34 | | Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson: The Number of Runs in a Ternary Word. Stringology 2010: 178-181 |
| 2009 | ||
| j11 | | 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) |
| c33 | | 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 |
| c32 | | Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Lightweight Parameterized Suffix Array Construction. IWOCA 2009: 312-323 |
| c31 | | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Counting Parameterized Border Arrays for a Binary Alphabet. LATA 2009: 422-433 |
| c30 | | Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara: A Series of Run-Rich Strings. LATA 2009: 578-587 |
| c29 | | Shunsuke Inenaga, Hideo Bannai: Finding Characteristic Substrings from Compressed Texts. Stringology 2009: 40-54 |
| c28 | | 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 |
| 2008 | ||
| j10 | | Eiichi Bannai, Etsuko Bannai, Hideo Bannai: Uniqueness of certain association schemes. Eur. J. Comb. 29(6): 1379-1395 (2008) |
| j9 | | Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. 19(1): 147-162 (2008) |
| c27 | | 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 |
| c26 | | Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Parameterized Suffix Arrays for Binary Strings. Stringology 2008: 84-94 |
| c25 | | 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 |
| i1 | | 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 | ||
| j8 | | 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) |
| c24 | | Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 |
| c23 | | Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC 2007: 123-132 |
| c22 | | Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda: Unsupervised Spam Detection Based on String Alienness Measures. Discovery Science 2007: 161-172 |
| c21 | | |
| 2006 | ||
| c20 | | Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda: A New Family of String Classifiers Based on Local Relatedness. Discovery Science 2006: 114-124 |
| c19 | | Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda: Reachability on suffix tree graphs. Stringology 2006: 212-225 |
| 2005 | ||
| j7 | | 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) |
| c18 | | Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda: Practical Algorithms for Pattern Based Linear Regression. Discovery Science 2005: 44-56 |
| c17 | | 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 |
| 2004 | ||
| j6 | | 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) |
| j5 | | 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) |
| c16 | | 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 |
| c15 | | Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano: Finding Optimal Pairs of Patterns. WABI 2004: 450-462 |
| 2003 | ||
| j4 | | 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) |
| c14 | | Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa: Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 |
| c13 |  | 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 |
| c12 | | Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda: Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217 |
| c11 | | Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano: Intrasplicing - Analysis of Long Intron Sequences. Pacific Symposium on Biocomputing 2003: 339-350 |
| 2002 | ||
| j3 | | 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) |
| j2 | | 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) |
| c10 | | Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott: On the Complexity of Deriving Position Specific Score Matrices from Examples. CPM 2002: 168-177 |
| c9 | | Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa: Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 |
| c8 | | Yoshinori Tamada, Hideo Bannai, Osamu Maruyama, Satoru Miyano: Foundations of Designing Computational Knowledge Discovery Processes. Progress in Discovery Science 2002: 459-470 |
| c7 | | Eijiro Sumii, Hideo Bannai: VM lambda: A Functional Calculusfor Scientific Discovery. FLOPS 2002: 290-304 |
| c6 | | 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 |
| c5 | | 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 |
| 2001 | ||
| j1 | | 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) |
| c4 | | Eijiro Sumii, Hideo Bannai: VM lambda: a Functional Calculus for Scientific Discovery. APLAS 2001: 265-275 |
| c3 | | Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano: VML: A View Modeling Language for Computational Knowledge Discovery. Discovery Science 2001: 30-44 |
| c2 | | 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 |
| 1999 | ||
| c1 | | 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 Tue May 21 05:13:31 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page