The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Hideo Bannai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eijiro Sumii, Hideo Bannai
    VM lambda: a Functional Calculus for Scientific Discovery. [Citation Graph (0, 0)][DBLP]
    APLAS, 2001, pp:265-275 [Conf]
  2. Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
    On the Complexity of Deriving Position Specific Score Matrices from Examples. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:168-177 [Conf]
  3. Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. [Citation Graph (0, 0)][DBLP]
    DCC, 2007, pp:123-132 [Conf]
  4. Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
    Practical Algorithms for Pattern Based Linear Regression. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2005, pp:44-56 [Conf]
  5. Hideo Bannai, Satoru Miyano
    A Definition of Discovery in Terms of Generalized Descriptional Complexity. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1999, pp:316-318 [Conf]
  6. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano
    VML: A View Modeling Language for Computational Knowledge Discovery. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2001, pp:30-44 [Conf]
  7. Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    A New Family of String Classifiers Based on Local Relatedness. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2006, pp:114-124 [Conf]
  8. Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Discovering Best Variable-Length-Don't-Care Patterns. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2002, pp:86-97 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2004, pp:32-46 [Conf]
  10. Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa
    Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:486-493 [Conf]
  11. Yoshinori Tamada, Hideo Bannai, Osamu Maruyama, Satoru Miyano
    Foundations of Designing Computational Knowledge Discovery Processes. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:459-470 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    ECCB, 2003, pp:227-236 [Conf]
  13. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano
    Views: Fundamental Building Blocks in the Process of Knowledge Discovery. [Citation Graph (0, 0)][DBLP]
    FLAIRS Conference, 2001, pp:233-238 [Conf]
  14. Eijiro Sumii, Hideo Bannai
    VM lambda: A Functional Calculusfor Scientific Discovery. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2002, pp:290-304 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2005, pp:349-356 [Conf]
  16. Osamu Maruyama, Satoru Kuhara, Hideo Bannai, Satoru Miyano, Yoshinori Tamada
    Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations. [Citation Graph (0, 0)][DBLP]
    JCIS, 2002, pp:1180-1185 [Conf]
  17. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Inferring Strings from Graphs and Arrays. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:208-217 [Conf]
  18. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
    Space-Economical Construction of Index Structures for All Suffixes of a String. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:341-352 [Conf]
  19. Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano
    Intrasplicing - Analysis of Long Intron Sequences. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2003, pp:339-350 [Conf]
  20. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    Reachability on suffix tree graphs. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:212-225 [Conf]
  21. Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
    Finding Optimal Pairs of Patterns. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:450-462 [Conf]
  22. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano
    Extensive feature detection of N-terminal protein sorting signals. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2002, v:18, n:2, pp:298-305 [Journal]
  23. Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
    On the complexity of deriving position specific score matrices from positive and negative sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:676-685 [Journal]
  24. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano
    HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process. [Citation Graph (0, 0)][DBLP]
    Electron. Trans. Artif. Intell., 2001, v:5, n:B, pp:73-83 [Journal]
  25. Osamu Maruyama, Hideo Bannai, Yoshinori Tamada, Satoru Kuhara, Satoru Miyano
    Fast algorithm for extracting multiple unordered short motifs using bit operations. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2002, v:146, n:1-4, pp:115-126 [Journal]
  26. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano
    Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:2, n:2, pp:273-288 [Journal]
  27. 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. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2005, v:3, n:6, pp:1295-1314 [Journal]
  28. Eijiro Sumii, Hideo Bannai
    The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation. [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 2003, v:2003, n:, pp:- [Journal]
  29. Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
    An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:4, pp:159-170 [Journal]
  30. Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Efficient Computation of Substring Equivalence Classes with Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:340-351 [Conf]
  31. Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda
    Unsupervised Spam Detection Based on String Alienness Measures. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2007, pp:161-172 [Conf]
  32. Hideo Bannai
    Algorithms for String Pattern Discovery. [Citation Graph (0, 0)][DBLP]
    MDAI, 2007, pp:24-29 [Conf]

  33. Verifying a Parameterized Border Array in O(n1.5) Time. [Citation Graph (, )][DBLP]


  34. Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. [Citation Graph (, )][DBLP]


  35. String Kernels Based on Variable-Length-Don't-Care Patterns. [Citation Graph (, )][DBLP]


  36. Bit-parallel Algorithms for Computing all the Runs in a String. [Citation Graph (, )][DBLP]


  37. Finding Characteristic Substrings from Compressed Texts. [Citation Graph (, )][DBLP]


  38. New Lower Bounds for the Maximum Number of Runs in a String. [Citation Graph (, )][DBLP]


  39. Parameterized Suffix Arrays for Binary Strings. [Citation Graph (, )][DBLP]


  40. A Series of Run-Rich Strings. [Citation Graph (, )][DBLP]


  41. Counting Parameterized Border Arrays for a Binary Alphabet. [Citation Graph (, )][DBLP]


  42. Lightweight Parameterized Suffix Array Construction. [Citation Graph (, )][DBLP]


  43. New Lower Bounds for the Maximum Number of Runs in a String [Citation Graph (, )][DBLP]


  44. Uniqueness of certain association schemes. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002