Masayuki Takeda

266 papers A* 2A 2B 77C 47Misc 19Journal 99Unranked 18
YearRankTypeTitle / Venue / Authors
2026 J jnl
Online Computation of Palindromes and Suffix Trees on Tries.
CoRR
Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno, Masakazu Ishihata, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2025 J jnl
Computing maximal palindromes in non-standard matching models.
Inf. Comput.
Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2024 C conf
Computing Maximal Palindromes in Non-standard Matching Models.
IWOCA
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2023 J jnl
Linear-time Computation of DAWGs, Symmetric Indexing Structures, and MAWs for Integer Alphabets.
CoRR
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2023 J jnl
Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets.
Theor. Comput. Sci.
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Combinatorics of minimal absent words for a sliding window.
Theor. Comput. Sci.
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Computing Minimal Unique Substrings for a Sliding Window.
Algorithmica
Takuya Mieno, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Computing maximal generalized palindromes.
CoRR
Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Factorizing Strings into Repetitions.
Theory Comput. Syst.
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Palindromic trees for a sliding window and its applications.
Inf. Process. Lett.
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2022 J jnl
Parameterized DAWGs: Efficient constructions and bidirectional pattern searches.
Theor. Comput. Sci.
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2022 — conf
Wavelength characteristics of Nb2O5micro-ring resonators.
OECC/PSC
Naoki Sawayanagi, Ryousuke Nakada, Yoshiki Hayama, Naoya Katsumata, Yuki Shimamura, Takumi Hinata, Masayuki Takeda, Katsumi Nakatsuhara
2022 J jnl
c-trie++: A dynamic trie tailored for fast prefix searches.
Inf. Comput.
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Combinatorics of minimal absent words for a sliding window.
CoRR
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Compressed Communication Complexity of Hamming Distance.
Algorithms
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Compressed Communication Complexity of Hamming Distance.
CoRR
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Computing longest palindromic substring after single-character or block-wise edits.
Theor. Comput. Sci.
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 Misc conf
Counting Lyndon Subsequences.
PSC
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021 J jnl
Counting Lyndon Subsequences.
CoRR
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021 J jnl
Efficiently computing runs on a trie.
Theor. Comput. Sci.
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 J jnl
Grammar Index By Induced Suffix Sorting.
CoRR
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 C conf
Grammar Index by Induced Suffix Sorting.
SPIRE
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 C conf
Longest Common Rollercoasters.
SPIRE
Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 C conf
On the Approximation Ratio of LZ-End to LZ77.
SPIRE
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021 J jnl
On the approximation ratio of LZ-End to LZ77.
CoRR
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Masayuki Takeda
2021 C conf
The Parameterized Suffix Tray.
CIAC
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
Masayuki Takeda, Nobuyuki Yamasaki
2020 J jnl
Computing Palindromic Trees for a Sliding Window and Its Applications.
CoRR
Takuya Mieno, Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 B conf
DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.
CPM
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020 J jnl
DAWGs for parameterized matching: online construction and related indexing structures.
CoRR
Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
2020 B conf
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.
CPM
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020 J jnl
Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences.
CoRR
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
2020 J jnl
Dynamic index and LZ factorization in compressed space.
Discret. Appl. Math.
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings.
Theory Comput. Syst.
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 B conf
Faster STR-EC-LCS Computation.
SOFSEM
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Faster STR-EC-LCS Computation.
CoRR
Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Grammar-compressed Self-index with Lyndon Words.
CoRR
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 B conf
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
SOFSEM
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 C conf
On Repetitiveness Measures of Thue-Morse Words.
SPIRE
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
On repetitiveness measures of Thue-Morse words.
CoRR
Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Space-efficient algorithms for computing minimal/shortest unique substrings.
Theor. Comput. Sci.
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
The Parameterized Suffix Tray.
CoRR
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 C conf
Towards Efficient Interactive Computation of Dynamic Time Warping Distance.
SPIRE
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 J jnl
Towards Efficient Interactive Computation of Dynamic Time Warping Distance.
CoRR
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2020 B conf
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches.
DCC
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 B conf
An Improved Data Structure for Left-Right Maximal Generic Words Problem.
ISAAC
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
Compact Data Structures for Shortest Unique Substring Queries.
SPIRE
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Compact Data Structures for Shortest Unique Substring Queries.
CoRR
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 Misc conf
Computing Maximal Palindromes and Distinct Palindromes in a Trie.
PSC
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 B conf
Computing Runs on a Trie.
CPM
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Computing runs on a trie.
CoRR
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.
SPIRE
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets.
CoRR
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Dynamic Packed Compact Tries Revisited.
CoRR
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 — conf
Fabrication of Nb2O5 horizontal slot waveguide structures.
OECC/PSC
Yoshiki Hayama, Shinta Uchibori, Katsumi Nakatsuhara, Masayuki Takeda, Takeshi Nishizawa
2019 B conf
Faster Queries for Longest Substring Palindrome After Block Edit.
CPM
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Faster queries for longest substring palindrome after block edit.
CoRR
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 — conf
Finding the Maximum Number of Symbols for the 4b/10b Line Code with Error Correction.
CANDAR Workshops
Masayuki Takeda, Nobuyuki Yamasaki
2019 J jnl
Minimal Unique Substrings and Minimal Absent Words in a Sliding Window.
CoRR
Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
On Longest Common Property Preserved Substring Queries.
SPIRE
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019 J jnl
On Longest Common Property Preserved Substring Queries.
CoRR
Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka
2019 B conf
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations.
CPM
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
On the size of the smallest alphabet for Lyndon trees.
Theor. Comput. Sci.
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.
IWOCA
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings.
CoRR
Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 C conf
The Parameterized Position Heap of a Trie.
CIAC
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2019 J jnl
The Parameterized Position Heap of a Trie.
CoRR
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 J jnl
Algorithms and combinatorial properties on shortest unique palindromic substrings.
J. Discrete Algorithms
Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 B conf
Computing longest common square subsequences.
CPM
Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda
2018 B conf
Faster Online Elastic Degenerate String Matching.
CPM
Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 B conf
Longest Lyndon Substring After Edit.
CPM
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 B conf
Longest substring palindrome after edit.
CPM
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 B conf
Lyndon Factorization of Grammar Compressed Texts Revisited.
CPM
Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 Misc conf
O(n log n)-time Text Compression by LZ-style Longest First Substitution.
PSC
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 J jnl
O(n log n)-time text compression by LZ-style longest first substitution.
CoRR
Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 C conf
Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays.
SPIRE
Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 Misc conf
Right-to-left Online Construction of Parameterized Position Heaps.
PSC
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2018 J jnl
Right-to-left online construction of parameterized position heaps.
CoRR
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings.
ISAAC
Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 C conf
Computing Abelian String Regularities Based on RLE.
IWOCA
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Computing Abelian regularities on RLE strings.
CoRR
Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
Algorithmica
Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Faster STR-IC-LCS Computation via RLE.
CPM
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Faster STR-IC-LCS computation via RLE.
CoRR
Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Inferring strings from Lyndon factorization.
Theor. Comput. Sci.
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 Misc conf
On Reverse Engineering the Lyndon Tree.
PSC
Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 C conf
Order Preserving Pattern Matching on Trees and DAGs.
SPIRE
Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 J jnl
Order preserving pattern matching on trees and DAGs.
CoRR
Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 C conf
Shortest Unique Palindromic Substring Queries in Optimal Time.
IWOCA
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2017 B conf
Small-Space LCE Data Structure with Constant-Time Queries.
MFCS
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2017 J jnl
Small-space encoding LCE data structure with constant-time queries.
CoRR
Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2017 J jnl
The "Runs" Theorem.
SIAM J. Comput.
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2017 B conf
Tight Bounds on the Maximum Number of Shortest Unique Substrings.
CPM
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 — conf
A Guidance System for Wide-area Complex Disaster Evacuation based on Ant Colony Optimization.
ICAART (1)
Hirotaka Goto, Asuka Ohta, Tomofumi Matsuzawa, Munehiro Takimoto, Yasushi Kambayashi, Masayuki Takeda
2016 B conf
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets.
MFCS
Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 Misc conf
Computing Smallest and Largest Repetition Factorizations in
PSC
Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 B conf
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.
CPM
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
2016 J jnl
Deterministic sub-linear space LCE data structures with efficient construction.
CoRR
Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda
2016 Misc conf
Dynamic Index and LZ Factorization in Compressed Space.
PSC
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Dynamic index and LZ factorization in compressed space.
CoRR
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 B conf
Factorizing a String into Squares in Linear Time.
CPM
Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea
2016 J jnl
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.
Theor. Comput. Sci.
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 C conf
Finding Gapped Palindromes Online.
IWOCA
Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 B conf
Fully Dynamic Data Structure for LCE Queries in Compressed Space.
MFCS
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Fully dynamic data structure for LCE queries in compressed space.
CoRR
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Generalized pattern matching and periodicity under substring consistent equivalence relations.
Theor. Comput. Sci.
Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 — ch.
Pattern Matching on Compressed Text.
Encyclopedia of Algorithms
Masayuki Takeda, Ayumi Shinohara
2016 B conf
Shortest Unique Substring Queries on Run-Length Encoded Strings.
MFCS
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Shortest unique palindromic substring queries in optimal time.
CoRR
Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2016 J jnl
Tight bound on the maximum number of shortest unique substrings.
CoRR
Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 C conf
A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.
SPIRE
Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 A* conf
A new characterization of maximal repetitions by Lyndon trees.
SODA
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2015 C conf
An Improved Evacuation Guidance System Based on Ant Colony Optimization.
IES
Asuka Ohta, Hirotaka Goto, Tomofumi Matsuzawa, Munehiro Takimoto, Yasushi Kambayashi, Masayuki Takeda
2015 C conf
An Opportunistic Text Indexing Structure Based on Run Length Encoding.
CIAC
Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Compressed automata for dictionary matching.
Theor. Comput. Sci.
Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 Misc conf
Computing Left-Right Maximal Generic Words.
PSC
Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets.
CoRR
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Constructing LZ78 tries and position heaps in linear time for large alphabets.
Inf. Process. Lett.
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 J jnl
Detecting regularities on grammar-compressed strings.
Inf. Comput.
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2015 J jnl
Dynamic index, LZ factorization, and LCE queries in compressed space.
CoRR
Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 B conf
Inferring Strings from Full Abelian Periods.
ISAAC
Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2015 B conf
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding.
CPM
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2015 B conf
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree.
CPM
Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 J jnl
A new characterization of maximal repetitions by Lyndon trees.
CoRR
Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta
2014 Misc conf
Computing Abelian Covers and Abelian Runs.
PSC
Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 B conf
Computing Palindromic Factorizations and Palindromic Covers On-line.
CPM
Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 A conf
Faster Compact On-Line Lempel-Ziv Factorization.
STACS
Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2014 — conf
Inferring Strings from Lyndon Factorization.
MFCS (2)
Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 J jnl
Inferring strings from suffix trees and links on a binary alphabet.
Discret. Appl. Math.
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2014 B conf
Shortest Unique Substrings Queries in Optimal Time.
SOFSEM
Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 C conf
Compressed Automata for Dictionary Matching.
CIAA
Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 B conf
Computing Convolution on Grammar-Compressed Text.
DCC
Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 Misc conf
Computing Reversed Lempel-Ziv Factorization Online.
PSC
Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 J jnl
Computing convolution on grammar-compressed text
CoRR
Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 B conf
Converting SLP to LZ78 in almost Linear Time.
CPM
Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda
2013 B conf
Detecting Regularities on Grammar-Compressed Strings.
MFCS
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013 J jnl
Detecting regularities on grammar-compressed strings
CoRR
Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
2013 B conf
Efficient Lyndon Factorization of Grammar Compressed Text.
CPM
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 J jnl
Efficient Lyndon factorization of grammar compressed text
CoRR
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 J jnl
Fast q-gram mining on SLP compressed strings.
J. Discrete Algorithms
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2013 J jnl
Faster Compact On-Line Lempel-Ziv Factorization
CoRR
Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2013 C conf
Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text.
SPIRE
Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 B conf
From Run Length Encoding to LZ78 and Back Again.
DCC
Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2013 J jnl
Palindrome pattern matching.
Theor. Comput. Sci.
Tomohiro I, Shunsuke Inenaga, Masayuki Takeda
2012 J jnl
An Online Algorithm for Lightweight Grammar-Based Compression.
Algorithms
Shirou Maruyama, Hiroshi Sakamoto, Masayuki Takeda
2012 B conf
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts.
SOFSEM
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 C conf
Eager XPath Evaluation over XML Streams.
SPIRE
Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda
2012 C conf
Efficient LZ78 Factorization of Grammar Compressed Text.
SPIRE
Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 J jnl
Efficient LZ78 factorization of grammar compressed text
CoRR
Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 — conf
General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.
ECML/PKDD (2)
Tomohiro I, Yuki Enokuma, Hideo Bannai, Masayuki Takeda
2012 C conf
Online Rank Aggregation.
ACML
Shota Yasutake, Kohei Hatano, Eiji Takimoto, Masayuki Takeda
2012 — conf
Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions.
ISMIR
Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, Ken Satoh
2012 B conf
Speeding Up q-Gram Mining on Grammar-Based Compressed Texts.
CPM
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 J jnl
Speeding-up $q$-gram mining on grammar-based compressed texts
CoRR
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2012 C conf
The Position Heap of a Trie.
SPIRE
Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2012 J jnl
Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding
CoRR
Jun-ichi Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 J jnl
Adaptive Online Prediction Using Weighted Windows.
IEICE Trans. Inf. Syst.
Shin-ichi Yoshida, Kohei Hatano, Eiji Takimoto, Masayuki Takeda
2011 — conf
An Online Algorithm for Lightweight Grammar-Based Compression.
CCP
Shirou Maruyama, Masayuki Takeda, Masaya Nakahara, Hiroshi Sakamoto
2011 Misc conf
Computing Longest Common Substring/Subsequence of Non-linear Texts.
PSC
Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2011 J jnl
Computing q-gram Frequencies on Collage Systems
CoRR
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 J jnl
Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts
CoRR
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 Misc conf
Efficient Eager XPath Filtering over XML Streams.
PSC
Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda
2011 J jnl
Fast $q$-gram Mining on SLP Compressed Strings
CoRR
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 C conf
Fast q-gram Mining on SLP Compressed Strings.
SPIRE
Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 B conf
Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts.
CPM
Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2011 Misc conf
Inferring Strings from Suffix Trees and Links on a Binary Alphabet.
PSC
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2011 — conf
Music Genre Classification using Similarity Functions.
ISMIR
Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda
2011 B conf
Online Linear Optimization over Permutations.
ISAAC
Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda
2011 B conf
Palindrome Pattern Matching.
CPM
Tomohiro I, Shunsuke Inenaga, Masayuki Takeda
2011 J jnl
Restructuring Compressed Texts without Explicit Decompression
CoRR
Keisuke Goto, Shirou Maruyama, Shunsuke Inenaga, Hideo Bannai, Hiroshi Sakamoto, Masayuki Takeda
2011 J jnl
Verifying and enumerating parameterized border arrays.
Theor. Comput. Sci.
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2010 — conf
Chimera: Stream-Oriented XML Filtering/Querying Engine.
DASFAA (2)
Tatsuya Asai, Shin-ichiro Tago, Hiroya Inakoshi, Seishi Okamoto, Masayuki Takeda
2010 J jnl
Context-Sensitive Grammar Transform: Compression and Pattern Matching.
IEICE Trans. Inf. Syst.
Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda
2010 C conf
Counting and Verifying Maximal Palindromes.
SPIRE
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2010 B conf
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting.
Discovery Science
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda
2010 B conf
Verifying a Parameterized Border Array in
CPM
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2009 J jnl
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.
Int. J. Found. Comput. Sci.
Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda
2009 C conf
Counting Parameterized Border Arrays for a Binary Alphabet.
LATA
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2009 C conf
Lightweight Parameterized Suffix Array Construction.
IWOCA
Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2009 J jnl
Linear-Time Text Compression by Longest-First Substitution.
Algorithms
Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
2008 C conf
A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.
CIAA
Tetsuya Matsumoto, Kazuhito Hagio, Masayuki Takeda
2008 — ch.
Compressed Pattern Matching.
Encyclopedia of Algorithms
Masayuki Takeda
2008 C conf
Context-Sensitive Grammar Transform: Compression and Pattern Matching.
SPIRE
Shirou Maruyama, Youhei Tanaka, Hiroshi Sakamoto, Masayuki Takeda
2008 A* conf
Online Learning of Maximum p-Norm Margin Classifiers with Bias.
COLT
Kosuke Ishibashi, Kohei Hatano, Masayuki Takeda
2008 Misc conf
Parameterized Suffix Arrays for Binary Strings.
PSC
Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2008 J jnl
Reachability on Suffix Tree Graphs.
Int. J. Found. Comput. Sci.
Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2008 B conf
Smooth Boosting for Margin-Based Ranking.
ALT
Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, Masayuki Takeda
2008 B conf
String Kernels Based on Variable-Length-Don't-Care Patterns.
Discovery Science
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
2007 B ed.
Discovery Science, 10th International Conference, DS 2007, Sendai, Japan, October 1-4, 2007, Proceedings
Discovery Science
Vincent Corruble, Masayuki Takeda, Einoshin Suzuki
2007 B conf
Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
CPM
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2007 B conf
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution.
DCC
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2007 B conf
Unsupervised Spam Detection Based on String Alienness Measures.
Discovery Science
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda
2006 B conf
A New Family of String Classifiers Based on Local Relatedness.
Discovery Science
Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2006 — conf
Behavioral Analysis Based on Relations in Weblogs.
ASWC
Tadanobu Furukawa, Tomofumi Matsuzawa, Yutaka Matsuo, Koki Uchiyama, Masayuki Takeda
2006 B conf
On-Line Linear-Time Construction of Word Suffix Trees.
CPM
Shunsuke Inenaga, Masayuki Takeda
2006 Misc conf
Reachability on suffix tree graphs.
PSC
Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
2006 C conf
Sparse Directed Acyclic Word Graphs.
SPIRE
Shunsuke Inenaga, Masayuki Takeda
2006 Misc conf
Sparse compact directed acyclic word graphs.
PSC
Shunsuke Inenaga, Masayuki Takeda
2006 — conf
Users' Behavioral Analysis on Weblogs.
AAAI Spring Symposium: Computational Approaches to Analyzing Weblogs
Tadanobu Furukawa, Yutaka Matsuo, Tomofumi Matsuzawa, Masayuki Takeda, Koki Uchiyama
2005 C conf
A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's.
SPIRE
Hisashi Tsuji, Akira Ishino, Masayuki Takeda
2005 A conf
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices.
GECCO
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto
2005 J jnl
A fully compressed pattern matching algorithm for simple collage systems.
Int. J. Found. Comput. Sci.
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2005 — conf
Analysis of User's Relation and Reading Activity in Weblogs.
JSAI Workshops
Tadanobu Furukawa, Tomofumi Matsuzawa, Yutaka Matsuo, Koki Uchiyama, Masayuki Takeda
2005 B conf
Fully Incremental LCS Computation.
FCT
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2005 J jnl
On-line construction of compact directed acyclic word graphs.
Discret. Appl. Math.
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
2005 B conf
Practical Algorithms for Pattern Based Linear Regression.
Discovery Science
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
2005 C conf
ism: Improvisation Supporting Systems with Melody Correction and Key Vibration.
ICEC
Tetsuro Kitahara, Katsuhisa Ishida, Masayuki Takeda
2004 Misc conf
A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems.
PSC
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2004 C conf
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.
Developments in Language Theory
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2004 J jnl
An O(N
IEEE ACM Trans. Comput. Biol. Bioinform.
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004 J jnl
Compact directed acyclic word graphs for a sliding window.
J. Discrete Algorithms
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2004 J jnl
Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.
J. Bioinform. Comput. Biol.
Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano
2004 B conf
Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
Discovery Science
Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004 C conf
Finding Optimal Pairs of Patterns.
WABI
Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
2004 — conf
On Bit-Parallel Processing of Multi-byte Text.
AIRS
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda
2004 J jnl
Ternary directed acyclic word graphs.
Theor. Comput. Sci.
Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
2004 — conf
ism: Improvisation Supporting System based on Melody Correction.
NIME
Katsuhisa Ishida, Tetsuro Kitahara, Masayuki Takeda
2003 B conf
A Method of Extracting Related Words Using Standardized Mutual Information.
Discovery Science
Tomohiko Sugimachi, Akira Ishino, Masayuki Takeda, Fumihiro Matsuo
2003 J jnl
A Note on Randomized Algorithm for String Matching with Mismatches.
Nord. J. Comput.
Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
2003 J jnl
A practical algorithm to find the best subsequence patterns.
Theor. Comput. Sci.
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2003 J jnl
Collage system: a unifying framework for compressed pattern matching.
Theor. Comput. Sci.
Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2003 B conf
Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.
Discovery Science
Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa
2003 J jnl
Discovering characteristic expressions in literary works.
Theor. Comput. Sci.
Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri
2003 J jnl
Discovering instances of poetic allusion from anthologies of classical Japanese poems.
Theor. Comput. Sci.
Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri, Mayumi Yamasaki, Kouichi Tamari
2003 B conf
Inferring Strings from Graphs and Arrays.
MFCS
Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
2003 C conf
Linear-Time Off-Line Text Compression by Longest-First Substitution.
SPIRE
Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
2003 B conf
On the Length of the Minimum Solution of Word Equations in One Variable.
MFCS
Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda
2003 C conf
Ternary Directed Acyclic Word Graphs.
CIAA
Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
2003 J jnl
Uniform characterizations of polynomial-query learnabilities.
Theor. Comput. Sci.
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
2002 Misc conf
A Note on Randomized Algorithm for String Matching with Mismatches.
PSC
Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
2002 B ed.
Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings
CPM
Alberto Apostolico, Masayuki Takeda
2002 C conf
Compact Directed Acyclic Word Graphs for a Sliding Window.
SPIRE
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2002 B conf
Discovering Best Variable-Length-Don't-Care Patterns.
Discovery Science
Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2002 — conf
Finding Best Patterns Practically.
Progress in Discovery Science
Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga
2002 — conf
Mining from Literary Texts: Pattern Discovery and Similarity Computation.
Progress in Discovery Science
Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri
2002 C conf
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
SPIRE
Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa
2002 B conf
Space-Economical Construction of Index Structures for All Suffixes of a String.
MFCS
Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
2002 B conf
The Minimum DAWG for All Suffixes of a String and Its Applications.
CPM
Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
2001 B conf
A Practical Algorithm to Find the Best Episode Patterns.
Discovery Science
Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001 B conf
Compressed Pattern Matching for SEQUITUR.
Data Compression Conference
Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001 Misc conf
Construction of the CDAWG for a Trie.
PSC
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001 B conf
Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems.
Discovery Science
Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, Ichiro Nanri
2001 B conf
Faster Approximate String Matching over Compressed Text.
Data Compression Conference
Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2001 B conf
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.
ISAAC
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara
2001 B conf
Multiple Pattern Matching Algorithms on Collage System.
CPM
Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2001 C conf
Musical Sequence Comparison for Melodic and Rhythmic Similarities.
SPIRE
T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo
2001 B conf
On-Line Construction of Compact Directed Acyclic Word Graphs.
CPM
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
2001 C conf
On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
SPIRE
Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2001 B conf
String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music.
CPM
Masayuki Takeda
2000 B conf
A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
CPM
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2000 B conf
A Practical Algorithm to Find the Best Subsequence Patterns.
Discovery Science
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2000 C conf
Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
SPIRE
Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
2000 B conf
Discovering Characteristic Expressions from Literary Works: A New Text Analysis Method beyond N-Gram Statistics and KWIC.
Discovery Science
Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri
2000 J jnl
Discovery Characteristic Patterns from Collections of Classical Japanese Poems.
New Gener. Comput.
Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri
2000 C conf
Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.
SPIRE
Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2000 C conf
Online Construction of Subsequence Automata for Multiple Texts.
SPIRE
Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
2000 C conf
Speeding Up Pattern Matching by Text Compression.
CIAC
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa
1999 — conf
A Unifying Framework for Compressed Pattern Matching.
SPIRE/CRIWG
Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
1999 B conf
Discovering Poetic Allusion in Anthologies of Classical Japanese Poems.
Discovery Science
Kouichi Tamari, Mayumi Yamasaki, Takuya Kida, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri
1999 B conf
Pattern Matching in Text Compressed by Using Antidictionaries.
CPM
Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
1999 B conf
Shift-And Approach to Pattern Matching in LZW Compressed Text.
CPM
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
1998 B conf
Discovering Characteristic Patterns from Collections of Classical Japanese Poems.
Discovery Science
Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri
1998 B conf
Multiple Pattern Matching in LZW Compressed Text.
Data Compression Conference
Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa
1998 B conf
Uniform Characterizations of Polynomial-Query Learnabilities.
Discovery Science
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
1997 B conf
An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs.
CPM
Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda
1993 J jnl
A Fast String-Searching Algorithm for Multiple Patterns.
Inf. Process. Manag.
Noriyoshi Uratani, Masayuki Takeda