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 | 73 | 2009 |
New Lower Bounds for the Maximum Number of Runs in a String. W Matsubara, K Kusano, A Ishino, H Bannai, A Shinohara Stringology, 140-145, 2008 | 45 | 2008 |
A series of run-rich strings W Matsubara, K Kusano, H Bannai, A Shinohara Language and Automata Theory and Applications: Third International …, 2009 | 20 | 2009 |
Detecting regularities on grammar-compressed strings I Tomohiro, W Matsubara, K Shimohira, S Inenaga, H Bannai, M Takeda, ... Information and Computation 240, 74-89, 2015 | 15 | 2015 |
New lower bounds for the maximum number of runs in a string K Kusano, W Matsubara, A Ishino, H Bannai, A Shinohara arXiv preprint arXiv:0804.1214, 2008 | 15 | 2008 |
Computing longest common substring and all palindromes from compressed strings W Matsubara, S Inenaga, A Ishino, A Shinohara, T Nakamura, ... SOFSEM 2008: Theory and Practice of Computer Science: 34th Conference on …, 2008 | 14 | 2008 |
Inferring Strings from Runs. W Matsubara, A Ishino, A Shinohara Stringology, 150-160, 2010 | 12 | 2010 |
Lower bounds for the maximum number of runs in a string W Matsubara, K Kusano, A Ishino, H Bannai, A Shinohara HP http://www. shino. ecei. tohoku. ac. jp/runs, 0 | 9 | |
Average value of sum of exponents of runs in a string K Kusano, W Matsubara, A Ishino, A Shinohara International Journal of Foundations of Computer Science 20 (06), 1135-1146, 2009 | 4 | 2009 |
Bit-parallel Algorithms for Computing all the Runs in a String. K Hirashima, H Bannai, W Matsubara, A Ishino, A Shinohara Stringology, 203-213, 2009 | 4 | 2009 |
The number of runs in a ternary word H Bannai, M Griand, K Kusano, W Matsubara, A Shinohara, J Simpson Proceedings of the Prague Stringology Conference 2010, 178-181, 2010 | 3 | 2010 |
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. W Matsubara, S Inenaga, A Shinohara CATS, 19-28, 2009 | 3 | 2009 |
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program W Matsubara, S Inenaga, A Shinohara Dagstuhl Seminar Proceedings, 2008 | 2 | 2008 |
Repetitive Structures in Strings W Matsubara | | 2012 |
Transposition Invariant Fully Compressed Pattern Matching Algorithm W Matsubara, A Shinohara IEICE Technical Report; IEICE Tech. Rep. 110 (12), 39-45, 2010 | | 2010 |
An Algorithm to Test Square-Freeness of BSLP-Compressed Strings W Matsubara, S Inenaga, A Shinohara IEICE Technical Report; IEICE Tech. Rep. 108 (443), 9-16, 2009 | | 2009 |
平衡直線的プログラムで圧縮された文字列の非反復性検証アルゴリズム 松原渉, 稲永俊介, 篠原歩 電子情報通信学会技術研究報告; 信学技報 108 (443), 9-16, 2009 | | 2009 |
Polynomial time algorithms for computing longest common substring and all palindromes from compressed strings W Matsubara, S Inenaga, A Ishino, A Shinohara, T Nakamura, ... IEICE Technical Report; IEICE Tech. Rep. 107 (537), 55-62, 2008 | | 2008 |
Prague Stringology Conference 2010 H Bannai, M Giraud, K Kusano, W Matsubara, A Shinohara, J Simpson | | |