default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShunsuke Inenaga
Person information
- affiliation: Kyushu University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j66]Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga:
Tight bounds for the sensitivity of CDAWGs with left-end edits. Acta Informatica 62(1): 12 (2025)- [j65]Takuya Mieno
, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing maximal palindromes in non-standard matching models. Inf. Comput. 304: 105283 (2025) - [j64]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Bit Catastrophes for the Burrows-Wheeler Transform. Theory Comput. Syst. 69(2): 19 (2025) - [c166]Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara:
Subsequence Matching and LCS with Segment Number Constraints. CIAC (2) 2025: 136-150 - [c165]Takuya Mieno, Shunsuke Inenaga:
Space-Efficient Online Computation of String Net Occurrences. CPM 2025: 23:1-23:13 - [c164]Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga:
Packed Acyclic Deterministic Finite Automata. SOFSEM (2) 2025: 284-297 - [i102]Rikuya Hamai, Hiroto Fujimaru, Shunsuke Inenaga:
Constant sensitivity on the CDAWGs. CoRR abs/2502.05915 (2025) - [i101]Hiroto Fujimaru, Shunsuke Inenaga:
On the sensitivity of CDAWG-grammars. CoRR abs/2503.02415 (2025) - 2024
- [j63]Shunsuke Inenaga:
Linear-size suffix tries and linear-size CDAWGs simplified and improved. Acta Informatica 61(4): 445-468 (2024) - [j62]Yuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Faster space-efficient STR-IC-LCS computation. Theor. Comput. Sci. 1003: 114607 (2024) - [j61]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi:
Linear time online algorithms for constructing linear-size suffix trie. Theor. Comput. Sci. 1015: 114765 (2024) - [c163]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes in Non-standard Matching Models. IWOCA 2024: 165-179 - [c162]Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. IWOCA 2024: 327-340 - [c161]Taketo Tsujimoto, Hiroki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Computing Longest Common Subsequence Under Cartesian-Tree Matching Model. IWOCA 2024: 369-381 - [c160]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 - [c159]Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga:
Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. SPIRE 2024: 88-101 - [c158]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 - [c157]Masaru Kikuchi, Shunsuke Inenaga:
All-Pairs Suffix-Prefix on Dynamic Set of Strings. SPIRE 2024: 192-203 - [c156]Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga:
Faster and Simpler Online/Sliding Rightmost Lempel-Ziv Factorizations. SPIRE 2024: 321-335 - [c155]Yuki Yonemoto, Shunsuke Inenaga:
Simple Linear-Time Repetition Factorization. SPIRE 2024: 348-361 - [e3]Shunsuke Inenaga, Simon J. Puglisi:
35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, June 25-27, 2024, Fukuoka, Japan. LIPIcs 296, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-326-3 [contents] - [i100]Shunsuke Inenaga:
Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved. CoRR abs/2401.04509 (2024) - [i99]Shunsuke Inenaga, Takuya Mieno, Hiroki Arimura, Mitsuru Funakoshi, Yuta Fujishige:
Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space. CoRR abs/2402.18090 (2024) - [i98]Taketo Tsujimoto, Koki Shibata, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Computing Longest Common Subsequence under Cartesian-Tree Matching Model. CoRR abs/2402.19146 (2024) - [i97]Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai:
Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR abs/2402.19223 (2024) - [i96]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Bit catastrophes for the Burrows-Wheeler Transform. CoRR abs/2404.10426 (2024) - [i95]Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga:
Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings. CoRR abs/2407.08190 (2024) - [i94]Alan M. Cleary, Joseph Winjum, Jordan Dood, Shunsuke Inenaga:
The CDAWG Index and Pattern Matching on Grammar-Compressed Strings. CoRR abs/2407.08826 (2024) - [i93]Masaru Kikuchi, Shunsuke Inenaga:
All-Pairs Suffix-Prefix on Dynamic Set of Strings. CoRR abs/2407.17814 (2024) - [i92]Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara:
Subsequence Pattern Matching with Segment Number Constraint. CoRR abs/2407.19796 (2024) - [i91]Wataru Sumiyoshi, Takuya Mieno, Shunsuke Inenaga:
Faster and simpler online/sliding rightmost Lempel-Ziv factorizations. CoRR abs/2408.03008 (2024) - [i90]Yuki Yonemoto, Shunsuke Inenaga:
Simple Linear-time Repetition Factorization. CoRR abs/2408.04253 (2024) - [i89]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) - [i88]Shunsuke Inenaga:
Faster and Simpler Online Computation of String Net Frequency. CoRR abs/2410.06837 (2024) - [i87]Hiroki Shibata, Masakazu Ishihata, Shunsuke Inenaga:
Packed Acyclic Deterministic Finite Automata. CoRR abs/2410.07602 (2024) - [i86]Shunsuke Inenaga, Dmitry Kosolobov:
Relating Left and Right Extensions of Maximal Repeats. CoRR abs/2410.15958 (2024) - [i85]Takuya Mieno, Shunsuke Inenaga:
Space-Efficient Online Computation of String Net Occurrences. CoRR abs/2411.12160 (2024) - 2023
- [j60]Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga:
Sensitivity of string compressors and repetitiveness measures. Inf. Comput. 291: 104999 (2023) - [j59]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) - [c154]Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga:
On Sensitivity of Compact Directed Acyclic Word Graphs. WORDS 2023: 168-180 - [c153]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Bit Catastrophes for the Burrows-Wheeler Transform. DLT 2023: 86-99 - [c152]Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Space-Efficient STR-IC-LCS Computation. SOFSEM 2023: 372-384 - [c151]Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue:
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. SPIRE 2023: 28-34 - [c150]Kaisei Kishi, Yuto Nakashima, Shunsuke Inenaga:
Largest Repetition Factorization of Fibonacci Words. SPIRE 2023: 284-296 - [c149]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 - [c148]Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga:
Computing SEQ-IC-LCS of Labeled Graphs. PSC 2023: 3-17 - [i84]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi:
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie. CoRR abs/2301.04295 (2023) - [i83]Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga:
On Sensitivity of Compact Directed Acyclic Word Graphs. CoRR abs/2303.01726 (2023) - [i82]Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno:
Sliding suffix trees simplified. CoRR abs/2307.01412 (2023) - [i81]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) - [i80]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) - [i79]Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga:
Computing SEQ-IC-LCS of Labeled Graphs. CoRR abs/2307.07676 (2023) - [i78]Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue:
Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph. CoRR abs/2308.02269 (2023) - 2022
- [j58]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) - [j57]Yoshifumi Sakai, Shunsuke Inenaga:
A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. Algorithmica 84(9): 2581-2596 (2022) - [j56]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) - [j55]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) - [j54]Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Factorizing Strings into Repetitions. Theory Comput. Syst. 66(2): 484-501 (2022) - [j53]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) - [j52]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) - [c147]Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CPM 2022: 14:1-14:18 - [c146]Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
{RePair} Grammars Are the Smallest Grammars for Fibonacci Words. CPM 2022: 26:1-26:17 - [c145]Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Minimal Absent Words on Run-Length Encoded Strings. CPM 2022: 27:1-27:17 - [c144]Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing Palindromes on a Trie in Linear Time. ISAAC 2022: 15:1-15:15 - [c143]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 - [i77]Tsubasa Oizumi, Takeshi Kai, Takuya Mieno, Shunsuke Inenaga, Hiroki Arimura:
Cartesian Tree Subsequence Matching. CoRR abs/2202.04349 (2022) - [i76]Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama:
RePair Grammars are the Smallest Grammars for Fibonacci Words. CoRR abs/2202.08447 (2022) - [i75]Tooru Akagi, Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga:
Minimal Absent Words on Run-Length Encoded Strings. CoRR abs/2202.13591 (2022) - [i74]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) - [i73]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing maximal generalized palindromes. CoRR abs/2210.02067 (2022) - [i72]Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai:
Space-Efficient STR-IC-LCS Computation. CoRR abs/2210.07979 (2022) - [i71]Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga:
Computing palindromes on a trie in linear time. CoRR abs/2211.03995 (2022) - 2021
- [j51]Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Communication Complexity of Hamming Distance. Algorithms 14(4): 116 (2021) - [j50]Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar:
Longest previous overlapping factor array. Inf. Process. Lett. 168: 106097 (2021) - [j49]Shunsuke Inenaga:
Towards a Complete Perspective on Labeled Tree Indexing: New Size Bounds, Efficient Constructions, and Beyond. J. Inf. Process. 29: 1-13 (2021) - [j48]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) - [j47]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficiently computing runs on a trie. Theor. Comput. Sci. 887: 143-151 (2021) - [j46]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) - [c142]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Suffix Tray. CIAC 2021: 258-270 - [c141]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM 2021: 249-262 - [c140]Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Common Rollercoasters. SPIRE 2021: 21-32 - [c139]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index by Induced Suffix Sorting. SPIRE 2021: 85-99 - [c138]Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
On the Approximation Ratio of LZ-End to LZ77. SPIRE 2021: 114-126 - [c137]Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga:
Position Heaps for Cartesian-Tree Matching on Strings and Tries. SPIRE 2021: 241-254 - [c136]Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
Counting Lyndon Subsequences. Stringology 2021: 53-60 - [i70]Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Communication Complexity of Hamming Distance. CoRR abs/2103.03468 (2021) - [i69]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) - [i68]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index By Induced Suffix Sorting. CoRR abs/2105.13744 (2021) - [i67]Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
On the approximation ratio of LZ-End to LZ77. CoRR abs/2106.01173 (2021) - [i66]Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
Counting Lyndon Subsequences. CoRR abs/2106.01190 (2021) - [i65]Akio Nishimoto, Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga:
Position Heaps for Cartesian-tree Matching on Strings and Tries. CoRR abs/2106.01595 (2021) - [i64]Tooru Akagi, Mitsuru Funakoshi, Shunsuke Inenaga:
Sensitivity of string compressors and repetitiveness measures. CoRR abs/2107.08615 (2021) - 2020
- [j45]Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian:
Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts. Algorithmica 82(5): 1346-1377 (2020) - [j44]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
Practical Grammar Compression Based on Maximal Repeats. Algorithms 13(4): 103 (2020) - [j43]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) - [j42]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) - [j41]Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Efficient computation of longest single-arm-gapped palindromes in a string. Theor. Comput. Sci. 812: 160-173 (2020) - [j40]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) - [c135]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 - [c134]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 - [c133]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 - [c132]Yoshifumi Sakai, Shunsuke Inenaga:
A Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length. ISAAC 2020: 6:1-6:16 - [c131]Shunsuke Inenaga:
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. LATIN 2020: 194-206 - [c130]Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. SOFSEM 2020: 125-135 - [c129]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 - [c128]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE 2020: 27-41 - [c127]Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai:
Longest Square Subsequence Problem Revisited. SPIRE 2020: 147-154 - [c126]Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On Repetitiveness Measures of Thue-Morse Words. SPIRE 2020: 213-220 - [c125]Shunsuke Inenaga:
Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. Stringology 2020: 111-124 - [i63]Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. CoRR abs/2001.05671 (2020) - [i62]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) - [i61]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) - [i60]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) - [i59]Shunsuke Inenaga:
Pointer-Machine Algorithms for Fully-Online Construction of Suffix Trees and DAWGs on Multiple Strings. CoRR abs/2005.00681 (2020) - [i58]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR abs/2005.08190 (2020) - [i57]Yoshifumi Sakai, Shunsuke Inenaga:
A reduction of the dynamic time warping distance to the longest increasing subsequence length. CoRR abs/2005.09169 (2020) - [i56]Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On repetitiveness measures of Thue-Morse words. CoRR abs/2005.09524 (2020) - [i55]Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai:
Longest Square Subsequence Problem Revisited. CoRR abs/2006.00216 (2020) - [i54]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) - [i53]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR abs/2008.08506 (2020) - [i52]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Suffix Tray. CoRR abs/2012.10092 (2020)
2010 – 2019
- 2019
- [j39]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) - [j38]Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara:
Efficient dynamic dictionary matching with DAWGs and AC-automata. Theor. Comput. Sci. 792: 161-172 (2019) - [c124]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. CIAC 2019: 237-248 - [c123]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Runs on a Trie. CPM 2019: 23:1-23:11 - [c122]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 - [c121]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 - [c120]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga:
Online Algorithms for Constructing Linear-Size Suffix Trie. CPM 2019: 30:1-30:19 - [c119]Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida:
MR-RePair: Grammar Compression Based on Maximal Repeats. DCC 2019: 508-517 - [c118]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 - [c117]Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. IWOCA 2019: 430-441 - [c116]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 - [c115]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. SPIRE 2019: 162-174 - [c114]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 - [c113]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes and Distinct Palindromes in a Trie. Stringology 2019: 3-15 - [c112]Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto:
k-Abelian Pattern Matching: Revisited, Corrected, and Extended. Stringology 2019: 29-40 - [i51]Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga:
Online Algorithms for Constructing Linear-size Suffix Trie. CoRR abs/1901.10045 (2019) - [i50]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing runs on a trie. CoRR abs/1901.10633 (2019) - [i49]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster queries for longest substring palindrome after block edit. CoRR abs/1901.10722 (2019) - [i48]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. CoRR abs/1903.06289 (2019) - [i47]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) - [i46]Shunsuke Inenaga:
Suffix Trees, DAWGs and CDAWGs for Forward and Backward Tries. CoRR abs/1904.04513 (2019) - [i45]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) - [i44]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) - [i43]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) - [i42]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. CoRR abs/1906.05486 (2019) - [i41]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) - [i40]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) - 2018
- [j37]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) - [j36]Heikki Hyyrö, Shunsuke Inenaga:
Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions. Int. J. Found. Comput. Sci. 29(4): 623-645 (2018) - [j35]Shunsuke Inenaga, Heikki Hyyrö:
A hardness result and new algorithm for the longest common palindromic subsequence problem. Inf. Process. Lett. 129: 11-15 (2018) - [j34]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) - [j33]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. Theory Comput. Syst. 62(1): 162-191 (2018) - [c111]Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Online Elastic Degenerate String Matching. CPM 2018: 9:1-9:10 - [c110]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest substring palindrome after edit. CPM 2018: 12:1-12:14 - [c109]Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda:
Computing longest common square subsequences. CPM 2018: 15:1-15:13 - [c108]Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Lyndon Substring After Edit. CPM 2018: 19:1-19:10 - [c107]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 - [c106]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. SPIRE 2018: 183-190 - [c105]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 - [c104]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 - [c103]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left Online Construction of Parameterized Position Heaps. Stringology 2018: 91-102 - [i39]Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga:
Block Palindromes: A New Generalization of Palindromes. CoRR abs/1806.00198 (2018) - [i38]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) - [i37]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left online construction of parameterized position heaps. CoRR abs/1808.01071 (2018) - [i36]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
- [j32]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) - [j31]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9): 1785-1793 (2017) - [j30]Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
The "Runs" Theorem. SIAM J. Comput. 46(5): 1501-1514 (2017) - [j29]Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from Lyndon factorization. Theor. Comput. Sci. 689: 147-156 (2017) - [c102]Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-IC-LCS Computation via RLE. CPM 2017: 20:1-20:12 - [c101]Hideo Bannai, Shunsuke Inenaga, Dominik Köppl:
Computing All Distinct Squares in Linear Time for Integer Alphabets. CPM 2017: 22:1-22:18 - [c100]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM 2017: 24:1-24:11 - [c99]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 - [c98]Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA 2017: 397-408 - [c97]Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian String Regularities Based on RLE. IWOCA 2017: 420-431 - [c96]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 - [c95]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 - [c94]Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Computing Longest Single-arm-gapped Palindromes in a String. SOFSEM 2017: 375-386 - [c93]Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi:
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. SPIRE 2017: 51-67 - [c92]Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Order Preserving Pattern Matching on Trees and DAGs. SPIRE 2017: 271-277 - [c91]Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression. SPIRE 2017: 304-316 - [c90]Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On Reverse Engineering the Lyndon Tree. Stringology 2017: 108-117 - [i35]Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian regularities on RLE strings. CoRR abs/1701.02836 (2017) - [i34]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) - [i33]Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-IC-LCS computation via RLE. CoRR abs/1703.04954 (2017) - [i32]Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi:
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. CoRR abs/1705.09538 (2017) - [i31]Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura:
Linear-size CDAWG: new repetition-aware indexing and grammar compression. CoRR abs/1705.09779 (2017) - [i30]Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Order preserving pattern matching on trees and DAGs. CoRR abs/1706.00148 (2017) - [i29]Diptarama, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara:
Efficient Dynamic Dictionary Matching with DAWGs and AC-automata. CoRR abs/1710.03395 (2017) - 2016
- [j28]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) - [j27]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) - [j26]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) - [c89]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 - [c88]Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura:
Fully-online Construction of Suffix Trees for Multiple Texts. CPM 2016: 22:1-22:13 - [c87]Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea:
Factorizing a String into Squares in Linear Time. CPM 2016: 27:1-27:12 - [c86]Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Finding Gapped Palindromes Online. IWOCA 2016: 191-202 - [c85]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. IWOCA 2016: 213-225 - [c84]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 - [c83]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Substring Queries on Run-Length Encoded Strings. MFCS 2016: 69:1-69:11 - [c82]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 - [c81]Heikki Hyyrö, Shunsuke Inenaga:
Compacting a Dynamic Edit Distance Table by RLE Compression. SOFSEM 2016: 302-313 - [c80]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal alpha-gapped Repeats. STACS 2016: 39:1-39:14 - [c79]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 - [c78]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Index and LZ Factorization in Compressed Space. Stringology 2016: 158-170 - [e2]Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai:
String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings. Lecture Notes in Computer Science 9954, 2016, ISBN 978-3-319-46048-2 [contents] - [i28]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) - [i27]Takuya Takagi, Shunsuke Inenaga, Kunihiko Sadakane, Hiroki Arimura:
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing. CoRR abs/1602.00422 (2016) - [i26]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) - [i25]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index and LZ factorization in compressed space. CoRR abs/1605.09558 (2016) - [i24]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) - [i23]Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara:
Computing longest single-arm-gapped palindromes in a string. CoRR abs/1609.03000 (2016) - [i22]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) - [i21]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight bound on the maximum number of shortest unique substrings. CoRR abs/1609.07220 (2016) - [i20]Hideo Bannai, Shunsuke Inenaga, Dominik Köppl:
Computing All Distinct Squares in Linear Time for Integer Alphabets. CoRR abs/1610.03421 (2016) - [i19]Shunsuke Inenaga, Heikki Hyyrö:
A hardness result and new algorithm for the longest common palindromic subsequence problem. CoRR abs/1612.07475 (2016) - 2015
- [j25]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) - [j24]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) - [j23]Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga:
Dynamic edit distance table under a general weighted cost function. J. Discrete Algorithms 34: 2-17 (2015) - [j22]Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed automata for dictionary matching. Theor. Comput. Sci. 578: 30-41 (2015) - [c77]Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
An Opportunistic Text Indexing Structure Based on Run Length Encoding. CIAC 2015: 390-402 - [c76]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 - [c75]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 - [c74]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 - [c73]Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Full Abelian Periods. ISAAC 2015: 768-779 - [c72]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 - [c71]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 - [c70]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 - [c69]Shunsuke Inenaga:
A Faster Longest Common Extension Algorithm on Compressed Strings and its Applications. Stringology 2015: 1-4 - [c68]Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Left-Right Maximal Generic Words. Stringology 2015: 5-16 - [i18]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) - [i17]Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. CoRR abs/1503.04045 (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) - [i15]Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura:
Fully-online construction of suffix trees and DAWGs for multiple texts. CoRR abs/1507.07622 (2015) - [i14]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal $α$-gapped Repeats. CoRR abs/1509.09237 (2015) - 2014
- [j21]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) - [c67]Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Factorizations and Palindromic Covers On-line. CPM 2014: 150-161 - [c66]Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Lyndon Factorization. MFCS (2) 2014: 565-576 - [c65]Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Substrings Queries in Optimal Time. SOFSEM 2014: 503-513 - [c64]Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. STACS 2014: 675-686 - [c63]Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian Covers and Abelian Runs. Stringology 2014: 43-51 - [c62]Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto:
Closed Factorization. Stringology 2014: 162-168 - [i13]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
- [j20]Shunsuke Inenaga, Carlos Martín-Vide:
Foreword. Int. J. Comput. Math. 90(6): 1129-1131 (2013) - [j19]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms 18: 89-99 (2013) - [j18]Tomohiro I, Shunsuke Inenaga, Masayuki Takeda:
Palindrome pattern matching. Theor. Comput. Sci. 483: 162-170 (2013) - [c61]Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda:
Converting SLP to LZ78 in almost Linear Time. CPM 2013: 38-49 - [c60]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon Factorization of Grammar Compressed Text. CPM 2013: 153-164 - [c59]Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
From Run Length Encoding to LZ78 and Back Again. DCC 2013: 143-152 - [c58]Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Convolution on Grammar-Compressed Text. DCC 2013: 451-460 - [c57]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 - [c56]Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga:
Permuted Pattern Matching on Multi-track Strings. SOFSEM 2013: 280-291 - [c55]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. SPIRE 2013: 174-185 - [c54]Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Reversed Lempel-Ziv Factorization Online. Stringology 2013: 107-118 - [c53]Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Automata for Dictionary Matching. CIAA 2013: 319-330 - [i12]Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing convolution on grammar-compressed text. CoRR abs/1303.3945 (2013) - [i11]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon factorization of grammar compressed text. CoRR abs/1304.7061 (2013) - [i10]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) - [i9]Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. CoRR abs/1305.6095 (2013) - 2012
- [j17]Shunsuke Inenaga, Hideo Bannai:
Finding Characteristic Substrings from Compressed Texts. Int. J. Found. Comput. Sci. 23(2): 261-280 (2012) - [j16]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) - [c52]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. CPM 2012: 220-231 - [c51]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM 2012: 301-312 - [c50]Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Efficient LZ78 Factorization of Grammar Compressed Text. SPIRE 2012: 86-98 - [c49]Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Position Heap of a Trie. SPIRE 2012: 360-371 - [i8]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding-up $q$-gram mining on grammar-based compressed texts. CoRR abs/1202.3311 (2012) - [i7]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) - [i6]Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Efficient LZ78 factorization of grammar compressed text. CoRR abs/1207.4607 (2012) - 2011
- [j15]Shunsuke Inenaga, Kenichirou Oyama, Hiroto Yasuura:
Towards Modeling Stored-value Electronic Money Systems. Inf. Media Technol. 6(1): 25-34 (2011) - [j14]Stanislav Angelov, Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen:
Missing pattern discovery. J. Discrete Algorithms 9(2): 153-165 (2011) - [j13]Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura:
Password Based Anonymous Authentication with Private Information Retrieval. J. Digit. Inf. Manag. 9(2): 72-78 (2011) - [j12]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50): 6959-6981 (2011) - [c48]Toru Nakamura, Shunsuke Inenaga, Kensuke Baba, Daisuke Ikeda, Hiroto Yasuura:
An Anonymous Authentication Protocol with Single-database PIR. AISC 2011: 3-8 - [c47]Tomohiro I, Shunsuke Inenaga, Masayuki Takeda:
Palindrome Pattern Matching. CPM 2011: 232-245 - [c46]Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. CPM 2011: 309-322 - [c45]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram Mining on SLP Compressed Strings. SPIRE 2011: 278-289 - [c44]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Suffix Trees and Links on a Binary Alphabet. Stringology 2011: 121-130 - [c43]Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Longest Common Substring/Subsequence of Non-linear Texts. Stringology 2011: 197-208 - [e1]Adrian-Horia Dediu, Shunsuke Inenaga, Carlos Martín-Vide:
Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Tarragona, Spain, May 26-31, 2011. Proceedings. Lecture Notes in Computer Science 6638, Springer 2011, ISBN 978-3-642-21253-6 [contents] - [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
- [j11]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. Chic. J. Theor. Comput. Sci. 2010 (2010) - [c42]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying a Parameterized Border Array in O(n1.5) Time. CPM 2010: 238-250 - [c41]Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Kensuke Baba, Hiroto Yasuura:
An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services. ICCSA (4) 2010: 236-251 - [c40]Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga:
Dynamic Edit Distance Table under a General Weighted Cost Function. SOFSEM 2010: 515-527 - [c39]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting and Verifying Maximal Palindromes. SPIRE 2010: 135-146
2000 – 2009
- 2009
- [j10]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) - [j9]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto:
Efficient algorithms to compute compressed longest common substrings and compressed palindromes. Theor. Comput. Sci. 410(8-10): 900-913 (2009) - [c38]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. CATS 2009: 19-28 - [c37]Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Lightweight Parameterized Suffix Array Construction. IWOCA 2009: 312-323 - [c36]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting Parameterized Border Arrays for a Binary Alphabet. LATA 2009: 422-433 - [c35]Shunsuke Inenaga, Kenichirou Oyama, Hiroto Yasuura:
Towards Modeling Stored-value Electronic Money Systems. NaBIC 2009: 902-907 - [c34]Tomomi Yamasaki, Shunsuke Inenaga, Daisuke Ikeda, Hiroto Yasuura:
Modeling Costs of Access Control with Various Key Management Systems. PDPTA 2009: 676-682 - [c33]Shunsuke Inenaga, Hideo Bannai:
Finding Characteristic Substrings from Compressed Texts. Stringology 2009: 40-54 - 2008
- [j8]Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. 19(1): 147-162 (2008) - [c32]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 - [c31]Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto:
Computing Longest Common Substring and All Palindromes from Compressed Strings. SOFSEM 2008: 364-375 - [c30]Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Parameterized Suffix Arrays for Binary Strings. Stringology 2008: 84-94 - [i1]Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara:
An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program. Structure-Based Compression of Complex Massive Data 2008 - 2007
- [c29]Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 - [c28]Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC 2007: 123-132 - 2006
- [c27]Shunsuke Inenaga, Masayuki Takeda:
On-Line Linear-Time Construction of Word Suffix Trees. CPM 2006: 60-71 - [c26]Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
A New Family of String Classifiers Based on Local Relatedness. Discovery Science 2006: 114-124 - [c25]Shunsuke Inenaga, Masayuki Takeda:
Sparse Directed Acyclic Word Graphs. SPIRE 2006: 61-73 - [c24]Shunsuke Inenaga, Masayuki Takeda:
Sparse compact directed acyclic word graphs. Stringology 2006: 197-211 - [c23]Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Reachability on suffix tree graphs. Stringology 2006: 212-225 - 2005
- [j7]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
On-line construction of compact directed acyclic word graphs. Discret. Appl. Math. 146(2): 156-179 (2005) - [j6]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
A fully compressed pattern matching algorithm for simple collage systems. Int. J. Found. Comput. Sci. 16(6): 1155-1166 (2005) - [c22]Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda:
Practical Algorithms for Pattern Based Linear Regression. Discovery Science 2005: 44-56 - [c21]Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Fully Incremental LCS Computation. FCT 2005: 563-574 - [c20]Stanislav Angelov, Shunsuke Inenaga:
Composite Pattern Discovery for PCR Application. SPIRE 2005: 167-178 - 2004
- [j5]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) - [j4]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compact directed acyclic word graphs for a sliding window. J. Discrete Algorithms 2(1): 33-51 (2004) - [j3]Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004) - [c19]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 - [c18]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. Developments in Language Theory 2004: 225-236 - [c17]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113 - [c16]Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen:
Finding Missing Patterns. WABI 2004: 463-474 - 2003
- [j2]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa:
A Note on Randomized Algorithm for String Matching with Mismatches. Nord. J. Comput. 10(1): 2-12 (2003) - [j1]Shunsuke Inenaga:
Bidirectional Construction of Suffix Trees. Nord. J. Comput. 10(1): 52- (2003) - [c15]Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa:
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 - [c14]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217 - [c13]Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara:
Linear-Time Off-Line Text Compression by Longest-First Substitution. SPIRE 2003: 137-152 - [c12]Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary Directed Acyclic Word Graphs. CIAA 2003: 120-130 - 2002
- [c11]Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa:
The Minimum DAWG for All Suffixes of a String and Its Applications. CPM 2002: 153-167 - [c10]Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 - [c9]Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga:
Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317 - [c8]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 - [c7]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324 - [c6]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa:
A Note on Randomized Algorithm for String Matching with Mismatches. Stringology 2002: 9-17 - [c5]Shunsuke Inenaga:
Bidirectional Construction of Suffix Trees. Stringology 2002: 75-87 - 2001
- [c4]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi:
On-Line Construction of Compact Directed Acyclic Word Graphs. CPM 2001: 169-180 - [c3]Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440 - [c2]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110 - [c1]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Construction of the CDAWG for a Trie. Stringology 2001: 37-48
Coauthor Index
[j65] [j62] [c163] [c160] [c158] [i97] [i89] [j59] [c152] [c149] [i82] [i81] [i80] [j58] [j56] [j55] [j54] [j53] [j52] [c143] [i74] [i73] [i72] [j51] [j50] [j48] [j47] [j46] [c142] [c140] [c139] [i70] [i69] [i68] [j44] [j43] [j42] [j40] [c135] [c134] [c133] [c130] [c129] [c128] [c127] [c126] [i63] [i62] [i61] [i60] [i58] [i56] [i55] [i54] [i52] [j39] [c124] [c123] [c122] [c121] [c119] [c118] [c117] [c116] [c115] [c114] [c113] [c112] [i50] [i49] [i48] [i47] [i45] [i44] [i43] [i42] [i41] [i40] [j37] [j34] [c111] [c110] [c109] [c108] [c107] [c106] [c105] [c104] [c103] [i39] [i38] [i37] [i36] [j32] [j30] [j29] [c102] [c101] [c100] [c99] [c98] [c97] [c96] [c95] [c92] [c90] [i35] [i34] [i33] [i30] [j28] [j27] [j26] [c89] [c87] [c86] [c84] [c83] [c82] [c79] [c78] [i28] [i26] [i25] [i24] [i22] [i21] [i20] [j25] [j24] [j22] [c77] [c76] [c75] [c74] [c73] [c72] [c71] [c70] [c68] [i18] [i16] [j21] [c67] [c66] [c65] [c64] [c63] [c62] [i13] [j19] [c61] [c60] [c59] [c58] [c57] [c56] [c55] [c54] [c53] [i12] [i11] [i10] [i9] [j17] [j16] [c52] [c51] [c50] [c49] [i8] [i7] [i6] [j12] [c46] [c45] [c44] [c43] [i5] [i4] [i3] [i2] [c42] [c39] [j10] [c37] [c36] [c33] [j8] [c32] [c30] [c29] [c28] [c26] [c23] [c22] [j5] [c19] [c15] [c14] [c10] [c8]
Diptarama
aka: Diptarama Hendrian
aka: Diptarama Hendrian
[j43] [c112] [j33] [c111] [c107] [c106] [i39] [j30] [j29] [j28] [j27] [c89] [c82] [c80] [c78] [i28] [i26] [i25] [j25] [j24] [j22] [c75] [c73] [c72] [c70] [i18] [i16] [i14] [j21] [c67] [c66] [c64] [c62] [i13] [j18] [c60] [c59] [c58] [c57] [c55] [c54] [c53] [i12] [i11] [i10] [i9] [j16] [c49] [j12] [c47] [c44] [c42] [c39] [c37] [c36]
[j66] [j65] [j62] [c163] [c161] [c160] [c158] [i98] [i97] [i89] [c154] [c152] [c151] [c150] [c149] [c148] [i83] [i80] [i79] [i78] [j58] [j56] [j55] [j54] [j53] [j52] [c145] [i75] [i73] [i72] [j51] [j48] [j47] [c142] [c140] [c139] [c138] [c137] [c136] [i70] [i69] [i68] [i67] [i66] [i65] [j44] [j42] [j40] [c135] [c134] [c133] [c130] [c129] [c128] [c126] [i63] [i62] [i61] [i60] [i58] [i56] [i54] [i52] [j39] [c124] [c123] [c122] [c121] [c119] [c118] [c117] [c116] [c115] [c114] [c113] [i50] [i49] [i48] [i47] [i45] [i44] [i43] [i42] [i40] [j34] [c111] [c110] [c108] [c107] [c105] [c104] [c103] [i38] [i37] [i36] [j30] [j29] [c99] [c98] [c90] [j27] [c79] [i24] [j24] [c72] [c68] [i18] [c66] [i13] [c60] [c55] [i11] [c49]
[j65] [c163] [j59] [i81] [j58] [j56] [j55] [j54] [j53] [j52] [i73] [j51] [j48] [j47] [c142] [c140] [c139] [c138] [c136] [i70] [i69] [i68] [i67] [i66] [j43] [j42] [j40] [c135] [c134] [c133] [c130] [c129] [c128] [c126] [i63] [i62] [i61] [i60] [i58] [i56] [i54] [i52] [j39] [c124] [c123] [c122] [c121] [c118] [c117] [c116] [c115] [c114] [c113] [i50] [i49] [i48] [i47] [i45] [i44] [i43] [i42] [i40] [j34] [c111] [c110] [c109] [c108] [c107] [c105] [c104] [c103] [i38] [i37] [j32] [j30] [j29] [c102] [c100] [c99] [c98] [c97] [c96] [c92] [c90] [i35] [i34] [i33] [i30] [j27] [j26] [c89] [c87] [c86] [c84] [c83] [c82] [c79] [c78] [i28] [i26] [i25] [i24] [i21] [j25] [j24] [j22] [c77] [c76] [c75] [c73] [c72] [c70] [c68] [i18] [i16] [j21] [c67] [c66] [c65] [c64] [c63] [i13] [j19] [j18] [c61] [c60] [c59] [c58] [c57] [c55] [c54] [c53] [i12] [i11] [i10] [i9] [c52] [c51] [c50] [c49] [i8] [i7] [i6] [j12] [c47] [c46] [c45] [c44] [c43] [i5] [i4] [i3] [i2] [c42] [c39] [j10] [c37] [c36] [j8] [c32] [c30] [c29] [c28] [c27] [c26] [c25] [c24] [c23] [j7] [j6] [c22] [c21] [j5] [j4] [j3] [c19] [c18] [c17] [j2] [c15] [c14] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c4] [c3] [c2] [c1]
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 2025-06-17 00:27 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:
