Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski. Constructing and indexing the bijective and extended Burrows-Wheeler transform INFORMATION AND COMPUTATION. 2024; 297 105153. ( DOI )

Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets Theoretical Computer Science. 2023.09; 973 114093. ( DOI )

Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai. Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings Proc. 30th International Symposium on String Processing and Information Retrieval (SPIRE 2023). 2023.09; 14240 331-344. ( DOI )

Hideo Bannai, Jonas Eller. Lyndon Arrays in Sublinear Time Proc. 31st Annual European Symposium on Algorithms (ESA 2023). 2023.09; 274 14:1-14:16. ( DOI )

Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie. Acceleration of FM-Index Queries Through Prefix-Free Parsing Proc. 23rd International Workshop on Algorithms in Bioinformatics (WABI 2023). 2023.09; 273 13:1-13:16. ( DOI )

Bannai Hideo, Tomohiro I, Koeppl Dominik. Longest bordered and periodic subsequences INFORMATION PROCESSING LETTERS. 2023.08; 182 ( DOI )

Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno. Optimal LZ-End Parsing Is Hard Proc. 34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023). 2023.06; 3-11. ( DOI )

Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi. Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences Algorithmica. 2023.04; ( DOI )

Benedikt Kirsch-Gerweck, Leonard Bohnenkämper, Michel T Henrichs, Jarno N Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Joachim Burger, Jens Stoye, Yoan Diekmann. HaploBlocks: Efficient Detection of Positive Selection in Large Population Genomic Datasets Molecular Biology and Evolution. 2023.02; 40 (3): ( DOI )

Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai. Space-Efficient STR-IC-LCS Computation Lecture Notes in Computer Science. 2023.01; 372-384. ( DOI )

Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno. Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions String Processing and Information Retrieval. 2022.11; 24-37. ( DOI )

Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda. Parameterized DAWGs: Efficient constructions and bidirectional pattern searches Theoretical Computer Science. 2022.10; 933 21-42. ( DOI )

Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto. Computing NP-hard Repetitiveness Measures via MAX-SAT Proc. The 30th Annual European Symposium on Algorithms. 2022.09; 244 12:1-12:16. ( DOI )

Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Combinatorics of minimal absent words for a sliding window Theoretical Computer Science. 2022.08; 927 109-119. ( DOI )

Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi. Computing Longest (Common) Lyndon Subsequences Proc. International Workshop on Combinatorial Algorithms (IWOCA 2022). 2022.06; 13270 128-142. ( DOI )

Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches Information and Computation. 2022.05; 104794. ( DOI )

Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Factorizing Strings into Repetitions Theory of Computing Systems. 2022.04; ( DOI )

Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Minimal Unique Substrings for a Sliding Window Algorithmica. 2022.03; ( DOI )

Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Palindromic Trees for a Sliding Window and Its Applications Information Processing Letters. 2022.01; 173 106174. ( DOI )

Luís M.S. Russo, Diogo Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco. Order-preserving pattern matching indeterminate strings Information and Computation. 2022; 289 (A): 104924. ( DOI )

Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Efficiently computing runs on a trie Theoretical Computer Science. 2021.10; 887 143-151. ( DOI )

Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Grammar Index by Induced Suffix Sorting String Processing and Information Retrieval. 2021.10; 85-99. ( DOI )

Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto. A Separation of $$\gamma $$ and b via Thue–Morse Words String Processing and Information Retrieval. 2021.10; 167-178. ( DOI )

Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Longest Common Rollercoasters String Processing and Information Retrieval. 2021.10; 21-32. ( DOI )

Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piątkowski. Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021). 2021.07; 7:1-7:16. ( DOI )

Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar. Longest previous overlapping factor array Information Processing Letters. 2021.06; 168 106097. ( DOI )

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. The Parameterized Suffix Tray 12th International Conference on Algorithms and Complexity. 2021.05; 258-270. ( DOI )

Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Compressed Communication Complexity of Hamming Distance Algorithms. 2021.04; 14 (4): 116. ( DOI )

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing longest palindromic substring after single-character or block-wise edits Theoretical Computer Science. 2021.03; 859 116-133. ( DOI )

Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh. The Smallest Grammar Problem Revisited IEEE Transactions on Information Theory. 2021.01; 67 (1): 317-328. ( DOI )

Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Space-efficient algorithms for computing minimal/shortest unique substrings Theoretical Computer Science. 2020.12; 845 230-242. ( DOI )

Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Towards Efficient Interactive Computation of Dynamic Time Warping Distance String Processing and Information Retrieval. 2020.10; 27-41. ( DOI )

Hideo Bannai, Takuya Mieno, Yuto Nakashima. Lyndon Words, the Three Squares Lemma, and Primitive Squares String Processing and Information Retrieval. 2020.10; 265-273. ( DOI )

Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. On Repetitiveness Measures of Thue-Morse Words String Processing and Information Retrieval. 2020.10; 213-220. ( DOI )

Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai. Longest Square Subsequence Problem Revisited String Processing and Information Retrieval. 2020.10; 147-154. ( DOI )

Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo. More Time-Space Tradeoffs for Finding a Shortest Unique Substring Algorithms. 2020.09; 13 (234): 1-9. ( DOI )

Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Grammar-compressed Self-index with Lyndon Words 情報処理学会論文誌数理モデル化と応用 (TOM). 2020.08; 13 (2): 84-92.

Katsuhito Nakashima, Moriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda. DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020). 2020.06; 26:1-26:14. ( DOI )

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara. Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020). 2020.06; 12:1-12:11. ( DOI )

Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings Theory of Computing Systems. 2020.05; ( DOI )

Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida. Practical Grammar Compression Based on Maximal Repeats Algorithms. 2020.04; 13 (4): 103. ( DOI )

Hideo Bannai, Travis Gagie, Tomohiro I. Refining the r-index Theoretical Computer Science. 2020.04; 812 96-108. ( DOI )

Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Dynamic index and LZ factorization in compressed space Discrete Applied Mathematics. 2020.03; 274 116-129. ( DOI )

Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. 2020 Data Compression Conference (DCC). 2020.03; 243-252. ( DOI )

Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye. Finding all maximal perfect haplotype blocks in linear time Algorithms for Molecular Biology. 2020.02; 15 (1): ( DOI )

Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Faster STR-EC-LCS Computation SOFSEM 2020: Theory and Practice of Computer Science. 2020; 125-135. ( DOI )

Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Minimal Unique Substrings and Minimal Absent Words in a Sliding Window SOFSEM 2020: Theory and Practice of Computer Science. 2020; 148-160. ( DOI )

Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. On the size of the smallest alphabet for Lyndon trees Theoretical Computer Science. 2019.11; 792 131-143. ( DOI )

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Maximal Palindromes and Distinct Palindromes in a Trie. Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019.. 2019; 3-15.

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. The Parameterized Position Heap of a Trie. Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings. 2019; 237-248. ( DOI )

Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski. Indexing the Bijective BWT. 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy.. 2019; 17:1-17:14. ( DOI )

Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga,Array, Masayuki Takeda. Computing Runs on a Trie. 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy.. 2019; 23:1-23:11. ( DOI )

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga,Array, Masayuki Takeda. Faster Queries for Longest Substring Palindrome After Block Edit. 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy.. 2019; 27:1-27:13. ( DOI )

Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga,Array, Masayuki Takeda. On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy.. 2019; 29:1-29:11. ( DOI )

Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida. MR-RePair: Grammar Compression Based on Maximal Repeats. Data Compression Conference, DCC 2019, Snowbird, UT, USA, March 26-29, 2019. 2019; 508-517. ( DOI )

Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. 2019; 430-441. ( DOI )

Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye. Finding All Maximal Perfect Haplotype Blocks in Linear Time. 19th International Workshop on Algorithms in Bioinformatics, WABI 2019, September 8-10, 2019, Niagara Falls, NY, USA.. 2019; 8:1-8:9. ( DOI )

Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto. k-Abelian Pattern Matching: Revisited, Corrected, and Extended. Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019.. 2019; 29-40.

Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. An Improved Data Structure for Left-Right Maximal Generic Words Problem 30th International Symposium on Algorithms and Computation (ISAAC 2019). 2019; 40:1-40:12. ( DOI )

Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Compact Data Structures for Shortest Unique Substring Queries String Processing and Information Retrieval. 2019; 107-123. ( DOI )

Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka. On Longest Common Property Preserved Substring Queries String Processing and Information Retrieval. 2019; 162-174. ( DOI )

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets String Processing and Information Retrieval. 2019; 382-391. ( DOI )

Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Right-to-left Online Construction of Parameterized Position Heaps. Prague Stringology Conference 2018, Prague, Czech Republic, August 27-28, 2018.. 2018; 91-102.

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Longest substring palindrome after edit. Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. 2018; 12:1-12:14. ( DOI )

Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda. Computing longest common square subsequences. Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. 2018; 15:1-15:13. ( DOI )

Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Longest Lyndon Substring After Edit. Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. 2018; 19:1-19:10. ( DOI )

Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Lyndon Factorization of Grammar Compressed Texts Revisited. Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. 2018; 24:1-24:10. ( DOI )

Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga. Block Palindromes: A New Generalization of Palindromes. String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings. 2018; 183-190. ( DOI )

Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. String Processing and Information Retrieval - 25th International Symposium, SPIRE 2018, Lima, Peru, October 9-11, 2018, Proceedings. 2018; 254-267. ( DOI )

Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. O(n log n)-time Text Compression by LZ-style Longest First Substitution. Prague Stringology Conference 2018, Prague, Czech Republic, August 27-28, 2018.. 2018; 12-26.

Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Faster Online Elastic Degenerate String Matching. Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. 2018; 9:1-9:10. ( DOI )

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto. Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci.. 2018; 29 (2): 143-164. ( DOI )

Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga,Array, Masayuki Takeda. Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms. 2018; 52-53 122-132. ( DOI )

Rui Henriques, Alexandre P. Francisco, Luís M, S. Russo, Hideo Bannai. Order-Preserving Pattern Matching Indeterminate Strings. Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. 2018; 2:1-2:15. ( DOI )

Hideo Bannai, Travis Gagie, Tomohiro I. Online LZ77 Parsing and Matching Statistics with RLBWTs. Annual Symposium on Combinatorial Pattern Matching, CPM 2018, July 2-4, 2018 - Qingdao, China. 2018; 7:1-7:12. ( DOI )

Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Efficient Computation of Substring Equivalence Classes with Suffix Arrays Algorithmica. 2017.10; 79 (2): 291-318. ( DOI )

Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Inferring strings from Lyndon factorization Theoretical Computer Science. 2017.08; 689 147-156. ( DOI )

Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. On Reverse Engineering the Lyndon Tree. Proceedings of the Prague Stringology Conference 2017, Prague, Czech Republic, August 28-30, 2017. 2017; 108-117.

Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Faster STR-IC-LCS Computation via RLE. 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. 2017; 20:1-20:12. ( DOI )

Hideo Bannai, Shunsuke Inenaga, Dominik Köppl. Computing All Distinct Squares in Linear Time for Integer Alphabets. 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. 2017; 22:1-22:18. ( DOI )

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Tight Bounds on the Maximum Number of Shortest Unique Substrings. 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. 2017; 24:1-24:11. ( DOI )

Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand. 2017; 33:1-33:12. ( DOI )

Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Shortest Unique Palindromic Substring Queries in Optimal Time. Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers. 2017; 397-408. ( DOI )

Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Abelian String Regularities Based on RLE. Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers. 2017; 420-431. ( DOI )

Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Small-Space LCE Data Structure with Constant-Time Queries. 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark. 2017; 10:1-10:15. ( DOI )

Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Order Preserving Pattern Matching on Trees and DAGs. String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings. 2017; 271-277. ( DOI )

Hideo Bannai, Tomohiro, I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta. The "Runs" Theorem SIAM Journal on Computing. 2017; 46 (5): 1501-1514. ( DOI )

Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara. Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings SOFSEM 2017: Theory and Practice of Computer Science. 2017; 363-374. ( DOI )

Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Generalized pattern matching and periodicity under substring consistent equivalence relations Theoretical Computer Science. 2016.12; 656 225-233. ( DOI )

Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Faster Lyndon factorization algorithms for SLP and LZ78 compressed text Theoretical Computer Science. 2016.12; 656 215-224. ( DOI )

Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto. Closed factorization Discrete Applied Mathematics. 2016.10; 212 23-29. ( DOI )

Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Fully Dynamic Data Structure for LCE Queries in Compressed Space. 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. 2016; 72:1-72:15. ( DOI )

Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda. Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. 2016; 1:1-1:10. ( DOI )

Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea. Factorizing a String into Squares in Linear Time. 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. 2016; 27:1-27:12. ( DOI )

Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. 2016; 38:1-38:14. ( DOI )

Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Shortest Unique Substring Queries on Run-Length Encoded Strings. 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. 2016; 69:1-69:11. ( DOI )

Takaaki Nishimoto, Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Dynamic Index and LZ Factorization in Compressed Space PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2016. 2016; 158-171.

Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Finding Gapped Palindromes Online Combinatorial Algorithms. 2016; 9843 191-202. ( DOI )

Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Smallest and Largest Repetition Factorizations in O(n log n) Time PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2016. 2016; 135-145.

Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Constructing LZ78 tries and position heaps in linear time for large alphabets Information Processing Letters. 2015.09; 115 (9): 655-659. ( DOI )

Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta. A new characterization of maximal repetitions by Lyndon trees. Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. 2015; 562-571. ( DOI )

Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Left-Right Maximal Generic Words. Proceedings of the Prague Stringology Conference 2015, Prague, Czech Republic, August 24-26, 2015. 2015; 5-16.

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. 2015; 219-230. ( DOI )

Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Ischia Island, Italy, June 29 - July 1, 2015, Proceedings. 2015; 355-366. ( DOI )

Yuka Tanimura, Yuta Fujishige, Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. A Faster Algorithm for Computing Maximal alpha-gapped Repeats in a String STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2015). 2015; 9309 124-136. ( DOI )

Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. An Opportunistic Text Indexing Structure Based on Run Length Encoding ALGORITHMS AND COMPLEXITY (CIAC 2015). 2015; 9079 390-402. ( DOI )

Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Karkkainen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto. Diverse Palindromic Factorization Is NP-complete DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015). 2015; 9168 85-96. ( DOI )

Makoto Nishida, Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Inferring Strings from Full Abelian Periods ALGORITHMS AND COMPUTATION, ISAAC 2015. 2015; 9472 768-779. ( DOI )

Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen. Efficient Algorithms for Longest Closed Factor Array STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2015). 2015; 9309 95-102. ( DOI )

Eiichi Bannai, Etsuko Bannai, Hideo Bannai. On the existence of tight relative 2-designs on binary Hamming association schemes DISCRETE MATHEMATICS. 2014.01; 314 17-37. ( DOI )

Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Inferring strings from suffix trees and links on a binary alphabet DISCRETE APPLIED MATHEMATICS. 2014.01; 163 316-325. ( DOI )

Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas, S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto. Closed Factorization. Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014. 2014; 162-168.

Keisuke Goto, Hideo Bannai. Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets. Data Compression Conference, DCC 2014, Snowbird, UT, USA, 26-28 March, 2014. 2014; 163-172. ( DOI )

Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Faster Compact On-Line Lempel-Ziv Factorization. 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France. 2014; 675-686. ( DOI )

Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Abelian Covers and Abelian Runs. Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014. 2014; 43-51.

Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Shortest Unique Substrings Queries in Optimal Time SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE. 2014; 8327 503-513. ( DOI )

Tomohiro, I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Palindromic Factorizations and Palindromic Covers On-line COMBINATORIAL PATTERN MATCHING, CPM 2014. 2014; 8486 150-161. ( DOI )

Yuto Nakashima, Takashi Okabe, Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Inferring Strings from Lyndon Factorization MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE, PT II. 2014; 8635 565-576. ( DOI )

Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Compressed Automata for Dictionary Matching. Implementation and Application of Automata - 18th International Conference, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings. 2013; 319-330. ( DOI )

Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Reversed Lempel-Ziv Factorization Online. Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013. 2013; 107-118.

Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga. Permuted Pattern Matching on Multi-track Strings. SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings. 2013; 280-291. ( DOI )

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms. 2013; 18 89-99. ( DOI )

Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda. Converting SLP to LZ78 in almost Linear Time. Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. 2013; 38-49. ( DOI )

Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Convolution on Grammar-Compressed Text. 2013 Data Compression Conference, DCC 2013, Snowbird, UT, USA, March 20-22, 2013. 2013; 451-460. ( DOI )

Tomohiro, I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text STRING PROCESSING AND INFORMATION RETRIEVAL (SPIRE 2013). 2013; 8214 174-185. ( DOI )

Tomohiro, I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Efficient Lyndon Factorization of Grammar Compressed Text COMBINATORIAL PATTERN MATCHING. 2013; 7922 153-164. ( DOI )

Keisuke Goto, Hideo Bannai. Simpler and Faster Lempel Ziv Factorization 2013 DATA COMPRESSION CONFERENCE (DCC). 2013; 133-142. ( DOI )

Yuya Tamakoshi, Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. From Run Length Encoding to LZ78 and Back Again 2013 DATA COMPRESSION CONFERENCE (DCC). 2013; 143-152. ( DOI )

Tomohiro, I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara. Detecting Regularities on Grammar-Compressed Strings MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013. 2013; 8087 571-582. ( DOI )

Hideo Bannai, Travis Gagie, Tomohiro, I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein. An efficient algorithm to test square-freeness of strings compressed by straight-line programs INFORMATION PROCESSING LETTERS. 2012.10; 112 (19): 711-714. ( DOI )

Shunsuke Inenaga, Hideo Bannai. FINDING CHARACTERISTIC SUBSTRINGS FROM COMPRESSED TEXTS INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. 2012.02; 23 (2): 261-280. ( DOI )

Tomohiro I, Yuki Enokuma, Hideo Bannai, Masayuki Takeda. General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations. Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2012, Bristol, UK, September 24-28, 2012. Proceedings, Part II. 2012; 435-450. ( DOI )

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings. 2012; 220-231. ( DOI )

Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, Ken Satoh. Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions. Proceedings of the 13th International Society for Music Information Retrieval Conference, ISMIR 2012, Mosteiro S.Bento Da Vitória, Porto, Portugal, October 8-12, 2012. 2012; 229-234.

Yuto Nakashima, Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. The Position Heap of a Trie STRING PROCESSING AND INFORMATION RETRIEVAL. 2012; 7608 360-371. ( DOI )

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts SOFSEM 2012: THEORY AND PRACTICE OF COMPUTER SCIENCE. 2012; 7147 301-312. ( DOI )

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Efficient LZ78 Factorization of Grammar Compressed Text STRING PROCESSING AND INFORMATION RETRIEVAL. 2012; 7608 86-98. ( DOI )

Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda. Eager XPath Evaluation over XML Streams STRING PROCESSING AND INFORMATION RETRIEVAL. 2012; 7608 245-250. ( DOI )

Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Verifying and enumerating parameterized border arrays THEORETICAL COMPUTER SCIENCE. 2011.11; 412 (50): 6959-6981. ( DOI )

Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda. Music Genre Classification using Similarity Functions. Proceedings of the 12th International Society for Music Information Retrieval Conference, ISMIR 2011, Miami, Florida, USA, October 24-28, 2011. 2011; 693-698.

Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Computing Longest Common Substring/Subsequence of Non-linear Texts PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2011. 2011; 197-208.

Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts COMBINATORIAL PATTERN MATCHING, 22ND ANNUAL SYMPOSIUM, CPM 2011. 2011; 6661 309-322. ( DOI )

Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Fast q-gram Mining on SLP Compressed Strings STRING PROCESSING AND INFORMATION RETRIEVAL. 2011; 7024 278-289. ( DOI )

Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda. Efficient Eager XPath Filtering over XML Streams PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2011. 2011; 30-44.

Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Inferring Strings from Suffix Trees and Links on a Binary Alphabet PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2011. 2011; 121-131.

Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson. The Number of Runs in a Ternary Word PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2010. 2010; 178-181.

Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Verifying a Parameterized Border Array in O(n(1.5)) Time COMBINATORIAL PATTERN MATCHING, PROCEEDINGS. 2010; 6129 238-+. ( DOI )

Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda. Sparse Substring Pattern Set Discovery Using Linear Programming Boosting DISCOVERY SCIENCE, DS 2010. 2010; 6332 132-143. ( DOI )

Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Counting and Verifying Maximal Palindromes STRING PROCESSING AND INFORMATION RETRIEVAL. 2010; 6393 135-+. ( DOI )

Yoshimi Yashiro, Hideo Bannai, Takashi Minowa, Tomohide Yabiku, Satoru Miyano, Mitsujiro Osawa, Atsushi Iwama, Hiromitsu Nakauchi. Transcriptional profiling of hematopoietic stem cells by high-throughput sequencing International Journal of Hematology. 2009.01; 89 (1): 24-33. ( DOI )

Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara. Linear-Time Text Compression by Longest-First Substitution. Algorithms. 2009; 2 (4): 1429-1448. ( DOI )

Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara. Bit-parallel algorithms for computing all the runs in a string PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009. 2009; 203-213.

Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano. Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality DISCOVERY SCIENCE, PROCEEDINGS. 2009; 5808 465-+. ( DOI )

Tomohiro, I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Lightweight Parameterized Suffix Array Construction COMBINATORIAL ALGORITHMS. 2009; 5874 312-+. ( DOI )

Tomohiro, I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. Counting Parameterized Border Arrays for a Binary Alphabet LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS. 2009; 5457 422-+. ( DOI )

Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara. A Series of Run-Rich Strings LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS. 2009; 5457 578-+. ( DOI )

Shunsuke Inenaga, Hideo Bannai. Finding Characteristic Substrings from Compressed Texts PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009. 2009; 40-54.

Eiichi Bannai, Etsuko Bannai, Hideo Bannai. Uniqueness of certain association schemes EUROPEAN JOURNAL OF COMBINATORICS. 2008.08; 29 (6): 1379-1395. ( DOI )

Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Reachability on suffix tree graphs INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. 2008.02; 19 (1): 147-162. ( DOI )

Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara. New Lower Bounds for the Maximum Number of Runs in a String PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2008. 2008; 140-145.

Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda. String Kernels Based on Variable-Length-Don't-Care Patterns DISCOVERY SCIENCE, PROCEEDINGS. 2008; 5255 308-+. ( DOI )

Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Parameterized Suffix Arrays for Binary Strings PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2008. 2008; 84-94.

Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott. On the complexity of deriving position specific score matrices from positive and negative sequences DISCRETE APPLIED MATHEMATICS. 2007.04; 155 (6-7): 676-685. ( DOI )

Hideo Bannai. Algorithms for string pattern discovery Modeling Decisions for Artificial Intelligence, Proceedings. 2007; 4617 24-29. ( DOI )

Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Simple linear-time off-line text compression by longest-first substitution DCC 2007: DATA COMPRESSION CONFERENCE, PROCEEDINGS. 2007; 123-+. ( DOI )

Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda. Unsupervised spam detection based on string alienness measures DISCOVERY SCIENCE, PROCEEDINGS. 2007; 4755 161-+. ( DOI )

Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Barmai, Masayuki Takeda. Efficient computation of substring equivalence classes with suffix arrays COMBINATORIAL PATTERN MATCHING, PROCEEDINGS. 2007; 4580 340-+. ( DOI )

Yoshio Takei, Akatsuki Kawakoshi, Takehiro Tsukada, Shinya Yuge, Maho Ogoshi, Koji Inoue, Susumu Hyodo, Hideo Bannai, Satoru Miyano. Contribution of comparative fish studies to general endocrinology: structure and function of some osmoregulatory hormones Journal of Experimental Zoology Part A: Comparative Experimental Biology. 2006.09; 305A (9): 787-798. ( DOI )

Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. Reachability on suffix tree graphs. Proceedings of the Prague Stringology Conference, Prague, Czech Republic, August 28-30, 2006. 2006; 212-225.

Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. A new family of string classifiers based on local relatedness DISCOVERY SCIENCE, PROCEEDINGS. 2006; 4265 114-124. ( DOI )

YOSHINORI TAMADA, HIDEO BANNAI, SEIYA IMOTO, TOSHIAKI KATAYAMA, MINORU KANEHISA, SATORU MIYANO. UTILIZING EVOLUTIONARY INFORMATION AND GENE EXPRESSION DATA FOR ESTIMATING GENE NETWORKS WITH BAYESIAN NETWORK MODELS Journal of Bioinformatics and Computational Biology. 2005.12; 03 (06): 1295-1313. ( DOI )

O Hirose, N Nariai, Y Tamada, H Bannai, S Imoto, S Miyano. Estimating gene networks from expression data and binding location data via Boolean networks COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2005, PT 3. 2005; 3482 349-356. ( DOI )

H Bannai, K Hatano, S Inenaga, M Takeda. Practical algorithms for pattern based linear regression DISCOVERY SCIENCE, PROCEEDINGS. 2005; 3735 44-56. ( DOI )

H Bannai, H Hyyro, A Shinohara, M Takeda, K Nakai, S Miyano. An O(N-2) algorithm for discovering optimal boolean pattern pairs IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS. 2004.10; 1 (4): 159-170. ( DOI )

Yoshio Takei, Koji Inoue, Maho Ogoshi, Tetsushi Kawahara, Hideo Bannai, Satoru Miyano. Identification of novel adrenomedullin in mammals: a potent cardiovascular and renal regulator FEBS Letters. 2004.01; 556 (1-3): 53-58. ( DOI )

Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano. Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. J. Bioinformatics and Computational Biology. 2004; 2 (2): 273-288. ( DOI )

H Bannai, H Hyyro, A Shinohara, M Takeda, K Nakai, S Miyano. Finding optimal pairs of patterns ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS. 2004; 3240 450-462. ( DOI )

Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano. Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance Discovery Science. 2004; 32-46. ( DOI )

Y. Tamada, S. Kim, H. Bannai, S. Imoto, K. Tashiro, S. Kuhara, S. Miyano. Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection Bioinformatics. 2003.09; 19 (Suppl 2): ii227-ii236. ( DOI )

Eijiro Sumii, Hideo Bannai. The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation. Journal of Functional and Logic Programming. 2003; 2003

Ott, S., Tamada, Y., Bannai, H., Nakai, K., Miyano, S.. Intrasplicing--analysis of long intron sequences. Pacific Symposium on Biocomputing. 2003; 339-350. ( DOI )

M Takeda, S Inenaga, H Bannai, A Shinohara, S Arikawa. Discovering most classificatory patterns for very expressive pattern classes DISCOVERY SCIENCE, PROCEEDINGS. 2003; 2843 486-493. ( DOI )

Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda. Inferring Strings from Graphs and Arrays Mathematical Foundations of Computer Science 2003. 2003; 208-217. ( DOI )

Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano. A String Pattern Regression Algorithm and Its Application to Pattern Discovery in Long Introns Genome Informatics. 2002.12; 13 3-11. ( DOI )

Osamu Maruyama, Hideo Bannai, Yoshinori Tamada, Satoru Kuhara, Satoru Miyano. Fast algorithm for extracting multiple unordered short motifs using bit operations Information Sciences. 2002.10; 146 (1-4): 115-126. ( DOI )

H. Bannai, Y. Tamada, O. Maruyama, K. Nakai, S. Miyano. Extensive feature detection of N-terminal protein sorting signals Bioinformatics. 2002.02; 18 (2): 298-305. ( DOI )

Eijiro Sumii, Hideo Bannai. VM lambda: A Functional Calculusfor Scientific Discovery. Functional and Logic Programming, 6th International Symposium, FLOPS 2002, Aizu, Japan, September 15-17, 2002, Proceedings. 2002; 290-304. ( DOI )

O Maruyama, H Bannai, Y Tamada, S Kuhara, S Miyano. Fast algorithm for extracting multiple unordered short motifs using bit operations PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES. 2002; 1180-1185.

T Akutsu, H Bannai, S Miyano, S Ott. On the complexity of deriving position specific score matrices from examples COMBINATORIAL PATTERN MATCHING. 2002; 2373 168-177. ( DOI )

S Inenaga, H Bannai, A Shmohara, M Takeda, S Arikawa. Discovering best variable-length-don't-care patterns DISCOVERY SCIENCE, PROCEEDINGS. 2002; 2534 86-97. ( DOI )

S Inenaga, A Shinohara, M Takeda, H Bannai, S Arikawa. Space-economical construction of index structures for all suffixes of a string MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002. 2002; 2420 341-352. ( DOI )

Toru Nakayashiki, Kanae Ebihara, Hideo Bannai, Yoshikazu Nakamura. Yeast [PSI+] “Prions” that Are Crosstransmissible and Susceptible beyond a Species Barrier through a Quasi-Prion State Molecular Cell. 2001.06; 7 (6): 1121-1130. ( DOI )

Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano. Views: Fundamental Building Blocks in the Process of Knowledge Discovery. Proceedings of the Fourteenth International Florida Artificial Intelligence Research Society Conference, May 21-23, 2001, Key West, Florida, USA. 2001; 233-238.

Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano. HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process. Electron. Trans. Artif. Intell.. 2001; 5 (B): 73-83.

Eijiro Sumii, Hideo Bannai. VM lambda: a Functional Calculus for Scientific Discovery. The Second Asian Workshop on Programming Languages and Systems, APLAS'01, Korea Advanced Institute of Science and Technology, Daejeon, Korea, December 17-18, 2001, Proceedings. 2001; 265-275.

Bannai, H., Tamada, Y., Maruyama, O., Miyano, S.. A system for supporting knowledge discovery from genomic data: software library Hypothesis Creator Tanpakushitsu kakusan koso. Protein, nucleic acid, enzyme. 2001; 46 (16 Suppl):

Bannai, H., Tamada, Y., Maruyama, O., Miyano, S.. VML: A View Modeling Language for computational knowledge discovery Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2001; 2226 30-44. ( DOI )

Tomohiro Yasuda, Hideo Bannai, Shuichi Onami, Satoru Miyano, Hiroaki Kitano. Towards Automatic Construction of Cell-Lineage of C. elegans from Nomarski DIC Microscope Images Genome Informatics. 1999.12; 10 144-154. ( DOI )

H Bannai, S Miyano. A definition of discovery in terms of generalized descriptional complexity DISCOVERY SCIENCE, PROCEEDINGS. 1999; 1721 316-318.