


Остановите войну!
for scientists:


default search action
Hideo Bannai
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [c138]Yuuki Yonemoto, Yuto Nakashima
, Shunsuke Inenaga
, Hideo Bannai
:
Space-Efficient STR-IC-LCS Computation. SOFSEM 2023: 372-384 - 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]