default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHideo Bannai
Person information
SPARQL queries 
🛈 Please note that only 67% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j55]Hideo Bannai
, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86(3): 735-756 (2024)- [j54]Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie:
Pfp-fm: an accelerated FM-index. Algorithms Mol. Biol. 19(1): 15 (2024) - [j53]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297: 105153 (2024) - [j52]Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Faster space-efficient STR-IC-LCS computation. Theor. Comput. Sci. 1003: 114607 (2024) - [c149]Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski:
Maintaining the Size of LZ77 on Semi-Dynamic Strings. CPM 2024: 3:1-3:20 - [c148]Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai:
On the Hardness of Smallest RLSLPs and Collage Systems. DCC 2024: 243-252 - [c147]Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi:
Height-Bounded Lempel-Ziv Encodings. ESA 2024: 18:1-18:18 - [c146]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA 2024: 165-179 - [c145]Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai:
Edit and Alphabet-Ordering Sensitivity of Lex-Parse. MFCS 2024: 75:1-75:15 - [c144]Golnaz Badkobeh, Hideo Bannai, Dominik Köppl:
Bijective BWT Based Compression Schemes. SPIRE 2024: 16-25 - [c143]Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
On the Number of Non-equivalent Parameterized Squares in a String. SPIRE 2024: 174-183 - [i75]Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai:
Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR abs/2402.19223 (2024) - [i74]Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl:
NP-Completeness for the Space-Optimality of Double-Array Tries. CoRR abs/2403.04951 (2024) - [i73]Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi:
Height-bounded Lempel-Ziv encodings. CoRR abs/2403.08209 (2024) - [i72]Golnaz Badkobeh, Hideo Bannai, Dominik Köppl:
Bijective BWT based compression schemes. CoRR abs/2406.16475 (2024) - [i71]Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
On the Number of Non-equivalent Parameterized Squares in a String. CoRR abs/2408.04920 (2024) - 2023
- [j51]Hideo Bannai, Tomohiro I, Dominik Köppl:
Longest bordered and periodic subsequences. Inf. Process. Lett. 182: 106398 (2023) - [j50]Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theor. Comput. Sci. 973: 114093 (2023) - [c142]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing Is Hard. CPM 2023: 3:1-3:11 - [c141]Hideo Bannai, Jonas Ellert:
Lyndon Arrays in Sublinear Time. ESA 2023: 14:1-14:16 - [c140]Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Space-Efficient STR-IC-LCS Computation. SOFSEM 2023: 372-384 - [c139]Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. SPIRE 2023: 331-344 - [c138]Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie:
Acceleration of FM-Index Queries Through Prefix-Free Parsing. WABI 2023: 13:1-13:16 - [i70]Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno:
Optimal LZ-End Parsing is Hard. CoRR abs/2302.02586 (2023) - [i69]Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie:
Acceleration of FM-index Queries Through Prefix-free Parsing. CoRR abs/2305.05893 (2023) - [i68]Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Sliding suffix trees simplified. CoRR abs/2307.01412 (2023) - [i67]Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets. CoRR abs/2307.01428 (2023) - [i66]Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Linear-time computation of generalized minimal absent words for multiple strings. CoRR abs/2307.01967 (2023) - 2022
- [j49]Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Minimal Unique Substrings for a Sliding Window. Algorithmica 84(3): 670-693 (2022) - [j48]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. Inf. Comput. 285(Part): 104794 (2022) - [j47]Luís M. S. Russo, Diogo M. Costa, Rui Henriques, Hideo Bannai, Alexandre P. Francisco:
Order-preserving pattern matching indeterminate strings. Inf. Comput. 289(Part): 104924 (2022) - [j46]Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Palindromic trees for a sliding window and its applications. Inf. Process. Lett. 173: 106174 (2022) - [j45]Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Factorizing Strings into Repetitions. Theory Comput. Syst. 66(2): 484-501 (2022) - [j44]Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Combinatorics of minimal absent words for a sliding window. Theor. Comput. Sci. 927: 109-119 (2022) - [j43]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. Theor. Comput. Sci. 933: 21-42 (2022) - [c137]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto:
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA 2022: 12:1-12:16 - [c136]Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest (Common) Lyndon Subsequences. IWOCA 2022: 128-142 - [c135]Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. SPIRE 2022: 24-37 - [e1]Hideo Bannai, Jan Holub:
33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic. LIPIcs 223, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-234-1 [contents] - [i65]Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest (Common) Lyndon Subsequences. CoRR abs/2201.06773 (2022) - [i64]Hideo Bannai, Tomohiro I, Dominik Köppl:
Longest (Sub-)Periodic Subsequence. CoRR abs/2202.07189 (2022) - [i63]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto:
Computing NP-hard Repetitiveness Measures via MAX-SAT. CoRR abs/2207.02571 (2022) - [i62]Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Online algorithms for finding distinct substrings with length and multiple prefix and suffix conditions. CoRR abs/2207.04194 (2022) - [i61]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing maximal generalized palindromes. CoRR abs/2210.02067 (2022) - [i60]Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Space-Efficient STR-IC-LCS Computation. CoRR abs/2210.07979 (2022) - 2021
- [j42]Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Communication Complexity of Hamming Distance. Algorithms 14(4): 116 (2021) - [j41]Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar:
Longest previous overlapping factor array. Inf. Process. Lett. 168: 106097 (2021) - [j40]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing longest palindromic substring after single-character or block-wise edits. Theor. Comput. Sci. 859: 116-133 (2021) - [j39]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficiently computing runs on a trie. Theor. Comput. Sci. 887: 143-151 (2021) - [j38]Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh:
The Smallest Grammar Problem Revisited. IEEE Trans. Inf. Theory 67(1): 317-328 (2021) - [c134]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Suffix Tray. CIAC 2021: 258-270 - [c133]Hideo Bannai:
Repetitions in Strings: A "Constant" Problem (Invited Talk). CPM 2021: 1:1-1:1 - [c132]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM 2021: 7:1-7:16 - [c131]Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Common Rollercoasters. SPIRE 2021: 21-32 - [c130]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index by Induced Suffix Sorting. SPIRE 2021: 85-99 - [c129]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. SPIRE 2021: 167-178 - [i59]Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Communication Complexity of Hamming Distance. CoRR abs/2103.03468 (2021) - [i58]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. CoRR abs/2104.09985 (2021) - [i57]Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Combinatorics of minimal absent words for a sliding window. CoRR abs/2105.08496 (2021) - [i56]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index By Induced Suffix Sorting. CoRR abs/2105.13744 (2021) - 2020
- [j37]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13(4): 103 (2020) - [j36]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 13(9): 234 (2020) - [j35]Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye:
Finding all maximal perfect haplotype blocks in linear time. Algorithms Mol. Biol. 15(1): 2 (2020) - [j34]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index and LZ factorization in compressed space. Discret. Appl. Math. 274: 116-129 (2020) - [j33]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 Comput. Syst. 64(7): 1273-1291 (2020) - [j32]Hideo Bannai, Travis Gagie, Tomohiro I:
Refining the r-index. Theor. Comput. Sci. 812: 96-108 (2020) - [j31]Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. 845: 230-242 (2020) - [c128]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara:
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CPM 2020: 12:1-12:11 - [c127]Katsuhito Nakashima, Noriki 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. CPM 2020: 26:1-26:14 - [c126]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. DCC 2020: 243-252 - [c125]Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. SOFSEM 2020: 125-135 - [c124]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: 148-160 - [c123]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE 2020: 27-41 - [c122]Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai:
Longest Square Subsequence Problem Revisited. SPIRE 2020: 147-154 - [c121]Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On Repetitiveness Measures of Thue-Morse Words. SPIRE 2020: 213-220 - [c120]Hideo Bannai, Takuya Mieno, Yuto Nakashima:
Lyndon Words, the Three Squares Lemma, and Primitive Squares. SPIRE 2020: 265-273 - [i55]Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. CoRR abs/2001.05671 (2020) - [i54]Katsuhito Nakashima, Noriki 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. CoRR abs/2002.06786 (2020) - [i53]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara:
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. CoRR abs/2002.06796 (2020) - [i52]Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar-compressed Self-index with Lyndon Words. CoRR abs/2004.05309 (2020) - [i51]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR abs/2005.08190 (2020) - [i50]Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On repetitiveness measures of Thue-Morse words. CoRR abs/2005.09524 (2020) - [i49]Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai:
Longest Square Subsequence Problem Revisited. CoRR abs/2006.00216 (2020) - [i48]Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Trees for a Sliding Window and Its Applications. CoRR abs/2006.02134 (2020) - [i47]Hideo Bannai, Takuya Mieno, Yuto Nakashima:
Lyndon Words, the Three Squares Lemma, and Primitive Squares. CoRR abs/2006.13576 (2020) - [i46]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Suffix Tray. CoRR abs/2012.10092 (2020)
2010 – 2019
- 2019
- [j30]Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On the size of the smallest alphabet for Lyndon trees. Theor. Comput. Sci. 792: 131-143 (2019) - [c119]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. CIAC 2019: 237-248 - [c118]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Indexing the Bijective BWT. CPM 2019: 17:1-17:14 - [c117]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Runs on a Trie. CPM 2019: 23:1-23:11 - [c116]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Queries for Longest Substring Palindrome After Block Edit. CPM 2019: 27:1-27:13 - [c115]Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. CPM 2019: 29:1-29:11 - [c114]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression Based on Maximal Repeats. DCC 2019: 508-517 - [c113]Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
An Improved Data Structure for Left-Right Maximal Generic Words Problem. ISAAC 2019: 40:1-40:12 - [c112]Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. IWOCA 2019: 430-441 - [c111]Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compact Data Structures for Shortest Unique Substring Queries. SPIRE 2019: 107-123 - [c110]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. SPIRE 2019: 162-174 - [c109]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. SPIRE 2019: 382-391 - [c108]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes and Distinct Palindromes in a Trie. Stringology 2019: 3-15 - [c107]Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto:
k-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology 2019: 29-40 - [c106]Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye:
Finding All Maximal Perfect Haplotype Blocks in Linear Time. WABI 2019: 8:1-8:9 - [i45]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing runs on a trie. CoRR abs/1901.10633 (2019) - [i44]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster queries for longest substring palindrome after block edit. CoRR abs/1901.10722 (2019) - [i43]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. CoRR abs/1903.06289 (2019) - [i42]Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. CoRR abs/1903.06290 (2019) - [i41]Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Packed Compact Tries Revisited. CoRR abs/1904.07467 (2019) - [i40]Diogo M. Costa, Luís M. S. Russo, Rui Henriques, Hideo Bannai, Alexandre P. Francisco:
Order-Preserving Pattern Matching Indeterminate Strings. CoRR abs/1905.02589 (2019) - [i39]Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compact Data Structures for Shortest Unique Substring Queries. CoRR abs/1905.12854 (2019) - [i38]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. CoRR abs/1906.00563 (2019) - [i37]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. CoRR abs/1906.05486 (2019) - [i36]Hideo Bannai, Momoko Hirayama, Danny Hucke, Shunsuke Inenaga, Artur Jez, Markus Lohrey, Carl Philipp Reh:
The smallest grammar problem revisited. CoRR abs/1908.06428 (2019) - [i35]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. CoRR abs/1909.02804 (2019) - [i34]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Constructing the Bijective BWT. CoRR abs/1911.06985 (2019) - 2018
- [j29]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. 29(2): 143-164 (2018) - [j28]Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Algorithms and combinatorial properties on shortest unique palindromic substrings. J. Discrete Algorithms 52-53: 122-132 (2018) - [c105]Rui Henriques, Alexandre P. Francisco, Luís M. S. Russo, Hideo Bannai:
Order-Preserving Pattern Matching Indeterminate Strings. CPM 2018: 2:1-2:15 - [c104]Hideo Bannai, Travis Gagie, Tomohiro I:
Online LZ77 Parsing and Matching Statistics with RLBWTs. CPM 2018: 7:1-7:12 - [c103]Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Online Elastic Degenerate String Matching. CPM 2018: 9:1-9:10 - [c102]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest substring palindrome after edit. CPM 2018: 12:1-12:14 - [c101]Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda:
Computing longest common square subsequences. CPM 2018: 15:1-15:13 - [c100]Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Lyndon Substring After Edit. CPM 2018: 19:1-19:10 - [c99]Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Lyndon Factorization of Grammar Compressed Texts Revisited. CPM 2018: 24:1-24:10 - [c98]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. SPIRE 2018: 183-190 - [c97]Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. SPIRE 2018: 254-267 - [c96]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
O(n log n)-time Text Compression by LZ-style Longest First Substitution. Stringology 2018: 12-26 - [c95]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left Online Construction of Parameterized Position Heaps. Stringology 2018: 91-102 - [i33]Hideo Bannai, Travis Gagie, Tomohiro I:
Online LZ77 Parsing and Matching Statistics with RLBWTs. CoRR abs/1802.05906 (2018) - [i32]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. CoRR abs/1806.00198 (2018) - [i31]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
O(n log n)-time text compression by LZ-style longest first substitution. CoRR abs/1806.04890 (2018) - [i30]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left online construction of parameterized position heaps. CoRR abs/1808.01071 (2018) - [i29]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression based on Maximal Repeats. CoRR abs/1811.04596 (2018) - 2017
- [j27]Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. Algorithmica 79(2): 291-318 (2017) - [j26]Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
The "Runs" Theorem. SIAM J. Comput. 46(5): 1501-1514 (2017) - [j25]Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from Lyndon factorization. Theor. Comput. Sci. 689: 147-156 (2017) - [c94]Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-IC-LCS Computation via RLE. CPM 2017: 20:1-20:12 - [c93]Hideo Bannai, Shunsuke Inenaga, Dominik Köppl:
Computing All Distinct Squares in Linear Time for Integer Alphabets. CPM 2017: 22:1-22:18 - [c92]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM 2017: 24:1-24:11 - [c91]Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. ISAAC 2017: 33:1-33:12 - [c90]Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA 2017: 397-408 - [c89]Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian String Regularities Based on RLE. IWOCA 2017: 420-431 - [c88]Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Small-Space LCE Data Structure with Constant-Time Queries. MFCS 2017: 10:1-10:15 - [c87]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: 363-374 - [c86]Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Order Preserving Pattern Matching on Trees and DAGs. SPIRE 2017: 271-277 - [c85]Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On Reverse Engineering the Lyndon Tree. Stringology 2017: 108-117 - [i28]Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian regularities on RLE strings. CoRR abs/1701.02836 (2017) - [i27]Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Small-space encoding LCE data structure with constant-time queries. CoRR abs/1702.07458 (2017) - [i26]Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-IC-LCS computation via RLE. CoRR abs/1703.04954 (2017) - [i25]Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Order preserving pattern matching on trees and DAGs. CoRR abs/1706.00148 (2017) - 2016
- [j24]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed factorization. Discret. Appl. Math. 212: 23-29 (2016) - [j23]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. Theor. Comput. Sci. 656: 215-224 (2016) - [j22]Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Generalized pattern matching and periodicity under substring consistent equivalence relations. Theor. Comput. Sci. 656: 225-233 (2016) - [c84]Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda:
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. CPM 2016: 1:1-1:10 - [c83]Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea:
Factorizing a String into Squares in Linear Time. CPM 2016: 27:1-27:12 - [c82]Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Finding Gapped Palindromes Online. IWOCA 2016: 191-202 - [c81]Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. MFCS 2016: 38:1-38:14 - [c80]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Substring Queries on Run-Length Encoded Strings. MFCS 2016: 69:1-69:11 - [c79]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Fully Dynamic Data Structure for LCE Queries in Compressed Space. MFCS 2016: 72:1-72:15 - [c78]Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Smallest and Largest Repetition Factorizations in O(n log n) Time. Stringology 2016: 135-145 - [c77]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Index and LZ Factorization in Compressed Space. Stringology 2016: 158-170 - [r1]Hideo Bannai:
Grammar Compression. Encyclopedia of Algorithms 2016: 861-866 - [i24]Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda:
Deterministic sub-linear space LCE data structures with efficient construction. CoRR abs/1601.07670 (2016) - [i23]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Fully dynamic data structure for LCE queries in compressed space. CoRR abs/1605.01488 (2016) - [i22]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index and LZ factorization in compressed space. CoRR abs/1605.09558 (2016) - [i21]Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest unique palindromic substring queries in optimal time. CoRR abs/1608.05550 (2016) - [i20]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. CoRR abs/1609.03668 (2016) - [i19]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight bound on the maximum number of shortest unique substrings. CoRR abs/1609.07220 (2016) - [i18]Hideo Bannai, Shunsuke Inenaga, Dominik Köppl:
Computing All Distinct Squares in Linear Time for Integer Alphabets. CoRR abs/1610.03421 (2016) - 2015
- [j21]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting regularities on grammar-compressed strings. Inf. Comput. 240: 74-89 (2015) - [j20]Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Constructing LZ78 tries and position heaps in linear time for large alphabets. Inf. Process. Lett. 115(9): 655-659 (2015) - [j19]Hideo Bannai, Solon P. Pissis:
Editorial. J. Discrete Algorithms 34: 1 (2015) - [j18]Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed automata for dictionary matching. Theor. Comput. Sci. 578: 30-41 (2015) - [c76]Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
An Opportunistic Text Indexing Structure Based on Run Length Encoding. CIAC 2015: 390-402 - [c75]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. CPM 2015: 219-230 - [c74]Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. CPM 2015: 355-366 - [c73]Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization Is NP-complete. DLT 2015: 85-96 - [c72]Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Full Abelian Periods. ISAAC 2015: 768-779 - [c71]Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
A new characterization of maximal repetitions by Lyndon trees. SODA 2015: 562-571 - [c70]Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen:
Efficient Algorithms for Longest Closed Factor Array. SPIRE 2015: 95-102 - [c69]Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. SPIRE 2015: 124-136 - [c68]Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Left-Right Maximal Generic Words. Stringology 2015: 5-16 - [i17]Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets. CoRR abs/1501.06619 (2015) - [i16]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index, LZ factorization, and LCE queries in compressed space. CoRR abs/1504.06954 (2015) - 2014
- [j17]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from suffix trees and links on a binary alphabet. Discret. Appl. Math. 163: 316-325 (2014) - [j16]Eiichi Bannai, Etsuko Bannai, Hideo Bannai:
On the existence of tight relative 2-designs on binary Hamming association schemes. Discret. Math. 314: 17-37 (2014) - [c67]Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Factorizations and Palindromic Covers On-line. CPM 2014: 150-161 - [c66]Keisuke Goto, Hideo Bannai:
Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets. DCC 2014: 163-172 - [c65]Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Lyndon Factorization. MFCS (2) 2014: 565-576 - [c64]Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Substrings Queries in Optimal Time. SOFSEM 2014: 503-513 - [c63]Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. STACS 2014: 675-686 - [c62]Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian Covers and Abelian Runs. Stringology 2014: 43-51 - [c61]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed Factorization. Stringology 2014: 162-168 - [i15]Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
A new characterization of maximal repetitions by Lyndon trees. CoRR abs/1406.0263 (2014) - 2013
- [j15]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms 18: 89-99 (2013) - [c60]Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda:
Converting SLP to LZ78 in almost Linear Time. CPM 2013: 38-49 - [c59]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon Factorization of Grammar Compressed Text. CPM 2013: 153-164 - [c58]Keisuke Goto, Hideo Bannai:
Simpler and Faster Lempel Ziv Factorization. DCC 2013: 133-142 - [c57]Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
From Run Length Encoding to LZ78 and Back Again. DCC 2013: 143-152 - [c56]Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Convolution on Grammar-Compressed Text. DCC 2013: 451-460 - [c55]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting Regularities on Grammar-Compressed Strings. MFCS 2013: 571-582 - [c54]Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga:
Permuted Pattern Matching on Multi-track Strings. SOFSEM 2013: 280-291 - [c53]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. SPIRE 2013: 174-185 - [c52]Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Reversed Lempel-Ziv Factorization Online. Stringology 2013: 107-118 - [c51]Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Automata for Dictionary Matching. CIAA 2013: 319-330 - [i14]Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing convolution on grammar-compressed text. CoRR abs/1303.3945 (2013) - [i13]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon factorization of grammar compressed text. CoRR abs/1304.7061 (2013) - [i12]Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara:
Detecting regularities on grammar-compressed strings. CoRR abs/1304.7067 (2013) - [i11]Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. CoRR abs/1305.6095 (2013) - [i10]Keisuke Goto, Hideo Bannai:
Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets. CoRR abs/1310.1448 (2013) - 2012
- [j14]Shunsuke Inenaga, Hideo Bannai:
Finding Characteristic Substrings from Compressed Texts. Int. J. Found. Comput. Sci. 23(2): 261-280 (2012) - [j13]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. Inf. Process. Lett. 112(19): 711-714 (2012) - [c50]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. CPM 2012: 220-231 - [c49]Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, Ken Satoh:
Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions. ISMIR 2012: 229-234 - [c48]Tomohiro I, Yuki Enokuma, Hideo Bannai, Masayuki Takeda:
General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations. ECML/PKDD (2) 2012: 435-450 - [c47]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM 2012: 301-312 - [c46]Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Efficient LZ78 Factorization of Grammar Compressed Text. SPIRE 2012: 86-98 - [c45]Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda:
Eager XPath Evaluation over XML Streams. SPIRE 2012: 245-250 - [c44]Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Position Heap of a Trie. SPIRE 2012: 360-371 - [i9]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding-up $q$-gram mining on grammar-based compressed texts. CoRR abs/1202.3311 (2012) - [i8]Jun-ichi Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding. CoRR abs/1204.5524 (2012) - [i7]Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Efficient LZ78 factorization of grammar compressed text. CoRR abs/1207.4607 (2012) - [i6]Keisuke Goto, Hideo Bannai:
Simpler and Faster Lempel Ziv Factorization. CoRR abs/1211.3642 (2012) - 2011
- [j12]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50): 6959-6981 (2011) - [c43]Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. CPM 2011: 309-322 - [c42]Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda:
Music Genre Classification using Similarity Functions. ISMIR 2011: 693-698 - [c41]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram Mining on SLP Compressed Strings. SPIRE 2011: 278-289 - [c40]Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda:
Efficient Eager XPath Filtering over XML Streams. Stringology 2011: 30-44 - [c39]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Suffix Trees and Links on a Binary Alphabet. Stringology 2011: 121-130 - [c38]Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Longest Common Substring/Subsequence of Non-linear Texts. Stringology 2011: 197-208 - [i5]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast $q$-gram Mining on SLP Compressed Strings. CoRR abs/1103.3114 (2011) - [i4]Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda:
Restructuring Compressed Texts without Explicit Decompression. CoRR abs/1107.2729 (2011) - [i3]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-gram Frequencies on Collage Systems. CoRR abs/1107.3019 (2011) - [i2]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts. CoRR abs/1107.3022 (2011) - 2010
- [c37]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying a Parameterized Border Array in O(n1.5) Time. CPM 2010: 238-250 - [c36]Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda:
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting. Discovery Science 2010: 132-143 - [c35]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting and Verifying Maximal Palindromes. SPIRE 2010: 135-146 - [c34]Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson:
The Number of Runs in a Ternary Word. Stringology 2010: 178-181
2000 – 2009
- 2009
- [j11]Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara:
Linear-Time Text Compression by Longest-First Substitution. Algorithms 2(4): 1429-1448 (2009) - [c33]Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano:
Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. Discovery Science 2009: 465-472 - [c32]Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Lightweight Parameterized Suffix Array Construction. IWOCA 2009: 312-323 - [c31]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting Parameterized Border Arrays for a Binary Alphabet. LATA 2009: 422-433 - [c30]Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara:
A Series of Run-Rich Strings. LATA 2009: 578-587 - [c29]Shunsuke Inenaga, Hideo Bannai:
Finding Characteristic Substrings from Compressed Texts. Stringology 2009: 40-54 - [c28]Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara:
Bit-parallel Algorithms for Computing all the Runs in a String. Stringology 2009: 203-213 - 2008
- [j10]Eiichi Bannai, Etsuko Bannai, Hideo Bannai:
Uniqueness of certain association schemes. Eur. J. Comb. 29(6): 1379-1395 (2008) - [j9]Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. 19(1): 147-162 (2008) - [c27]Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda:
String Kernels Based on Variable-Length-Don't-Care Patterns. Discovery Science 2008: 308-318 - [c26]Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Parameterized Suffix Arrays for Binary Strings. Stringology 2008: 84-94 - [c25]Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. Stringology 2008: 140-145 - [i1]Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Hideo Bannai, Ayumi Shinohara:
New Lower Bounds for the Maximum Number of Runs in a String. CoRR abs/0804.1214 (2008) - 2007
- [j8]Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the complexity of deriving position specific score matrices from positive and negative sequences. Discret. Appl. Math. 155(6-7): 676-685 (2007) - [c24]Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 - [c23]Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC 2007: 123-132 - [c22]Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda:
Unsupervised Spam Detection Based on String Alienness Measures. Discovery Science 2007: 161-172 - [c21]Hideo Bannai:
Algorithms for String Pattern Discovery. MDAI 2007: 24-29 - 2006
- [c20]Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
A New Family of String Classifiers Based on Local Relatedness. Discovery Science 2006: 114-124 - [c19]Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Reachability on suffix tree graphs. Stringology 2006: 212-225 - 2005
- [j7]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. J. Bioinform. Comput. Biol. 3(6): 1295-1314 (2005) - [c18]Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda:
Practical Algorithms for Pattern Based Linear Regression. Discovery Science 2005: 44-56 - [c17]Osamu Hirose, Naoki Nariai, Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Satoru Miyano:
Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks. ICCSA (3) 2005: 349-356 - 2004
- [j6]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano:
Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. J. Bioinform. Comput. Biol. 2(2): 273-288 (2004) - [j5]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. IEEE ACM Trans. Comput. Biol. Bioinform. 1(4): 159-170 (2004) - [c16]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 - [c15]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
Finding Optimal Pairs of Patterns. WABI 2004: 450-462 - 2003
- [j4]Eijiro Sumii, Hideo Bannai:
The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation. J. Funct. Log. Program. 2003 (2003) - [c14]Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa:
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 - [c13]Yoshinori Tamada, SunYong Kim, Hideo Bannai, Seiya Imoto, Kousuke Tashiro, Satoru Kuhara, Satoru Miyano:
Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection. ECCB 2003: 227-236 - [c12]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217 - [c11]Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano:
Intrasplicing - Analysis of Long Intron Sequences. Pacific Symposium on Biocomputing 2003: 339-350 - 2002
- [j3]Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano:
Extensive feature detection of N-terminal protein sorting signals. Bioinform. 18(2): 298-305 (2002) - [j2]Osamu Maruyama, Hideo Bannai, Yoshinori Tamada, Satoru Kuhara, Satoru Miyano:
Fast algorithm for extracting multiple unordered short motifs using bit operations. Inf. Sci. 146(1-4): 115-126 (2002) - [c10]Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott:
On the Complexity of Deriving Position Specific Score Matrices from Examples. CPM 2002: 168-177 - [c9]Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 - [c8]Yoshinori Tamada, Hideo Bannai, Osamu Maruyama, Satoru Miyano:
Foundations of Designing Computational Knowledge Discovery Processes. Progress in Discovery Science 2002: 459-470 - [c7]Eijiro Sumii, Hideo Bannai:
VM lambda: A Functional Calculusfor Scientific Discovery. FLOPS 2002: 290-304 - [c6]Osamu Maruyama, Satoru Kuhara, Hideo Bannai, Satoru Miyano, Yoshinori Tamada:
Fast Algorithm for Extracting Multiple Unordered Short Motifs Using Bit Operations. JCIS 2002: 1180-1185 - [c5]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa:
Space-Economical Construction of Index Structures for All Suffixes of a String. MFCS 2002: 341-352 - 2001
- [j1]Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano:
HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process. Electron. Trans. Artif. Intell. 5(B): 73-83 (2001) - [c4]Eijiro Sumii, Hideo Bannai:
VM lambda: a Functional Calculus for Scientific Discovery. APLAS 2001: 265-275 - [c3]Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano:
VML: A View Modeling Language for Computational Knowledge Discovery. Discovery Science 2001: 30-44 - [c2]Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano:
Views: Fundamental Building Blocks in the Process of Knowledge Discovery. FLAIRS 2001: 233-238
1990 – 1999
- 1999
- [c1]Hideo Bannai, Satoru Miyano:
A Definition of Discovery in Terms of Generalized Descriptional Complexity. Discovery Science 1999: 316-318
Coauthor Index
[j55] [c148] [j51] [c136] [i65] [i64] [c129] [i58] [j34] [j32] [c107] [c104] [c103] [c99] [c98] [i33] [i32] [j26] [j25] [j24] [j23] [c84] [c79] [c77] [i24] [i23] [i22] [j21] [j20] [j18] [c74] [c72] [c71] [c69] [i17] [i16] [j17] [c67] [c65] [c63] [c61] [i15] [c59] [c57] [c56] [c55] [c53] [c52] [c51] [i14] [i13] [i12] [i11] [j13] [c48] [c44] [j12] [c39] [c37] [c35] [c32] [c31]
[j52] [c146] [c145] [c143] [i75] [i71] [j50] [c140] [c139] [i68] [i67] [i66] [j49] [j48] [j46] [j45] [j44] [j43] [c135] [i62] [i61] [i60] [j42] [j41] [j40] [j39] [j38] [c134] [c131] [c130] [i59] [i57] [i56] [j37] [j34] [j33] [j31] [c128] [c127] [c126] [c125] [c124] [c123] [c122] [c121] [i55] [i54] [i53] [i52] [i51] [i50] [i49] [i48] [i46] [j30] [c119] [c117] [c116] [c115] [c114] [c113] [c112] [c111] [c110] [c109] [c108] [c107] [i45] [i44] [i43] [i42] [i41] [i39] [i38] [i37] [i36] [i35] [j29] [j28] [c103] [c102] [c101] [c100] [c99] [c98] [c97] [c96] [c95] [i32] [i31] [i30] [i29] [j27] [j26] [j25] [c94] [c93] [c92] [c91] [c90] [c89] [c88] [c87] [c86] [c85] [i28] [i27] [i26] [i25] [j24] [j23] [j22] [c84] [c83] [c82] [c81] [c80] [c79] [c78] [c77] [i24] [i23] [i22] [i21] [i20] [i19] [i18] [j21] [j20] [j18] [c76] [c75] [c74] [c73] [c72] [c71] [c70] [c69] [c68] [i17] [i16] [j17] [c67] [c65] [c64] [c63] [c62] [c61] [i15] [j15] [c60] [c59] [c57] [c56] [c55] [c54] [c53] [c52] [c51] [i14] [i13] [i12] [i11] [j14] [j13] [c50] [c47] [c46] [c44] [i9] [i8] [i7] [j12] [c43] [c41] [c39] [c38] [i5] [i4] [i3] [i2] [c37] [c35] [j11] [c32] [c31] [c29] [j9] [c27] [c26] [c24] [c23] [c20] [c19] [c18] [j6] [c16] [c14] [c12] [c9] [c5]
[j52] [c146] [c145] [c143] [i75] [i71] [c142] [c140] [c139] [i70] [i66] [j49] [j48] [j46] [j45] [j44] [j43] [i61] [i60] [j42] [j40] [j39] [c134] [c131] [c130] [i59] [i57] [i56] [j37] [j33] [j31] [c128] [c127] [c126] [c125] [c124] [c123] [c121] [c120] [i55] [i54] [i53] [i52] [i51] [i50] [i48] [i47] [i46] [j30] [c119] [c117] [c116] [c115] [c114] [c113] [c112] [c111] [c110] [c109] [c108] [i45] [i44] [i43] [i42] [i41] [i39] [i38] [i37] [i35] [j28] [c103] [c102] [c100] [c99] [c97] [c96] [c95] [i31] [i30] [i29] [j26] [j25] [c91] [c90] [c85] [j23] [c78] [i21] [j20] [c71] [c68] [i17] [c65] [i15] [c59] [c53] [i13] [c44]
[c146] [j50] [i67] [j49] [j48] [j46] [j45] [j44] [j43] [i61] [j42] [j40] [j39] [c134] [c131] [c130] [i59] [i57] [i56] [j34] [j33] [j31] [c128] [c127] [c126] [c125] [c124] [c123] [c121] [i55] [i54] [i53] [i52] [i51] [i50] [i48] [i46] [j30] [c119] [c117] [c116] [c115] [c113] [c112] [c111] [c110] [c109] [c108] [i45] [i44] [i43] [i42] [i41] [i39] [i38] [i37] [i35] [j28] [c103] [c102] [c101] [c100] [c99] [c97] [c96] [c95] [i31] [i30] [j27] [j26] [j25] [c94] [c92] [c91] [c90] [c89] [c88] [c86] [c85] [i28] [i27] [i26] [i25] [j23] [j22] [c84] [c83] [c82] [c81] [c80] [c79] [c78] [c77] [i24] [i23] [i22] [i21] [i19] [j21] [j20] [j18] [c76] [c75] [c74] [c72] [c71] [c69] [c68] [i17] [i16] [j17] [c67] [c65] [c64] [c63] [c62] [i15] [j15] [c60] [c59] [c57] [c56] [c55] [c53] [c52] [c51] [i14] [i13] [i12] [i11] [c50] [c49] [c48] [c47] [c46] [c45] [c44] [i9] [i8] [i7] [j12] [c43] [c42] [c41] [c40] [c39] [c38] [i5] [i4] [i3] [i2] [c37] [c36] [c35] [j11] [c32] [c31] [j9] [c27] [c26] [c24] [c23] [c22] [c20] [c19] [c18] [j6] [j5] [c16] [c15] [c14] [c12] [c9] [c5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
