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
1112017
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
522003
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
512005
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
492001
Fully dynamic data structure for LCE queries in compressed space
T Nishimoto, S Inenaga, H Bannai, M Takeda
arXiv preprint arXiv:1605.01488, 2016
422016
On-line linear-time construction of word suffix trees
S Inenaga, M Takeda
Annual Symposium on Combinatorial Pattern Matching, 60-71, 2006
402006
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
362014
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
342014
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
322004
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
312001
Dynamic index and LZ factorization in compressed space
T Nishimoto, I Tomohiro, S Inenaga, H Bannai, M Takeda
Discrete Applied Mathematics 274, 116-129, 2020
29*2020
Parameterized Suffix Arrays for Binary Strings.
S Deguchi, F Higashijima, H Bannai, S Inenaga, M Takeda
Stringology, 84-94, 2008
262008
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
Linear-time text compression by longest-first substitution
R Nakamura, S Inenaga, H Bannai, T Funamoto, M Takeda, A Shinohara
Algorithms 2 (4), 1429-1448, 2009
252009
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
252002
Efficient LZ78 factorization of grammar compressed text
H Bannai, S Inenaga, M Takeda
International Symposium on String Processing and Information Retrieval, 86-98, 2012
242012
Efficient computation of substring equivalence classes with suffix arrays
K Narisawa, S Inenaga, H Bannai, M Takeda
Annual Symposium on Combinatorial Pattern Matching, 340-351, 2007
242007
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
Fast q-gram mining on SLP compressed strings
K Goto, H Bannai, S Inenaga, M Takeda
Journal of Discrete Algorithms 18, 89-99, 2013
232013
The system can't perform the operation now. Try again later.
Articles 1–20