default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasayuki Takeda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 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- 2023
- [j48]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) - [i49]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) - 2022
- [j47]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) - [j46]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) - [j45]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) - [j44]Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Factorizing Strings into Repetitions. Theory Comput. Syst. 66(2): 484-501 (2022) - [j43]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) - [j42]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) - [c162]Naoki Sawayanagi, Ryousuke Nakada, Yoshiki Hayama, Naoya Katsumata, Yuki Shimamura, Takumi Hinata, Masayuki Takeda, Katsumi Nakatsuhara:
Wavelength characteristics of Nb2O5micro-ring resonators. OECC/PSC 2022: 1-3 - [i48]Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing maximal generalized palindromes. CoRR abs/2210.02067 (2022) - 2021
- [j41]Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Communication Complexity of Hamming Distance. Algorithms 14(4): 116 (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) - [c161]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Suffix Tray. CIAC 2021: 258-270 - [c160]Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Common Rollercoasters. SPIRE 2021: 21-32 - [c159]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index by Induced Suffix Sorting. SPIRE 2021: 85-99 - [c158]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 - [c157]Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
Counting Lyndon Subsequences. Stringology 2021: 53-60 - [i47]Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Communication Complexity of Hamming Distance. CoRR abs/2103.03468 (2021) - [i46]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) - [i45]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index By Induced Suffix Sorting. CoRR abs/2105.13744 (2021) - [i44]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) - [i43]Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda:
Counting Lyndon Subsequences. CoRR abs/2106.01190 (2021) - 2020
- [j38]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) - [j37]Masayuki Takeda, Nobuyuki Yamasaki:
Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(10): 1227-1233 (2020) - [j36]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) - [j35]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) - [c156]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 - [c155]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 - [c154]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 - [c153]Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. SOFSEM 2020: 125-135 - [c152]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 - [c151]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. SPIRE 2020: 27-41 - [c150]Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On Repetitiveness Measures of Thue-Morse Words. SPIRE 2020: 213-220 - [i42]Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-EC-LCS Computation. CoRR abs/2001.05671 (2020) - [i41]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) - [i40]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) - [i39]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) - [i38]Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Towards Efficient Interactive Computation of Dynamic Time Warping Distance. CoRR abs/2005.08190 (2020) - [i37]Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On repetitiveness measures of Thue-Morse words. CoRR abs/2005.09524 (2020) - [i36]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) - [i35]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Suffix Tray. CoRR abs/2012.10092 (2020)
2010 – 2019
- 2019
- [j34]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) - [c149]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. CIAC 2019: 237-248 - [c148]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Runs on a Trie. CPM 2019: 23:1-23:11 - [c147]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 - [c146]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 - [c145]Masayuki Takeda, Nobuyuki Yamasaki:
Finding the Maximum Number of Symbols for the 4b/10b Line Code with Error Correction. CANDAR Workshops 2019: 460-464 - [c144]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 - [c143]Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. IWOCA 2019: 430-441 - [c142]Yoshiki Hayama, Shinta Uchibori, Katsumi Nakatsuhara, Masayuki Takeda, Takeshi Nishizawa:
Fabrication of Nb2O5 horizontal slot waveguide structures. OECC/PSC 2019: 1-3 - [c141]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 - [c140]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. SPIRE 2019: 162-174 - [c139]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 - [c138]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Maximal Palindromes and Distinct Palindromes in a Trie. Stringology 2019: 3-15 - [i34]Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing runs on a trie. CoRR abs/1901.10633 (2019) - [i33]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster queries for longest substring palindrome after block edit. CoRR abs/1901.10722 (2019) - [i32]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Parameterized Position Heap of a Trie. CoRR abs/1903.06289 (2019) - [i31]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) - [i30]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) - [i29]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) - [i28]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) - [i27]Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka:
On Longest Common Property Preserved Substring Queries. CoRR abs/1906.05486 (2019) - [i26]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
- [j33]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) - [c137]Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Online Elastic Degenerate String Matching. CPM 2018: 9:1-9:10 - [c136]Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest substring palindrome after edit. CPM 2018: 12:1-12:14 - [c135]Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda:
Computing longest common square subsequences. CPM 2018: 15:1-15:13 - [c134]Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Longest Lyndon Substring After Edit. CPM 2018: 19:1-19:10 - [c133]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 - [c132]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 - [c131]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 - [c130]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left Online Construction of Parameterized Position Heaps. Stringology 2018: 91-102 - [i25]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) - [i24]Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Right-to-left online construction of parameterized position heaps. CoRR abs/1808.01071 (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]Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta:
The "Runs" Theorem. SIAM J. Comput. 46(5): 1501-1514 (2017) - [j30]Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring strings from Lyndon factorization. Theor. Comput. Sci. 689: 147-156 (2017) - [c129]Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-IC-LCS Computation via RLE. CPM 2017: 20:1-20:12 - [c128]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight Bounds on the Maximum Number of Shortest Unique Substrings. CPM 2017: 24:1-24:11 - [c127]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 - [c126]Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Palindromic Substring Queries in Optimal Time. IWOCA 2017: 397-408 - [c125]Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian String Regularities Based on RLE. IWOCA 2017: 420-431 - [c124]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 - [c123]Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Order Preserving Pattern Matching on Trees and DAGs. SPIRE 2017: 271-277 - [c122]Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On Reverse Engineering the Lyndon Tree. Stringology 2017: 108-117 - [i23]Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian regularities on RLE strings. CoRR abs/1701.02836 (2017) - [i22]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) - [i21]Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster STR-IC-LCS computation via RLE. CoRR abs/1703.04954 (2017) - [i20]Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Order preserving pattern matching on trees and DAGs. CoRR abs/1706.00148 (2017) - 2016
- [j29]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) - [j28]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) - [c121]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 - [c120]Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea:
Factorizing a String into Squares in Linear Time. CPM 2016: 27:1-27:12 - [c119]Hirotaka Goto, Asuka Ohta, Tomofumi Matsuzawa, Munehiro Takimoto, Yasushi Kambayashi, Masayuki Takeda:
A Guidance System for Wide-area Complex Disaster Evacuation based on Ant Colony Optimization. ICAART (1) 2016: 262-268 - [c118]Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Finding Gapped Palindromes Online. IWOCA 2016: 191-202 - [c117]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 - [c116]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Substring Queries on Run-Length Encoded Strings. MFCS 2016: 69:1-69:11 - [c115]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 - [c114]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 - [c113]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Index and LZ Factorization in Compressed Space. Stringology 2016: 158-170 - [r2]Masayuki Takeda, Ayumi Shinohara:
Pattern Matching on Compressed Text. Encyclopedia of Algorithms 2016: 1538-1542 - [i19]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) - [i18]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) - [i17]Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic index and LZ factorization in compressed space. CoRR abs/1605.09558 (2016) - [i16]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) - [i15]Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Tight bound on the maximum number of shortest unique substrings. CoRR abs/1609.07220 (2016) - 2015
- [j27]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) - [j26]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) - [j25]Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed automata for dictionary matching. Theor. Comput. Sci. 578: 30-41 (2015) - [c112]Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
An Opportunistic Text Indexing Structure Based on Run Length Encoding. CIAC 2015: 390-402 - [c111]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 - [c110]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 - [c109]Asuka Ohta, Hirotaka Goto, Tomofumi Matsuzawa, Munehiro Takimoto, Yasushi Kambayashi, Masayuki Takeda:
An Improved Evacuation Guidance System Based on Ant Colony Optimization. IES 2015: 15-27 - [c108]Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Full Abelian Periods. ISAAC 2015: 768-779 - [c107]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 - [c106]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 - [c105]Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Left-Right Maximal Generic Words. Stringology 2015: 5-16 - [i14]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) - [i13]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
- [j24]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) - [c104]Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Palindromic Factorizations and Palindromic Covers On-line. CPM 2014: 150-161 - [c103]Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Lyndon Factorization. MFCS (2) 2014: 565-576 - [c102]Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Shortest Unique Substrings Queries in Optimal Time. SOFSEM 2014: 503-513 - [c101]Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. STACS 2014: 675-686 - [c100]Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Abelian Covers and Abelian Runs. Stringology 2014: 43-51 - [i12]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
- [j23]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms 18: 89-99 (2013) - [j22]Tomohiro I, Shunsuke Inenaga, Masayuki Takeda:
Palindrome pattern matching. Theor. Comput. Sci. 483: 162-170 (2013) - [c99]Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda:
Converting SLP to LZ78 in almost Linear Time. CPM 2013: 38-49 - [c98]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon Factorization of Grammar Compressed Text. CPM 2013: 153-164 - [c97]Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
From Run Length Encoding to LZ78 and Back Again. DCC 2013: 143-152 - [c96]Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Convolution on Grammar-Compressed Text. DCC 2013: 451-460 - [c95]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 - [c94]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. SPIRE 2013: 174-185 - [c93]Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Reversed Lempel-Ziv Factorization Online. Stringology 2013: 107-118 - [c92]Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compressed Automata for Dictionary Matching. CIAA 2013: 319-330 - [i11]Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing convolution on grammar-compressed text. CoRR abs/1303.3945 (2013) - [i10]Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Lyndon factorization of grammar compressed text. CoRR abs/1304.7061 (2013) - [i9]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) - [i8]Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. CoRR abs/1305.6095 (2013) - 2012
- [j21]Shirou Maruyama, Hiroshi Sakamoto, Masayuki Takeda:
An Online Algorithm for Lightweight Grammar-Based Compression. Algorithms 5(2): 214-235 (2012) - [c91]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. CPM 2012: 220-231 - [c90]Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, Ken Satoh:
Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions. ISMIR 2012: 229-234 - [c89]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 - [c88]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM 2012: 301-312 - [c87]Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Efficient LZ78 Factorization of Grammar Compressed Text. SPIRE 2012: 86-98 - [c86]Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda:
Eager XPath Evaluation over XML Streams. SPIRE 2012: 245-250 - [c85]Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
The Position Heap of a Trie. SPIRE 2012: 360-371 - [c84]Shota Yasutake, Kohei Hatano, Eiji Takimoto, Masayuki Takeda:
Online Rank Aggregation. ACML 2012: 539-553 - [i7]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Speeding-up $q$-gram mining on grammar-based compressed texts. CoRR abs/1202.3311 (2012) - [i6]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) - [i5]Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Efficient LZ78 factorization of grammar compressed text. CoRR abs/1207.4607 (2012) - 2011
- [j20]Shin-ichi Yoshida, Kohei Hatano, Eiji Takimoto, Masayuki Takeda:
Adaptive Online Prediction Using Weighted Windows. IEICE Trans. Inf. Syst. 94-D(10): 1917-1923 (2011) - [j19]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying and enumerating parameterized border arrays. Theor. Comput. Sci. 412(50): 6959-6981 (2011) - [c83]Shirou Maruyama, Masayuki Takeda, Masaya Nakahara, Hiroshi Sakamoto:
An Online Algorithm for Lightweight Grammar-Based Compression. CCP 2011: 19-28 - [c82]Tomohiro I, Shunsuke Inenaga, Masayuki Takeda:
Palindrome Pattern Matching. CPM 2011: 232-245 - [c81]Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. CPM 2011: 309-322 - [c80]Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda:
Online Linear Optimization over Permutations. ISAAC 2011: 534-543 - [c79]Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda:
Music Genre Classification using Similarity Functions. ISMIR 2011: 693-698 - [c78]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast q-gram Mining on SLP Compressed Strings. SPIRE 2011: 278-289 - [c77]Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda:
Efficient Eager XPath Filtering over XML Streams. Stringology 2011: 30-44 - [c76]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Inferring Strings from Suffix Trees and Links on a Binary Alphabet. Stringology 2011: 121-130 - [c75]Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Longest Common Substring/Subsequence of Non-linear Texts. Stringology 2011: 197-208 - [i4]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Fast $q$-gram Mining on SLP Compressed Strings. CoRR abs/1103.3114 (2011) - [i3]Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda:
Restructuring Compressed Texts without Explicit Decompression. CoRR abs/1107.2729 (2011) - [i2]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-gram Frequencies on Collage Systems. CoRR abs/1107.3019 (2011) - [i1]Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts. CoRR abs/1107.3022 (2011) - 2010
- [j18]Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda:
Context-Sensitive Grammar Transform: Compression and Pattern Matching. IEICE Trans. Inf. Syst. 93-D(2): 219-226 (2010) - [c74]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Verifying a Parameterized Border Array in O(n1.5) Time. CPM 2010: 238-250 - [c73]Tatsuya Asai, Shin-ichiro Tago, Hiroya Inakoshi, Seishi Okamoto, Masayuki Takeda:
Chimera: Stream-Oriented XML Filtering/Querying Engine. DASFAA (2) 2010: 380-391 - [c72]Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda:
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting. Discovery Science 2010: 132-143 - [c71]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting and Verifying Maximal Palindromes. SPIRE 2010: 135-146
2000 – 2009
- 2009
- [j17]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) - [j16]Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda:
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. Int. J. Found. Comput. Sci. 20(4): 717-733 (2009) - [c70]Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Lightweight Parameterized Suffix Array Construction. IWOCA 2009: 312-323 - [c69]Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Counting Parameterized Border Arrays for a Binary Alphabet. LATA 2009: 422-433 - 2008
- [j15]Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Reachability on Suffix Tree Graphs. Int. J. Found. Comput. Sci. 19(1): 147-162 (2008) - [c68]Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masayuki Takeda:
Smooth Boosting for Margin-Based Ranking. ALT 2008: 227-239 - [c67]Kosuke Ishibashi, Kohei Hatano, Masayuki Takeda:
Online Learning of Maximum p-Norm Margin Classifiers with Bias. COLT 2008: 69-80 - [c66]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 - [c65]Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda:
Context-Sensitive Grammar Transform: Compression and Pattern Matching. SPIRE 2008: 27-38 - [c64]Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Parameterized Suffix Arrays for Binary Strings. Stringology 2008: 84-94 - [c63]Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda:
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. CIAA 2008: 201-211 - [r1]Masayuki Takeda:
Compressed Pattern Matching. Encyclopedia of Algorithms 2008 - 2007
- [c62]Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Efficient Computation of Substring Equivalence Classes with Suffix Arrays. CPM 2007: 340-351 - [c61]Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. DCC 2007: 123-132 - [c60]Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda:
Unsupervised Spam Detection Based on String Alienness Measures. Discovery Science 2007: 161-172 - [e2]Vincent Corruble, Masayuki Takeda, Einoshin Suzuki:
Discovery Science, 10th International Conference, DS 2007, Sendai, Japan, October 1-4, 2007, Proceedings. Lecture Notes in Computer Science 4755, Springer 2007, ISBN 978-3-540-75487-9 [contents] - 2006
- [c59]Tadanobu Furukawa, Yutaka Matsuo, Tomofumi Matsuzawa, Masayuki Takeda, Koki Uchiyama:
Users' Behavioral Analysis on Weblogs. AAAI Spring Symposium: Computational Approaches to Analyzing Weblogs 2006: 34-36 - [c58]Tadanobu Furukawa, Tomofumi Matsuzawa, Yutaka Matsuo, Koki Uchiyama, Masayuki Takeda:
Behavioral Analysis Based on Relations in Weblogs. ASWC 2006: 162-168 - [c57]Shunsuke Inenaga, Masayuki Takeda:
On-Line Linear-Time Construction of Word Suffix Trees. CPM 2006: 60-71 - [c56]Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
A New Family of String Classifiers Based on Local Relatedness. Discovery Science 2006: 114-124 - [c55]Shunsuke Inenaga, Masayuki Takeda:
Sparse Directed Acyclic Word Graphs. SPIRE 2006: 61-73 - [c54]Shunsuke Inenaga, Masayuki Takeda:
Sparse compact directed acyclic word graphs. Stringology 2006: 197-211 - [c53]Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Reachability on suffix tree graphs. Stringology 2006: 212-225 - 2005
- [j14]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) - [j13]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) - [c52]Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda:
Practical Algorithms for Pattern Based Linear Regression. Discovery Science 2005: 44-56 - [c51]Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Fully Incremental LCS Computation. FCT 2005: 563-574 - [c50]Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto:
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices. GECCO 2005: 1485-1492 - [c49]Tetsuro Kitahara, Katsuhisa Ishida, Masayuki Takeda:
ism: Improvisation Supporting Systems with Melody Correction and Key Vibration. ICEC 2005: 315-327 - [c48]Tadanobu Furukawa, Tomofumi Matsuzawa, Yutaka Matsuo, Koki Uchiyama, Masayuki Takeda:
Analysis of User's Relation and Reading Activity in Weblogs. JSAI Workshops 2005: 280-290 - [c47]Hisashi Tsuji, Akira Ishino, Masayuki Takeda:
A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's. SPIRE 2005: 388-398 - 2004
- [j12]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) - [j11]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) - [j10]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) - [j9]Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary directed acyclic word graphs. Theor. Comput. Sci. 328(1-2): 97-111 (2004) - [c46]Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda:
On Bit-Parallel Processing of Multi-byte Text. AIRS 2004: 289-300 - [c45]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 - [c44]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 - [c43]Katsuhisa Ishida, Tetsuro Kitahara, Masayuki Takeda:
ism: Improvisation Supporting System based on Melody Correction. NIME 2004: 177-180 - [c42]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. Stringology 2004: 98-113 - [c41]Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano:
Finding Optimal Pairs of Patterns. WABI 2004: 450-462 - 2003
- [j8]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) - [j7]Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda:
Uniform characterizations of polynomial-query learnabilities. Theor. Comput. Sci. 292(2): 377-385 (2003) - [j6]Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A practical algorithm to find the best subsequence patterns. Theor. Comput. Sci. 292(2): 465-479 (2003) - [j5]Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri, Mayumi Yamasaki, Kouichi Tamari:
Discovering instances of poetic allusion from anthologies of classical Japanese poems. Theor. Comput. Sci. 292(2): 497-524 (2003) - [j4]Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri:
Discovering characteristic expressions in literary works. Theor. Comput. Sci. 292(2): 525-546 (2003) - [j3]Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Collage system: a unifying framework for compressed pattern matching. Theor. Comput. Sci. 298(1): 253-272 (2003) - [c40]Tomohiko Sugimachi, Akira Ishino, Masayuki Takeda, Fumihiro Matsuo:
A Method of Extracting Related Words Using Standardized Mutual Information. Discovery Science 2003: 478-485 - [c39]Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa:
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. Discovery Science 2003: 486-493 - [c38]Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda:
On the Length of the Minimum Solution of Word Equations in One Variable. MFCS 2003: 189-197 - [c37]Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda:
Inferring Strings from Graphs and Arrays. MFCS 2003: 208-217 - [c36]Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara:
Linear-Time Off-Line Text Compression by Longest-First Substitution. SPIRE 2003: 137-152 - [c35]Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara:
Ternary Directed Acyclic Word Graphs. CIAA 2003: 120-130 - 2002
- [c34]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 - [c33]Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Discovering Best Variable-Length-Don't-Care Patterns. Discovery Science 2002: 86-97 - [c32]Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga:
Finding Best Patterns Practically. Progress in Discovery Science 2002: 307-317 - [c31]Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri:
Mining from Literary Texts: Pattern Discovery and Similarity Computation. Progress in Discovery Science 2002: 518-531 - [c30]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 - [c29]Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa:
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. SPIRE 2002: 170-186 - [c28]Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compact Directed Acyclic Word Graphs for a Sliding Window. SPIRE 2002: 310-324 - [c27]Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa:
A Note on Randomized Algorithm for String Matching with Mismatches. Stringology 2002: 9-17 - [e1]Alberto Apostolico, Masayuki Takeda:
Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings. Lecture Notes in Computer Science 2373, Springer 2002, ISBN 3-540-43862-9 [contents] - 2001
- [c26]Masayuki Takeda:
String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music. CPM 2001: 147-151 - [c25]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 - [c24]Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Multiple Pattern Matching Algorithms on Collage System. CPM 2001: 193-206 - [c23]Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Faster Approximate String Matching over Compressed Text. Data Compression Conference 2001: 459-468 - [c22]Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Compressed Pattern Matching for SEQUITUR. Data Compression Conference 2001: 469- - [c21]Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, Ichiro Nanri:
Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems. Discovery Science 2001: 416-428 - [c20]Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A Practical Algorithm to Find the Best Episode Patterns. Discovery Science 2001: 435-440 - [c19]Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara:
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. ISAAC 2001: 719-730 - [c18]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. SPIRE 2001: 96-110 - [c17]T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo:
Musical Sequence Comparison for Melodic and Rhythmic Similarities. SPIRE 2001: 111-122 - [c16]Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Construction of the CDAWG for a Trie. Stringology 2001: 37-48 - 2000
- [j2]Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri:
Discovery Characteristic Patterns from Collections of Classical Japanese Poems. New Gener. Comput. 18(1): 61-74 (2000) - [c15]Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa:
Speeding Up Pattern Matching by Text Compression. CIAC 2000: 306-315 - [c14]Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
A Boyer-Moore Type Algorithm for Compressed Pattern Matching. CPM 2000: 181-194 - [c13]Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri:
Discovering Characteristic Expressions from Literary Works: A New Text Analysis Method beyond N-Gram Statistics and KWIC. Discovery Science 2000: 112-126 - [c12]Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
A Practical Algorithm to Find the Best Subsequence Patterns. Discovery Science 2000: 141-154 - [c11]Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. SPIRE 2000: 132-138 - [c10]Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
Online Construction of Subsequence Automata for Multiple Texts. SPIRE 2000: 146-152 - [c9]Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Bit-Parallel Approach to Approximate String Matching in Compressed Texts. SPIRE 2000: 221-228
1990 – 1999
- 1999
- [c8]Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Shift-And Approach to Pattern Matching in LZW Compressed Text. CPM 1999: 1-13 - [c7]Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
Pattern Matching in Text Compressed by Using Antidictionaries. CPM 1999: 37-49 - [c6]Kouichi Tamari, Mayumi Yamasaki, Takuya Kida, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri:
Discovering Poetic Allusion in Anthologies of Classical Japanese Poems. Discovery Science 1999: 128-138 - [c5]Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa:
A Unifying Framework for Compressed Pattern Matching. SPIRE/CRIWG 1999: 89-96 - 1998
- [c4]Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa:
Multiple Pattern Matching in LZW Compressed Text. Data Compression Conference 1998: 103-112 - [c3]Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda:
Uniform Characterizations of Polynomial-Query Learnabilities. Discovery Science 1998: 84-92 - [c2]Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri:
Discovering Characteristic Patterns from Collections of Classical Japanese Poems. Discovery Science 1998: 129-140 - 1997
- [c1]Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda:
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. CPM 1997: 1-11 - 1993
- [j1]Noriyoshi Uratani, Masayuki Takeda:
A Fast String-Searching Algorithm for Multiple Patterns. Inf. Process. Manag. 29(6): 775-792 (1993)
Coauthor Index
[c163] [j48] [i49] [j47] [j46] [j45] [j44] [j43] [j42] [i48] [j41] [j40] [j39] [c161] [c160] [c159] [i47] [i46] [i45] [j38] [j36] [j35] [c156] [c155] [c154] [c153] [c152] [c151] [c150] [i42] [i41] [i40] [i39] [i38] [i37] [i36] [i35] [j34] [c149] [c148] [c147] [c146] [c144] [c143] [c141] [c140] [c139] [c138] [i34] [i33] [i32] [i31] [i30] [i29] [i28] [i27] [i26] [j33] [c137] [c136] [c135] [c134] [c133] [c132] [c131] [c130] [i25] [i24] [j32] [j31] [j30] [c129] [c128] [c127] [c126] [c125] [c124] [c123] [c122] [i23] [i22] [i21] [i20] [j29] [j28] [c121] [c120] [c118] [c117] [c116] [c115] [c114] [c113] [i19] [i18] [i17] [i16] [i15] [j27] [j26] [j25] [c112] [c111] [c110] [c108] [c107] [c106] [c105] [i14] [i13] [j24] [c104] [c103] [c102] [c101] [c100] [i12] [j23] [c99] [c98] [c97] [c96] [c95] [c94] [c93] [c92] [i11] [i10] [i9] [i8] [c91] [c90] [c89] [c88] [c87] [c86] [c85] [i7] [i6] [i5] [j19] [c81] [c79] [c78] [c77] [c76] [c75] [i4] [i3] [i2] [i1] [c74] [c72] [c71] [j17] [c70] [c69] [j15] [c66] [c64] [c62] [c61] [c60] [c56] [c53] [c52] [j12] [j10] [c45] [c41] [c39] [c37] [c33] [c30]
[c163] [j48] [i49] [j47] [j46] [j45] [j44] [j43] [j42] [i48] [j41] [j40] [j39] [c161] [c160] [c159] [c158] [c157] [i47] [i46] [i45] [i44] [i43] [j38] [j36] [j35] [c156] [c155] [c154] [c153] [c152] [c151] [c150] [i42] [i41] [i40] [i39] [i38] [i37] [i36] [i35] [j34] [c149] [c148] [c147] [c146] [c144] [c143] [c141] [c140] [c139] [c138] [i34] [i33] [i32] [i31] [i30] [i29] [i28] [i27] [i26] [j33] [c137] [c136] [c135] [c134] [c133] [c132] [c131] [c130] [i25] [i24] [j32] [j31] [j30] [c129] [c128] [c127] [c126] [c125] [c124] [c123] [c122] [i23] [i22] [i21] [i20] [j29] [j28] [c121] [c120] [c118] [c117] [c116] [c115] [c114] [c113] [i19] [i18] [i17] [i16] [i15] [j27] [j26] [j25] [c112] [c111] [c110] [c108] [c107] [c106] [c105] [i14] [i13] [j24] [c104] [c103] [c102] [c101] [c100] [i12] [j23] [j22] [c99] [c98] [c97] [c96] [c95] [c94] [c93] [c92] [i11] [i10] [i9] [i8] [c91] [c88] [c87] [c85] [i7] [i6] [i5] [j19] [c82] [c81] [c78] [c76] [c75] [i4] [i3] [i2] [i1] [c74] [c71] [j17] [c70] [c69] [j15] [c66] [c64] [c62] [c61] [c57] [c56] [c55] [c54] [c53] [j14] [j13] [c52] [c51] [j12] [j11] [j9] [c45] [c44] [c42] [j8] [c39] [c37] [c36] [c35] [c34] [c33] [c32] [c30] [c28] [c27] [c25] [c20] [c18] [c16]
[c163] [j47] [j46] [j45] [j44] [j43] [j42] [i48] [j41] [j40] [j39] [c161] [c160] [c159] [c158] [c157] [i47] [i46] [i45] [i44] [i43] [j36] [j35] [c156] [c155] [c154] [c153] [c152] [c151] [c150] [i42] [i41] [i40] [i39] [i38] [i37] [i36] [i35] [j34] [c149] [c148] [c147] [c146] [c144] [c143] [c141] [c140] [c139] [c138] [i34] [i33] [i32] [i31] [i30] [i29] [i28] [i27] [i26] [j33] [c137] [c136] [c134] [c133] [c132] [c131] [c130] [i25] [i24] [j31] [j30] [c127] [c126] [c122] [j29] [c114] [i16] [j26] [c107] [c105] [i14] [c103] [i12] [c98] [c94] [i10] [c85]
[j42] [c156] [c155] [i41] [i40] [r2] [j27] [c95] [i9] [j17] [j14] [j13] [c51] [j12] [j11] [j10] [j9] [c46] [c45] [c44] [c42] [c41] [j8] [j7] [j6] [j3] [c39] [c38] [c37] [c36] [c35] [c34] [c33] [c32] [c30] [c29] [c28] [c27] [c25] [c24] [c23] [c22] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c14] [c12] [c11] [c10] [c9] [c8] [c7] [c5] [c4] [c3] [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 2024-10-07 21:25 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:
