Hideo Bannai
Hideo Bannai
Professor, M&D Data Science Center, Tokyo Medical and Dental University, Japan
Verified email at
Cited by
Cited by
Extensive feature detection of N-terminal protein sorting signals
H Bannai, Y Tamada, O Maruyama, K Nakai, S Miyano
Bioinformatics 18 (2), 298-305, 2002
Identification of novel adrenomedullin in mammals: a potent cardiovascular and renal regulator
Y Takei, K Inoue, M Ogoshi, T Kawahara, H Bannai, S Miyano
FEBS letters 556 (1-3), 53-58, 2004
Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection
Y Tamada, SY Kim, H Bannai, S Imoto, K Tashiro, S Kuhara, S Miyano
Bioinformatics 19 (suppl_2), ii227-ii236, 2003
The “Runs” Theorem
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
SIAM Journal on Computing 46 (5), 1501-1514, 2017
Yeast [PSI+] “Prions” that Are Crosstransmissible and Susceptible beyond a Species Barrier through a Quasi-Prion State
T Nakayashiki, K Ebihara, H Bannai, Y Nakamura
Molecular cell 7 (6), 1121-1130, 2001
Fully dynamic data structure for LCE queries in compressed space
T Nishimoto, S Inenaga, H Bannai, M Takeda
arXiv preprint arXiv:1605.01488, 2016
Inferring strings from graphs and arrays
H Bannai, S Inenaga, A Shinohara, M Takeda
Mathematical Foundations of Computer Science 2003, 208-217, 2003
Refining the r-index
H Bannai, T Gagie, T I
Theoretical Computer Science 812, 96-108, 2020
New lower bounds for the maximum number of runs in a string
W Matsubara, K Kusano, A Ishino, H Bannai, A Shinohara
Prague Stringology Conference 2008, 140-145, 2008
Simpler and faster Lempel Ziv factorization
K Goto, H Bannai
2013 Data Compression Conference, 133-142, 2013
Dynamic index and LZ factorization in compressed space
T Nishimoto, T I, S Inenaga, H Bannai, M Takeda
Discrete Applied Mathematics 274, 116-129, 2020
Fast q-gram mining on SLP compressed strings
K Goto, H Bannai, S Inenaga, M Takeda
String Processing and Information Retrieval, 278-289, 2011
Space efficient linear time Lempel-Ziv factorization for small alphabets
K Goto, H Bannai
2014 Data Compression Conference, 163-172, 2014
A new characterization of maximal repetitions by Lyndon trees
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
Proceedings of the 2015 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2015
Utilizing evolutionary information and gene expression data for estimating gene networks with bayesian network models
Y Tamada, H Bannai, S Imoto, T Katayama, M Kanehisa, S Miyano
Journal of bioinformatics and computational biology 3 (06), 1295-1313, 2005
Shortest unique substrings queries in optimal time
K Tsuruta, S Inenaga, H Bannai, M Takeda
SOFSEM 2014: Theory and Practice of Computer Science: 40th International …, 2014
Parameterized suffix arrays for binary strings
S Deguchi, F Higashijima, H Bannai, S Inenaga, M Takeda
Prague Stringology Conference 2008, 84-94, 2008
Views: Fundamental Building Blocks in the Process of Knowledge Discovery.
H Bannai, Y Tamada, O Maruyama, K Nakai, S Miyano
FLAIRS, 233-238, 2001
Contribution of comparative fish studies to general endocrinology: structure and function of some osmoregulatory hormones
Y Takei, A Kawakoshi, T Tsukada, S Yuge, M Ogoshi, K Inoue, S Hyodo, ...
Journal of Experimental Zoology Part A: Comparative Experimental Biology 305 …, 2006
Computing DAWGs and minimal absent words in linear time for integer alphabets
Y Fujishige, Y Tsujimaru, S Inenaga, H Bannai, M Takeda
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
The system can't perform the operation now. Try again later.
Articles 1–20