Shunsuke Inenaga
Title
Cited by
Cited by
Year
The “runs” theorem
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
SIAM Journal on Computing 46 (5), 1501-1514, 2017
882017
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
W Matsubara, S Inenaga, A Ishino, A Shinohara, T Nakamura, ...
Theoretical Computer Science 410 (8-10), 900-913, 2009
642009
Inferring strings from graphs and arrays
H Bannai, S Inenaga, A Shinohara, M Takeda
International Symposium on Mathematical Foundations of Computer Science, 208-217, 2003
512003
On-Line Construction of Compact Directed Acyclic Word Graphs*
S Inenaga, H Hoshino, A Shinohara, M Takeda, S Arikawa, G Mauri, ...
Annual Symposium on Combinatorial Pattern Matching, 169-180, 2001
502001
On-line construction of compact directed acyclic word graphs
S Inenaga, H Hoshino, A Shinohara, M Takeda, S Arikawa, G Mauri, ...
Discrete Applied Mathematics 146 (2), 156-179, 2005
492005
Fully dynamic data structure for LCE queries in compressed space
T Nishimoto, S Inenaga, H Bannai, M Takeda
arXiv preprint arXiv:1605.01488, 2016
392016
On-line linear-time construction of word suffix trees
S Inenaga, M Takeda
Annual Symposium on Combinatorial Pattern Matching, 60-71, 2006
382006
A new characterization of maximal repetitions by Lyndon trees
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
332014
Efficiently finding regulatory elements using correlation with gene expression
H Bannai, S Inenaga, A Shinohara, M Takeda, S Miyano
Journal of bioinformatics and computational biology 2 (02), 273-288, 2004
332004
Shortest unique substrings queries in optimal time
K Tsuruta, S Inenaga, H Bannai, M Takeda
International Conference on Current Trends in Theory and Practice of …, 2014
302014
A practical algorithm to find the best episode patterns
M Hirao, S Inenaga, A Shinohara, M Takeda, S Arikawa
International Conference on Discovery Science, 435-440, 2001
292001
A string pattern regression algorithm and its application to pattern discovery in long introns
H Bannai, S Inenaga, A Shinohara, M Takeda, S Miyano
Genome Informatics 13, 3-11, 2002
262002
Computing palindromic factorizations and palindromic covers on-line
I Tomohiro, S Sugimoto, S Inenaga, H Bannai, M Takeda
Symposium on Combinatorial Pattern Matching, 150-161, 2014
252014
Parameterized Suffix Arrays for Binary Strings.
S Deguchi, F Higashijima, H Bannai, S Inenaga, M Takeda
Stringology, 84-94, 2008
242008
Discovering most classificatory patterns for very expressive pattern classes
M Takeda, S Inenaga, H Bannai, A Shinohara, S Arikawa
International Conference on Discovery Science, 486-493, 2003
242003
Efficient LZ78 factorization of grammar compressed text
H Bannai, S Inenaga, M Takeda
International Symposium on String Processing and Information Retrieval, 86-98, 2012
232012
Counting parameterized border arrays for a binary alphabet
I Tomohiro, S Inenaga, H Bannai, M Takeda
International Conference on Language and Automata Theory and Applications …, 2009
232009
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
I Tomohiro, Y Nakashima, S Inenaga, H Bannai, M Takeda
Theoretical Computer Science 656, 215-224, 2016
222016
Fast q-gram mining on SLP compressed strings
K Goto, H Bannai, S Inenaga, M Takeda
Journal of Discrete Algorithms 18, 89-99, 2013
222013
Faster subsequence and don’t-care pattern matching on compressed texts
T Yamamoto, H Bannai, S Inenaga, M Takeda
Annual Symposium on Combinatorial Pattern Matching, 309-322, 2011
222011
The system can't perform the operation now. Try again later.
Articles 1–20