Следене
Shunsuke Inenaga
Shunsuke Inenaga
Professor, Department of Informatics, Kyushu University
Потвърден имейл адрес: inf.kyushu-u.ac.jp - Начална страница
Заглавие
Позовавания
Позовавания
Година
The “runs” theorem
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
SIAM Journal on Computing 46 (5), 1501-1514, 2017
1742017
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
1182005
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
762009
Fully dynamic data structure for LCE queries in compressed space
T Nishimoto, S Inenaga, H Bannai, M Takeda
arXiv preprint arXiv:1605.01488, 2016
712016
Inferring strings from graphs and arrays
H Bannai, S Inenaga, A Shinohara, M Takeda
Mathematical Foundations of Computer Science 2003: 28th International …, 2003
642003
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
492020
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
432014
On-line linear-time construction of word suffix trees
S Inenaga, M Takeda
Combinatorial Pattern Matching: 17th Annual Symposium, CPM 2006, Barcelona …, 2006
422006
Parameterized Suffix Arrays for Binary Strings.
S Deguchi, F Higashijima, H Bannai, S Inenaga, M Takeda
Stringology, 84-94, 2008
392008
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
382014
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
352016
A practical algorithm to find the best episode patterns
M Hirao, S Inenaga, A Shinohara, M Takeda, S Arikawa
Discovery Science: 4th International Conference, DS 2001 Washington, DC, USA …, 2001
352001
Computing palindromic factorizations and palindromic covers on-line
S Sugimoto, S Inenaga, H Bannai, M Takeda
Symposium on Combinatorial Pattern Matching, 150-161, 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
Sensitivity of string compressors and repetitiveness measures
T Akagi, M Funakoshi, S Inenaga
Information and Computation 291, 104999, 2023
322023
Faster online elastic degenerate string matching
K Aoyama, Y Nakashima, S Inenaga, H Bannai, M Takeda
29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 9: 1-9: 10, 2018
312018
Palindrome pattern matching
I Tomohiro, S Inenaga, M Takeda
Theoretical Computer Science 483, 162-170, 2013
312013
Efficient computation of substring equivalence classes with suffix arrays
K Narisawa, S Inenaga, H Bannai, M Takeda
Combinatorial Pattern Matching: 18th Annual Symposium, CPM 2007, London …, 2007
312007
Novel results on the number of runs of the Burrows-Wheeler-Transform
S Giuliani, S Inenaga, Z Lipták, N Prezza, M Sciortino, A Toffanello
SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021
292021
Generalized pattern matching and periodicity under substring consistent equivalence relations
Y Matsuoka, T Aoki, S Inenaga, H Bannai, M Takeda
Theoretical Computer Science 656, 225-233, 2016
292016
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20