Folgen
Shunsuke Inenaga
Shunsuke Inenaga
Professor, Department of Informatics, Kyushu University
Bestätigte E-Mail-Adresse bei inf.kyushu-u.ac.jp - Startseite
Titel
Zitiert von
Zitiert von
Jahr
The “runs” theorem
H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta
SIAM Journal on Computing 46 (5), 1501-1514, 2017
1382017
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
712009
Inferring strings from graphs and arrays
H Bannai, S Inenaga, A Shinohara, M Takeda
Mathematical Foundations of Computer Science 2003: 28th International …, 2003
582003
Fully dynamic data structure for LCE queries in compressed space
T Nishimoto, S Inenaga, H Bannai, M Takeda
arXiv preprint arXiv:1605.01488, 2016
552016
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
552005
On-Line Construction of Compact Directed Acyclic Word Graphs*
GM Landau, S Inenaga, H Hoshino, A Shinohara, M Takeda, S Arikawa, ...
Combinatorial Pattern Matching: 12th Annual Symposium, CPM 2001 Jerusalem …, 2001
542001
On-line linear-time construction of word suffix trees
S Inenaga, M Takeda
Combinatorial Pattern Matching: 17th Annual Symposium, CPM 2006, Barcelona …, 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
392014
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
37*2020
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
352014
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
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
Computing palindromic factorizations and palindromic covers on-line
S Sugimoto, S Inenaga, H Bannai, M Takeda
Symposium on Combinatorial Pattern Matching, 150-161, 2014
312014
Parameterized Suffix Arrays for Binary Strings.
S Deguchi, F Higashijima, H Bannai, S Inenaga, M Takeda
Stringology, 84-94, 2008
312008
Palindrome pattern matching
I Tomohiro, S Inenaga, M Takeda
Theoretical Computer Science 483, 162-170, 2013
302013
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
272016
Fast q-gram mining on SLP compressed strings
K Goto, H Bannai, S Inenaga, M Takeda
Journal of Discrete Algorithms 18, 89-99, 2013
272013
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
272007
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
272002
Efficient LZ78 factorization of grammar compressed text
H Bannai, S Inenaga, M Takeda
String Processing and Information Retrieval: 19th International Symposium …, 2012
262012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20