Hideo Bannai

292 papers A* 1A 4B 74C 45Misc 22Journal 137Unranked 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
Online Computation of Palindromes and Suffix Trees on Tries.
CoRR
Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno, Masakazu Ishihata, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2026 J jnl
Sensitivity of Repetitiveness Measures to String Reversal.
CoRR
Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina
2026 J jnl
The Smallest String Attractors of Fibonacci and Period-Doubling Words.
CoRR
Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Köppl, Takuya Mieno, Yoshio Okamoto
2025 — conf
A Survey of the Bijective Burrows-Wheeler Transform.
The Expanding World of Compressed Data
Hideo Bannai, Dominik Köppl, Zsuzsanna Lipták
2025 J jnl
Computing maximal palindromes in non-standard matching models.
Inf. Comput.
Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2025 C conf
Counting Distinct (Non-)crossing Substrings.
SPIRE
Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2025 J jnl
Counting distinct (non-)crossing substrings.
CoRR
Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2025 C conf
Nyldon Factorization of Thue-Morse Words and Fibonacci Words.
SPIRE
Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2025 J jnl
Nyldon Factorization of Thue-Morse Words and Fibonacci Words.
CoRR
Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2025 B conf
On the Compressiveness of the Burrows-Wheeler Transform.
CPM
Hideo Bannai, Tomohiro I, Yuto Nakashima
2025 B conf
Text Indexing for Simple Regular Expressions.
CPM
Hideo Bannai, Philip Bille, Inge Li Gørtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow
2024 C conf
Bijective BWT Based Compression Schemes.
SPIRE
Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
2024 J jnl
Bijective BWT based compression schemes.
CoRR
Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
2024 J jnl
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences.
Algorithmica
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
2024 C conf
Computing Maximal Palindromes in Non-standard Matching Models.
IWOCA
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2024 J jnl
Constructing and indexing the bijective and extended Burrows-Wheeler transform.
Inf. Comput.
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
2024 B conf
Edit and Alphabet-Ordering Sensitivity of Lex-Parse.
MFCS
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
2024 J jnl
Edit and Alphabet-Ordering Sensitivity of Lex-parse.
CoRR
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
2024 J jnl
Faster space-efficient STR-IC-LCS computation.
Theor. Comput. Sci.
Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2024 A conf
Height-Bounded Lempel-Ziv Encodings.
ESA
Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi
2024 J jnl
Height-bounded Lempel-Ziv encodings.
CoRR
Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi
2024 B conf
Maintaining the Size of LZ77 on Semi-Dynamic Strings.
CPM
Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski
2024 J jnl
NP-Completeness for the Space-Optimality of Double-Array Tries.
CoRR
Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl
2024 B conf
On the Hardness of Smallest RLSLPs and Collage Systems.
DCC
Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai
2024 C conf
On the Number of Non-equivalent Parameterized Squares in a String.
SPIRE
Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2024 J jnl
On the Number of Non-equivalent Parameterized Squares in a String.
CoRR
Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2024 J jnl
On the compressiveness of the Burrows-Wheeler transform.
CoRR
Hideo Bannai, Tomohiro I, Yuto Nakashima
2024 J jnl
Pfp-fm: an accelerated FM-index.
Algorithms Mol. Biol.
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
2023 C conf
Acceleration of FM-Index Queries Through Prefix-Free Parsing.
WABI
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
2023 J jnl
Acceleration of FM-index Queries Through Prefix-free Parsing.
CoRR
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
2023 C conf
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings.
SPIRE
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2023 J jnl
Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets.
CoRR
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2023 J jnl
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets.
Theor. Comput. Sci.
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2023 J jnl
Linear-time computation of generalized minimal absent words for multiple strings.
CoRR
Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2023 J jnl
Longest bordered and periodic subsequences.
Inf. Process. Lett.
Hideo Bannai, Tomohiro I, Dominik Köppl
2023 A conf
Lyndon Arrays in Sublinear Time.
ESA
Hideo Bannai, Jonas Ellert
2023 B conf
Optimal LZ-End Parsing Is Hard.
CPM
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023 J jnl
Optimal LZ-End Parsing is Hard.
CoRR
Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno
2023 J jnl
Sliding suffix trees simplified.
CoRR
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2023 B conf
Space-Efficient STR-IC-LCS Computation.
SOFSEM
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2022 B ed.
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, Prague, Czech Republic, June 27-29, 2022
CPM
Hideo Bannai, Jan Holub
2022 J jnl
Combinatorics of minimal absent words for a sliding window.
Theor. Comput. Sci.
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 C conf
Computing Longest (Common) Lyndon Subsequences.
IWOCA
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
2022 J jnl
Computing Longest (Common) Lyndon Subsequences.
CoRR
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
2022 J jnl
Computing Minimal Unique Substrings for a Sliding Window.
Algorithmica
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 A conf
Computing NP-Hard Repetitiveness Measures via MAX-SAT.
ESA
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto
2022 J jnl
Computing NP-hard Repetitiveness Measures via MAX-SAT.
CoRR
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto
2022 J jnl
Computing maximal generalized palindromes.
CoRR
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Factorizing Strings into Repetitions.
Theory Comput. Syst.
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Longest (Sub-)Periodic Subsequence.
CoRR
Hideo Bannai, Tomohiro I, Dominik Köppl
2022 C conf
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions.
SPIRE
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2022 J jnl
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions.
CoRR
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno
2022 J jnl
Order-preserving pattern matching indeterminate strings.
Inf. Comput.
Luís M. S. Russo, Diogo M. Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco
2022 J jnl
Palindromic trees for a sliding window and its applications.
Inf. Process. Lett.
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches.
Theor. Comput. Sci.
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2022 J jnl
Space-Efficient STR-IC-LCS Computation.
CoRR
Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai
2022 J jnl
c-trie++: A dynamic trie tailored for fast prefix searches.
Inf. Comput.
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 C conf
A Separation of γ and b via Thue-Morse Words.
SPIRE
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
2021 J jnl
A Separation of γ and b via Thue-Morse Words.
CoRR
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
2021 J jnl
Combinatorics of minimal absent words for a sliding window.
CoRR
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Compressed Communication Complexity of Hamming Distance.
Algorithms
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Compressed Communication Complexity of Hamming Distance.
CoRR
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Computing longest palindromic substring after single-character or block-wise edits.
Theor. Comput. Sci.
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 B conf
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time.
CPM
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
2021 J jnl
Efficiently computing runs on a trie.
Theor. Comput. Sci.
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Grammar Index By Induced Suffix Sorting.
CoRR
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 C conf
Grammar Index by Induced Suffix Sorting.
SPIRE
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 C conf
Longest Common Rollercoasters.
SPIRE
Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Longest previous overlapping factor array.
Inf. Process. Lett.
Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar
2021 B conf
Repetitions in Strings: A "Constant" Problem (Invited Talk).
CPM
Hideo Bannai
2021 C conf
The Parameterized Suffix Tray.
CIAC
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
The Smallest Grammar Problem Revisited.
IEEE Trans. Inf. Theory
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
2020 J jnl
Computing Palindromic Trees for a Sliding Window and Its Applications.
CoRR
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 B conf
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.
CPM
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020 J jnl
DAWGs for parameterized matching: online construction and related indexing structures.
CoRR
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020 B conf
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.
CPM
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020 J jnl
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.
CoRR
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020 J jnl
Dynamic index and LZ factorization in compressed space.
Discret. Appl. Math.
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings.
Theory Comput. Syst.
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 B conf
Faster STR-EC-LCS Computation.
SOFSEM
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Faster STR-EC-LCS Computation.
CoRR
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Finding all maximal perfect haplotype blocks in linear time.
Algorithms Mol. Biol.
Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye
2020 J jnl
Grammar-compressed Self-index with Lyndon Words.
CoRR
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 C conf
Longest Square Subsequence Problem Revisited.
SPIRE
Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
2020 J jnl
Longest Square Subsequence Problem Revisited.
CoRR
Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai
2020 C conf
Lyndon Words, the Three Squares Lemma, and Primitive Squares.
SPIRE
Hideo Bannai, Takuya Mieno, Yuto Nakashima
2020 J jnl
Lyndon Words, the Three Squares Lemma, and Primitive Squares.
CoRR
Hideo Bannai, Takuya Mieno, Yuto Nakashima
2020 B conf
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
SOFSEM
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
More Time-Space Tradeoffs for Finding a Shortest Unique Substring.
Algorithms
Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo
2020 C conf
On Repetitiveness Measures of Thue-Morse Words.
SPIRE
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
On repetitiveness measures of Thue-Morse words.
CoRR
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Practical Grammar Compression Based on Maximal Repeats.
Algorithms
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
2020 J jnl
Refining the
Theor. Comput. Sci.
Hideo Bannai, Travis Gagie, Tomohiro I
2020 J jnl
Space-efficient algorithms for computing minimal/shortest unique substrings.
Theor. Comput. Sci.
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
The Parameterized Suffix Tray.
CoRR
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 C conf
Towards Efficient Interactive Computation of Dynamic Time Warping Distance.
SPIRE
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Towards Efficient Interactive Computation of Dynamic Time Warping Distance.
CoRR
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 B conf
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches.
DCC
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 B conf
An Improved Data Structure for Left-Right Maximal Generic Words Problem.
ISAAC
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
Compact Data Structures for Shortest Unique Substring Queries.
SPIRE
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Compact Data Structures for Shortest Unique Substring Queries.
CoRR
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 Misc conf
Computing Maximal Palindromes and Distinct Palindromes in a Trie.
PSC
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 B conf
Computing Runs on a Trie.
CPM
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Computing runs on a trie.
CoRR
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Constructing the Bijective BWT.
CoRR
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
2019 C conf
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.
SPIRE
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.
CoRR
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Dynamic Packed Compact Tries Revisited.
CoRR
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 B conf
Faster Queries for Longest Substring Palindrome After Block Edit.
CPM
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Faster queries for longest substring palindrome after block edit.
CoRR
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
Finding All Maximal Perfect Haplotype Blocks in Linear Time.
WABI
Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye
2019 B conf
Indexing the Bijective BWT.
CPM
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
2019 B conf
MR-RePair: Grammar Compression Based on Maximal Repeats.
DCC
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
2019 J jnl
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
CoRR
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
On Longest Common Property Preserved Substring Queries.
SPIRE
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019 J jnl
On Longest Common Property Preserved Substring Queries.
CoRR
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019 B conf
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations.
CPM
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
On the size of the smallest alphabet for Lyndon trees.
Theor. Comput. Sci.
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Order-Preserving Pattern Matching Indeterminate Strings.
CoRR
Diogo M. Costa, Luís M. S. Russo, Rui Henriques, Hideo Bannai, Alexandre P. Francisco
2019 C conf
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.
IWOCA
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.
CoRR
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
The Parameterized Position Heap of a Trie.
CIAC
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
The Parameterized Position Heap of a Trie.
CoRR
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
The smallest grammar problem revisited.
CoRR
Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh
2018 J jnl
Algorithms and combinatorial properties on shortest unique palindromic substrings.
J. Discrete Algorithms
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 C conf
Block Palindromes: A New Generalization of Palindromes.
SPIRE
Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
2018 J jnl
Block Palindromes: A New Generalization of Palindromes.
CoRR
Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga
2018 B conf
Computing longest common square subsequences.
CPM
Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda
2018 J jnl
Diverse Palindromic Factorization is NP-Complete.
Int. J. Found. Comput. Sci.
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto
2018 B conf
Faster Online Elastic Degenerate String Matching.
CPM
Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 B conf
Longest Lyndon Substring After Edit.
CPM
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 B conf
Longest substring palindrome after edit.
CPM
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 B conf
Lyndon Factorization of Grammar Compressed Texts Revisited.
CPM
Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 J jnl
MR-RePair: Grammar Compression based on Maximal Repeats.
CoRR
Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida
2018 Misc conf
O(n log n)-time Text Compression by LZ-style Longest First Substitution.
PSC
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 J jnl
O(n log n)-time text compression by LZ-style longest first substitution.
CoRR
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 B conf
Online LZ77 Parsing and Matching Statistics with RLBWTs.
CPM
Hideo Bannai, Travis Gagie, Tomohiro I
2018 J jnl
Online LZ77 Parsing and Matching Statistics with RLBWTs.
CoRR
Hideo Bannai, Travis Gagie, Tomohiro I
2018 B conf
Order-Preserving Pattern Matching Indeterminate Strings.
CPM
Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai
2018 C conf
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.
SPIRE
Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 Misc conf
Right-to-left Online Construction of Parameterized Position Heaps.
PSC
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 J jnl
Right-to-left online construction of parameterized position heaps.
CoRR
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings.
ISAAC
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 C conf
Computing Abelian String Regularities Based on RLE.
IWOCA
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Computing Abelian regularities on RLE strings.
CoRR
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Computing All Distinct Squares in Linear Time for Integer Alphabets.
CPM
Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
2017 J jnl
Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
Algorithmica
Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Faster STR-IC-LCS Computation via RLE.
CPM
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Faster STR-IC-LCS computation via RLE.
CoRR
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Inferring strings from Lyndon factorization.
Theor. Comput. Sci.
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.
SOFSEM
Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara
2017 Misc conf
On Reverse Engineering the Lyndon Tree.
PSC
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 C conf
Order Preserving Pattern Matching on Trees and DAGs.
SPIRE
Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Order preserving pattern matching on trees and DAGs.
CoRR
Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 C conf
Shortest Unique Palindromic Substring Queries in Optimal Time.
IWOCA
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Small-Space LCE Data Structure with Constant-Time Queries.
MFCS
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2017 J jnl
Small-space encoding LCE data structure with constant-time queries.
CoRR
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2017 J jnl
The "Runs" Theorem.
SIAM J. Comput.
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2017 B conf
Tight Bounds on the Maximum Number of Shortest Unique Substrings.
CPM
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Closed factorization.
Discret. Appl. Math.
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
2016 J jnl
Computing All Distinct Squares in Linear Time for Integer Alphabets.
CoRR
Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
2016 B conf
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets.
MFCS
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 Misc conf
Computing Smallest and Largest Repetition Factorizations in
PSC
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 B conf
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.
CPM
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
2016 J jnl
Deterministic sub-linear space LCE data structures with efficient construction.
CoRR
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
2016 Misc conf
Dynamic Index and LZ Factorization in Compressed Space.
PSC
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Dynamic index and LZ factorization in compressed space.
CoRR
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 B conf
Factorizing a String into Squares in Linear Time.
CPM
Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea
2016 J jnl
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.
Theor. Comput. Sci.
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 C conf
Finding Gapped Palindromes Online.
IWOCA
Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 B conf
Fully Dynamic Data Structure for LCE Queries in Compressed Space.
MFCS
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Fully dynamic data structure for LCE queries in compressed space.
CoRR
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Generalized pattern matching and periodicity under substring consistent equivalence relations.
Theor. Comput. Sci.
Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 — ch.
Grammar Compression.
Encyclopedia of Algorithms
Hideo Bannai
2016 J jnl
Longest Common Subsequence in at Least k Length Order-isomorphic Substrings.
CoRR
Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara
2016 B conf
Shortest Unique Substring Queries on Run-Length Encoded Strings.
MFCS
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Shortest unique palindromic substring queries in optimal time.
CoRR
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Tight bound on the maximum number of shortest unique substrings.
CoRR
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 C conf
A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.
SPIRE
Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 A* conf
A new characterization of maximal repetitions by Lyndon trees.
SODA
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2015 C conf
An Opportunistic Text Indexing Structure Based on Run Length Encoding.
CIAC
Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Compressed automata for dictionary matching.
Theor. Comput. Sci.
Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 Misc conf
Computing Left-Right Maximal Generic Words.
PSC
Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets.
CoRR
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Constructing LZ78 tries and position heaps in linear time for large alphabets.
Inf. Process. Lett.
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Detecting regularities on grammar-compressed strings.
Inf. Comput.
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2015 C conf
Diverse Palindromic Factorization Is NP-complete.
DLT
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
2015 J jnl
Dynamic index, LZ factorization, and LCE queries in compressed space.
CoRR
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Editorial.
J. Discrete Algorithms
Hideo Bannai, Solon P. Pissis
2015 C conf
Efficient Algorithms for Longest Closed Factor Array.
SPIRE
Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen
2015 B conf
Inferring Strings from Full Abelian Periods.
ISAAC
Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 B conf
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding.
CPM
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2015 B conf
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree.
CPM
Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 J jnl
A new characterization of maximal repetitions by Lyndon trees.
CoRR
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2014 Misc conf
Closed Factorization.
PSC
Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto
2014 Misc conf
Computing Abelian Covers and Abelian Runs.
PSC
Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 B conf
Computing Palindromic Factorizations and Palindromic Covers On-line.
CPM
Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 A conf
Faster Compact On-Line Lempel-Ziv Factorization.
STACS
Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2014 — conf
Inferring Strings from Lyndon Factorization.
MFCS (2)
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 J jnl
Inferring strings from suffix trees and links on a binary alphabet.
Discret. Appl. Math.
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 J jnl
On the existence of tight relative 2-designs on binary Hamming association schemes.
Discret. Math.
Eiichi Bannai, Etsuko Bannai, Hideo Bannai
2014 B conf
Shortest Unique Substrings Queries in Optimal Time.
SOFSEM
Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 B conf
Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets.
DCC
Keisuke Goto, Hideo Bannai
2013 C conf
Compressed Automata for Dictionary Matching.
CIAA
Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 B conf
Computing Convolution on Grammar-Compressed Text.
DCC
Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 Misc conf
Computing Reversed Lempel-Ziv Factorization Online.
PSC
Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 J jnl
Computing convolution on grammar-compressed text
CoRR
Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 B conf
Converting SLP to LZ78 in almost Linear Time.
CPM
Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda
2013 B conf
Detecting Regularities on Grammar-Compressed Strings.
MFCS
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013 J jnl
Detecting regularities on grammar-compressed strings
CoRR
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013 B conf
Efficient Lyndon Factorization of Grammar Compressed Text.
CPM
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 J jnl
Efficient Lyndon factorization of grammar compressed text
CoRR
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 J jnl
Fast q-gram mining on SLP compressed strings.
J. Discrete Algorithms
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2013 J jnl
Faster Compact On-Line Lempel-Ziv Factorization
CoRR
Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2013 C conf
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text.
SPIRE
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 B conf
From Run Length Encoding to LZ78 and Back Again.
DCC
Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 B conf
Permuted Pattern Matching on Multi-track Strings.
SOFSEM
Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga
2013 B conf
Simpler and Faster Lempel Ziv Factorization.
DCC
Keisuke Goto, Hideo Bannai
2013 J jnl
Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets.
CoRR
Keisuke Goto, Hideo Bannai
2012 J jnl
An efficient algorithm to test square-freeness of strings compressed by straight-line programs.
Inf. Process. Lett.
Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein
2012 B conf
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts.
SOFSEM
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 C conf
Eager XPath Evaluation over XML Streams.
SPIRE
Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda
2012 C conf
Efficient LZ78 Factorization of Grammar Compressed Text.
SPIRE
Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 J jnl
Efficient LZ78 factorization of grammar compressed text
CoRR
Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 J jnl
Finding Characteristic Substrings from Compressed Texts.
Int. J. Found. Comput. Sci.
Shunsuke Inenaga, Hideo Bannai
2012 — conf
General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.
ECML/PKDD (2)
Tomohiro I, Yuki Enokuma, Hideo Bannai, Masayuki Takeda
2012 — conf
Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions.
ISMIR
Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, Ken Satoh
2012 J jnl
Simpler and Faster Lempel Ziv Factorization
CoRR
Keisuke Goto, Hideo Bannai
2012 B conf
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts.
CPM
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 J jnl
Speeding-up $q$-gram mining on grammar-based compressed texts
CoRR
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 C conf
The Position Heap of a Trie.
SPIRE
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2012 J jnl
Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding
CoRR
Jun-ichi Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 Misc conf
Computing Longest Common Substring/Subsequence of Non-linear Texts.
PSC
Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2011 J jnl
Computing q-gram Frequencies on Collage Systems
CoRR
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 J jnl
Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts
CoRR
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 Misc conf
Efficient Eager XPath Filtering over XML Streams.
PSC
Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda
2011 J jnl
Fast $q$-gram Mining on SLP Compressed Strings
CoRR
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 C conf
Fast q-gram Mining on SLP Compressed Strings.
SPIRE
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 B conf
Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts.
CPM
Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 Misc conf
Inferring Strings from Suffix Trees and Links on a Binary Alphabet.
PSC
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2011 — conf
Music Genre Classification using Similarity Functions.
ISMIR
Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda
2011 J jnl
Restructuring Compressed Texts without Explicit Decompression
CoRR
Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda
2011 J jnl
Verifying and enumerating parameterized border arrays.
Theor. Comput. Sci.
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2010 C conf
Counting and Verifying Maximal Palindromes.
SPIRE
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2010 B conf
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting.
Discovery Science
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda
2010 Misc conf
The Number of Runs in a Ternary Word.
PSC
Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson
2010 B conf
Verifying a Parameterized Border Array in
CPM
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2009 C conf
A Series of Run-Rich Strings.
LATA
Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
2009 B conf
Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality.
Discovery Science
Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano
2009 Misc conf
Bit-parallel Algorithms for Computing all the Runs in a String.
PSC
Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
2009 C conf
Counting Parameterized Border Arrays for a Binary Alphabet.
LATA
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2009 Misc conf
Finding Characteristic Substrings from Compressed Texts.
PSC
Shunsuke Inenaga, Hideo Bannai
2009 C conf
Lightweight Parameterized Suffix Array Construction.
IWOCA
Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2009 J jnl
Linear-Time Text Compression by Longest-First Substitution.
Algorithms
Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
2008 J jnl
New Lower Bounds for the Maximum Number of Runs in a String
CoRR
Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Hideo Bannai, Ayumi Shinohara
2008 Misc conf
New Lower Bounds for the Maximum Number of Runs in a String.
PSC
Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara
2008 Misc conf
Parameterized Suffix Arrays for Binary Strings.
PSC
Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2008 J jnl
Reachability on Suffix Tree Graphs.
Int. J. Found. Comput. Sci.
Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2008 B conf
String Kernels Based on Variable-Length-Don't-Care Patterns.
Discovery Science
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
2008 J jnl
Uniqueness of certain association schemes.
Eur. J. Comb.
Eiichi Bannai, Etsuko Bannai, Hideo Bannai
2007 B conf
Algorithms for String Pattern Discovery.
MDAI
Hideo Bannai
2007 B conf
Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
CPM
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2007 J jnl
On the complexity of deriving position specific score matrices from positive and negative sequences.
Discret. Appl. Math.
Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
2007 B conf
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution.
DCC
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2007 B conf
Unsupervised Spam Detection Based on String Alienness Measures.
Discovery Science
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda
2006 B conf
A New Family of String Classifiers Based on Local Relatedness.
Discovery Science
Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2006 Misc conf
Reachability on suffix tree graphs.
PSC
Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2005 — conf
Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks.
ICCSA (3)
Osamu Hirose, Naoki Nariai, Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Satoru Miyano
2005 B conf
Practical Algorithms for Pattern Based Linear Regression.
Discovery Science
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
2005 J jnl
Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models.
J. Bioinform. Comput. Biol.
Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Toshiaki Katayama, Minoru Kanehisa, Satoru Miyano
2004 J jnl
An O(N
IEEE ACM Trans. Comput. Biol. Bioinform.
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004 J jnl
Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.
J. Bioinform. Comput. Biol.
Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano
2004 B conf
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
Discovery Science
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004 C conf
Finding Optimal Pairs of Patterns.
WABI
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2003 B conf
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.
Discovery Science
Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa
2003 C conf
Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection.
ECCB
Yoshinori Tamada, Sunyong Kim, Hideo Bannai, Seiya Imoto, Kousuke Tashiro, Satoru Kuhara, Satoru Miyano
2003 B conf
Inferring Strings from Graphs and Arrays.
MFCS
Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2003 Misc conf
Intrasplicing - Analysis of Long Intron Sequences.
Pacific Symposium on Biocomputing
Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano
2003 J jnl
The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation.
J. Funct. Log. Program.
Eijiro Sumii, Hideo Bannai
2002 B conf
Discovering Best Variable-Length-Don't-Care Patterns.
Discovery Science
Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2002 J jnl
Extensive feature detection of N-terminal protein sorting signals.
Bioinform.
Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano
2002 — conf
Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations.
JCIS
Osamu Maruyama, Satoru Kuhara, Hideo Bannai, Satoru Miyano, Yoshinori Tamada
2002 J jnl
Fast algorithm for extracting multiple unordered short motifs using bit operations.
Inf. Sci.
Osamu Maruyama, Hideo Bannai, Yoshinori Tamada, Satoru Kuhara, Satoru Miyano
2002 — conf
Foundations of Designing Computational Knowledge Discovery Processes.
Progress in Discovery Science
Yoshinori Tamada, Hideo Bannai, Osamu Maruyama, Satoru Miyano
2002 B conf
On the Complexity of Deriving Position Specific Score Matrices from Examples.
CPM
Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott
2002 B conf
Space-Economical Construction of Index Structures for All Suffixes of a String.
MFCS
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
2002 Misc conf
VM lambda: A Functional Calculusfor Scientific Discovery.
FLOPS
Eijiro Sumii, Hideo Bannai
2001 J jnl
HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process.
Electron. Trans. Artif. Intell.
Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano
2001 B conf
VM lambda: a Functional Calculus for Scientific Discovery.
APLAS
Eijiro Sumii, Hideo Bannai
2001 B conf
VML: A View Modeling Language for Computational Knowledge Discovery.
Discovery Science
Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano
2001 Misc conf
Views: Fundamental Building Blocks in the Process of Knowledge Discovery.
FLAIRS
Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano
1999 B conf
A Definition of Discovery in Terms of Generalized Descriptional Complexity.
Discovery Science
Hideo Bannai, Satoru Miyano