The “runs” theorem H Bannai, T I, S Inenaga, Y Nakashima, M Takeda, K Tsuruta SIAM Journal on Computing 46 (5), 1501-1514, 2017 | 156 | 2017 |
Refining the r-index H Bannai, T Gagie, I Tomohiro Theoretical Computer Science 812, 96-108, 2020 | 55 | 2020 |
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 | 45 | 2020 |
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 | 40 | 2014 |
Computing Palindromic Factorizations and Palindromic Covers On-line T I, S Sugimoto, S Inenaga, H Bannai, M Takeda Combinatorial Pattern Matching, 150-161, 2014 | 32* | 2014 |
Palindrome pattern matching I Tomohiro, S Inenaga, M Takeda Theoretical Computer Science 483, 162-170, 2013 | 32 | 2013 |
Longest Common Extensions with Recompression. I Tomohiro CPM 78, 18, 2017 | 29 | 2017 |
Beyond the runs theorem J Fischer, Š Holub, T I, M Lewenstein International Symposium on String Processing and Information Retrieval, 277-286, 2015 | 27 | 2015 |
Lempel–Ziv factorization powered by space efficient suffix trees J Fischer, T I, D Köppl, K Sadakane Algorithmica 80, 2048-2081, 2018 | 25 | 2018 |
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes: Finding All Maximal α-gapped Repeats and Palindromes in Optimal … P Gawrychowski, T I, S Inenaga, D Köppl, F Manea Theory of Computing Systems 62, 162-191, 2018 | 23 | 2018 |
Lightweight Parameterized Suffix Array Construction T I, S Deguchi, H Bannai, S Inenaga, M Takeda Combinatorial Algorithms, 312-323, 2009 | 23* | 2009 |
Inferring strings from suffix trees and links on a binary alphabet T I, S Inenaga, H Bannai, M Takeda Discrete Applied Mathematics 163, 316-325, 2014 | 22* | 2014 |
Counting parameterized border arrays for a binary alphabet T I, S Inenaga, H Bannai, M Takeda Language and Automata Theory and Applications, 422-433, 2009 | 21* | 2009 |
A faster algorithm for computing maximal-gapped repeats in a string Y Tanimura, Y Fujishige, T I, S Inenaga, H Bannai, M Takeda International Symposium on String Processing and Information Retrieval, 124-136, 2015 | 20 | 2015 |
PHONI: Streamed matching statistics with multi-genome references C Boucher, T Gagie, I Tomohiro, D Köppl, B Langmead, G Manzini, ... 2021 Data Compression Conference (DCC), 193-202, 2021 | 19 | 2021 |
Closed factorization G Badkobeh, H Bannai, K Goto, I Tomohiro, CS Iliopoulos, S Inenaga, ... Discrete Applied Mathematics 212, 23-29, 2016 | 19 | 2016 |
Constructing LZ78 tries and position heaps in linear time for large alphabets Y Nakashima, I Tomohiro, S Inenaga, H Bannai, M Takeda Information Processing Letters 115 (9), 655-659, 2015 | 19 | 2015 |
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text T I, Y Nakashima, S Inenaga, H Bannai, M Takeda String Processing and Information Retrieval, 174-185, 2013 | 19* | 2013 |
Deterministic sparse suffix sorting on rewritable texts J Fischer, T I, D Köppl LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016 | 18 | 2016 |
Counting and verifying maximal palindromes T I, S Inenaga, H Bannai, M Takeda String Processing and Information Retrieval, 135-146, 2010 | 18* | 2010 |