A Fast String-Searching Algorithm for Multiple Patterns. - Noriyoshi Uratani; Masayuki Takeda (Inf. Process. Manag., 1993)

An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. - Masamichi Miyazaki; Ayumi Shinohara; Masayuki Takeda (CPM, 1997)

Multiple Pattern Matching in LZW Compressed Text. - Takuya Kida; Masayuki Takeda; Ayumi Shinohara; Masamichi Miyazaki; Setsuo Arikawa (Data Compression Conference, 1998)

Discovering Characteristic Patterns from Collections of Classical Japanese Poems. - Mayumi Yamasaki; Masayuki Takeda; Tomoko Fukuda; Ichiro Nanri (Discovery Science, 1998)

Shift-And Approach to Pattern Matching in LZW Compressed Text. - Takuya Kida; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (CPM, 1999)

Pattern Matching in Text Compressed by Using Antidictionaries. - Yusuke Shibata; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (CPM, 1999)

Discovering Poetic Allusion in Anthologies of Classical Japanese Poems. - Kouichi Tamari; Mayumi Yamasaki; Takuya Kida; Masayuki Takeda; Tomoko Fukuda; Ichiro Nanri (Discovery Science, 1999)

A Unifying Framework for Compressed Pattern Matching. - Takuya Kida; Yusuke Shibata; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (SPIRE/CRIWG, 1999)

Speeding Up Pattern Matching by Text Compression. - Yusuke Shibata; Takuya Kida; Shuichi Fukamachi; Masayuki Takeda; Ayumi Shinohara; Takeshi Shinohara; Setsuo Arikawa (CIAC, 2000)

A Boyer-Moore Type Algorithm for Compressed Pattern Matching. - Yusuke Shibata; Tetsuya Matsumoto; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (CPM, 2000)

Discovering Characteristic Expressions from Literary Works: A New Text Analysis Method beyond N-Gram Statistics and KWIC. - Masayuki Takeda; Tetsuya Matsumoto; Tomoko Fukuda; Ichiro Nanri (Discovery Science, 2000)

Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs. - Masahiro Hirao; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (SPIRE, 2000)

Online Construction of Subsequence Automata for Multiple Texts. - Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (SPIRE, 2000)

Bit-Parallel Approach to Approximate String Matching in Compressed Texts. - Tetsuya Matsumoto; Takuya Kida; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (SPIRE, 2000)

Discovery Characteristic Patterns from Collections of Classical Japanese Poems. - Mayumi Yamasaki; Masayuki Takeda; Tomoko Fukuda; Ichiro Nanri (New Gener. Comput., 2000)

Multiple Pattern Matching Algorithms on Collage System. - Takuya Kida; Tetsuya Matsumoto; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (CPM, 2001)

String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music. - Masayuki Takeda (CPM, 2001)

Compressed Pattern Matching for SEQUITUR. - Shuichi Mitarai; Masahiro Hirao; Tetsuya Matsumoto; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Data Compression Conference, 2001)

Faster Approximate String Matching over Compressed Text. - Gonzalo Navarro 001; Takuya Kida; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (Data Compression Conference, 2001)

A Practical Algorithm to Find the Best Episode Patterns. - Masahiro Hirao; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Discovery Science, 2001)

Discovering Repetitive Expressions and Affinities from Anthologies of Classical Japanese Poems. - Koichiro Yamamoto; Masayuki Takeda; Ayumi Shinohara; Tomoko Fukuda; Ichiro Nanri (Discovery Science, 2001)

Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. - Hideaki Hori; Shinichi Shimozono; Masayuki Takeda; Ayumi Shinohara (ISAAC, 2001)

On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (SPIRE, 2001)

Musical Sequence Comparison for Melodic and Rhythmic Similarities. - T. Kadota; Masahiro Hirao; Akira Ishino; Masayuki Takeda; Ayumi Shinohara; Fumihiro Matsuo (SPIRE, 2001)

Construction of the CDAWG for a Trie. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Stringology, 2001)

The Minimum DAWG for All Suffixes of a String and Its Applications. - Shunsuke Inenaga; Masayuki Takeda; Ayumi Shinohara; Hiromasa Hoshino; Setsuo Arikawa (CPM, 2002)

Discovering Best Variable-Length-Don't-Care Patterns. - Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Discovery Science, 2002)

Finding Best Patterns Practically. - Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Masahiro Hirao; Hiromasa Hoshino; Shunsuke Inenaga (Progress in Discovery Science, 2002)

Mining from Literary Texts: Pattern Discovery and Similarity Computation. - Masayuki Takeda; Tomoko Fukuda; Ichiro Nanri (Progress in Discovery Science, 2002)

Space-Economical Construction of Index Structures for All Suffixes of a String. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Hideo Bannai; Setsuo Arikawa (MFCS, 2002)

Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts. - Masayuki Takeda; Satoru Miyamoto; Takuya Kida; Ayumi Shinohara; Shuichi Fukamachi; Takeshi Shinohara; Setsuo Arikawa (SPIRE, 2002)

A Method of Extracting Related Words Using Standardized Mutual Information. - Tomohiko Sugimachi; Akira Ishino; Masayuki Takeda; Fumihiro Matsuo (Discovery Science, 2003)

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. - Masayuki Takeda; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Setsuo Arikawa (Discovery Science, 2003)

On the Length of the Minimum Solution of Word Equations in One Variable. - Kensuke Baba; Satoshi Tsuruta; Ayumi Shinohara; Masayuki Takeda (MFCS, 2003)

Inferring Strings from Graphs and Arrays. - Hideo Bannai; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda (MFCS, 2003)

Linear-Time Off-Line Text Compression by Longest-First Substitution. - Shunsuke Inenaga; Takashi Funamoto; Masayuki Takeda; Ayumi Shinohara (SPIRE, 2003)

A Note on Randomized Algorithm for String Matching with Mismatches. - Kensuke Baba; Ayumi Shinohara; Masayuki Takeda; Shunsuke Inenaga; Setsuo Arikawa (Nord. J. Comput., 2003)

Uniform characterizations of polynomial-query learnabilities. - Yosuke Hayashi; Satoshi Matsumoto; Ayumi Shinohara; Masayuki Takeda (Theor. Comput. Sci., 2003)

A practical algorithm to find the best subsequence patterns. - Masahiro Hirao; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (Theor. Comput. Sci., 2003)

Collage system: a unifying framework for compressed pattern matching. - Takuya Kida; Tetsuya Matsumoto; Yusuke Shibata; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (Theor. Comput. Sci., 2003)

Discovering instances of poetic allusion from anthologies of classical Japanese poems. - Masayuki Takeda; Tomoko Fukuda; Ichiro Nanri; Mayumi Yamasaki; Kouichi Tamari (Theor. Comput. Sci., 2003)

Discovering characteristic expressions in literary works. - Masayuki Takeda; Tetsuya Matsumoto; Tomoko Fukuda; Ichiro Nanri (Theor. Comput. Sci., 2003)

On Bit-Parallel Processing of Multi-byte Text. - Heikki Hyyrö; Jun Takaba; Ayumi Shinohara; Masayuki Takeda (AIRS, 2004)

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. - Shunsuke Inenaga; Hideo Bannai; Heikki Hyyrö; Ayumi Shinohara; Masayuki Takeda; Kenta Nakai; Satoru Miyano (Discovery Science, 2004)

An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda (Developments in Language Theory, 2004)

ism: Improvisation Supporting System based on Melody Correction. - Katsuhisa Ishida; Tetsuro Kitahara; Masayuki Takeda (NIME, 2004)

Finding Optimal Pairs of Patterns. - Hideo Bannai; Heikki Hyyrö; Ayumi Shinohara; Masayuki Takeda; Kenta Nakai; Satoru Miyano (WABI, 2004)

Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. - Hideo Bannai; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Satoru Miyano (J. Bioinform. Comput. Biol., 2004)

Compact directed acyclic word graphs for a sliding window. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa (J. Discrete Algorithms, 2004)

An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs. - Hideo Bannai; Heikki Hyyrö; Ayumi Shinohara; Masayuki Takeda; Kenta Nakai; Satoru Miyano (IEEE ACM Trans. Comput. Biol. Bioinform., 2004)

Ternary directed acyclic word graphs. - Satoru Miyamoto; Shunsuke Inenaga; Masayuki Takeda; Ayumi Shinohara (Theor. Comput. Sci., 2004)

Practical Algorithms for Pattern Based Linear Regression. - Hideo Bannai; Kohei Hatano; Shunsuke Inenaga; Masayuki Takeda (Discovery Science, 2005)

Fully Incremental LCS Computation. - Yusuke Ishida; Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda (FCT, 2005)

A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices. - Naoki Mori; Masayuki Takeda; Keinosuke Matsumoto (GECCO, 2005)

ism: Improvisation Supporting Systems with Melody Correction and Key Vibration. - Tetsuro Kitahara; Katsuhisa Ishida; Masayuki Takeda (ICEC, 2005)

Analysis of User's Relation and Reading Activity in Weblogs. - Tadanobu Furukawa; Tomofumi Matsuzawa; Yutaka Matsuo; Koki Uchiyama; Masayuki Takeda (JSAI Workshops, 2005)

A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's. - Hisashi Tsuji; Akira Ishino; Masayuki Takeda (SPIRE, 2005)

On-line construction of compact directed acyclic word graphs. - Shunsuke Inenaga; Hiromasa Hoshino; Ayumi Shinohara; Masayuki Takeda; Setsuo Arikawa; Giancarlo Mauri; Giulio Pavesi (Discret. Appl. Math., 2005)

A fully compressed pattern matching algorithm for simple collage systems. - Shunsuke Inenaga; Ayumi Shinohara; Masayuki Takeda (Int. J. Found. Comput. Sci., 2005)

Users' Behavioral Analysis on Weblogs. - Tadanobu Furukawa; Yutaka Matsuo; Tomofumi Matsuzawa; Masayuki Takeda; Koki Uchiyama (AAAI Spring Symposium: Computational Approaches to Analyzing Weblogs, 2006)

Behavioral Analysis Based on Relations in Weblogs. - Tadanobu Furukawa; Tomofumi Matsuzawa; Yutaka Matsuo; Koki Uchiyama; Masayuki Takeda (ASWC, 2006)

On-Line Linear-Time Construction of Word Suffix Trees. - Shunsuke Inenaga; Masayuki Takeda (CPM, 2006)

A New Family of String Classifiers Based on Local Relatedness. - Yasuto Higa; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Discovery Science, 2006)

Sparse Directed Acyclic Word Graphs. - Shunsuke Inenaga; Masayuki Takeda (SPIRE, 2006)

Sparse compact directed acyclic word graphs. - Shunsuke Inenaga; Masayuki Takeda (Stringology, 2006)

Efficient Computation of Substring Equivalence Classes with Suffix Arrays. - Kazuyuki Narisawa; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2007)

Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. - Ryosuke Nakamura; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (DCC, 2007)

Unsupervised Spam Detection Based on String Alienness Measures. - Kazuyuki Narisawa; Hideo Bannai; Kohei Hatano; Masayuki Takeda (Discovery Science, 2007)

Smooth Boosting for Margin-Based Ranking. - Jun-ichi Moribe; Kohei Hatano; Eiji Takimoto; Masayuki Takeda (ALT, 2008)

Online Learning of Maximum p-Norm Margin Classifiers with Bias. - Kosuke Ishibashi; Kohei Hatano; Masayuki Takeda (COLT, 2008)

String Kernels Based on Variable-Length-Don't-Care Patterns. - Kazuyuki Narisawa; Hideo Bannai; Kohei Hatano; Shunsuke Inenaga; Masayuki Takeda (Discovery Science, 2008)

Parameterized Suffix Arrays for Binary Strings. - Satoshi Deguchi; Fumihito Higashijima; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (Stringology, 2008)

Reachability on Suffix Tree Graphs. - Yasuto Higa; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (Int. J. Found. Comput. Sci., 2008)

Compressed Pattern Matching. - Masayuki Takeda (Encyclopedia of Algorithms, 2008)

Lightweight Parameterized Suffix Array Construction. - Tomohiro I; Satoshi Deguchi; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (IWOCA, 2009)

Counting Parameterized Border Arrays for a Binary Alphabet. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (LATA, 2009)

Linear-Time Text Compression by Longest-First Substitution. - Ryosuke Nakamura; Shunsuke Inenaga; Hideo Bannai; Takashi Funamoto; Masayuki Takeda; Ayumi Shinohara (Algorithms, 2009)

A Run-Time Efficient Implementation of Compressed Pattern Matching Automata. - Tetsuya Matsumoto; Kazuhito Hagio; Masayuki Takeda (Int. J. Found. Comput. Sci., 2009)

Verifying a Parameterized Border Array in O(n1.5) Time. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2010)

Chimera: Stream-Oriented XML Filtering/Querying Engine. - Tatsuya Asai; Shin-ichiro Tago; Hiroya Inakoshi; Seishi Okamoto; Masayuki Takeda (DASFAA (2), 2010)

Sparse Substring Pattern Set Discovery Using Linear Programming Boosting. - Kazuaki Kashihara; Kohei Hatano; Hideo Bannai; Masayuki Takeda (Discovery Science, 2010)

Counting and Verifying Maximal Palindromes. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2010)

Context-Sensitive Grammar Transform: Compression and Pattern Matching. - Shirou Maruyama; Youhei Tanaka; Hiroshi Sakamoto; Masayuki Takeda (IEICE Trans. Inf. Syst., 2010)

An Online Algorithm for Lightweight Grammar-Based Compression. - Shirou Maruyama; Masayuki Takeda; Masaya Nakahara; Hiroshi Sakamoto (CCP, 2011)

Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. - Takanori Yamamoto; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CPM, 2011)

Online Linear Optimization over Permutations. - Shota Yasutake; Kohei Hatano; Shuji Kijima; Eiji Takimoto; Masayuki Takeda (ISAAC, 2011)

Music Genre Classification using Similarity Functions. - Yoko Anan; Kohei Hatano; Hideo Bannai; Masayuki Takeda (ISMIR, 2011)

Efficient Eager XPath Filtering over XML Streams. - Kazuhito Hagio; Takashi Ohgami; Hideo Bannai; Masayuki Takeda (Stringology, 2011)

Computing Longest Common Substring/Subsequence of Non-linear Texts. - Kouji Shimohira; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2011)

Restructuring Compressed Texts without Explicit Decompression - Keisuke Goto 001; Shirou Maruyama; Shunsuke Inenaga; Hideo Bannai; Hiroshi Sakamoto; Masayuki Takeda (CoRR, 2011)

Computing q-gram Frequencies on Collage Systems - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CoRR, 2011)

Adaptive Online Prediction Using Weighted Windows. - Shin-ichi Yoshida; Kohei Hatano; Eiji Takimoto; Masayuki Takeda (IEICE Trans. Inf. Syst., 2011)

Verifying and enumerating parameterized border arrays. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2011)

Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CPM, 2012)

Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions. - Yoko Anan; Kohei Hatano; Hideo Bannai; Masayuki Takeda; Ken Satoh (ISMIR, 2012)

General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations. - Tomohiro I; Yuki Enokuma; Hideo Bannai; Masayuki Takeda (ECML/PKDD (2), 2012)

Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (SOFSEM, 2012)

Efficient LZ78 Factorization of Grammar Compressed Text. - Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (SPIRE, 2012)

Eager XPath Evaluation over XML Streams. - Kazuhito Hagio; Takashi Ohgami; Hideo Bannai; Masayuki Takeda (SPIRE, 2012)

The Position Heap of a Trie. - Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2012)

An Online Algorithm for Lightweight Grammar-Based Compression. - Shirou Maruyama; Hiroshi Sakamoto; Masayuki Takeda (Algorithms, 2012)

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding - Jun-ichi Yamamoto; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CoRR, 2012)

Online Rank Aggregation. - Shota Yasutake; Kohei Hatano; Eiji Takimoto; Masayuki Takeda (ACML, 2012)

Converting SLP to LZ78 in almost Linear Time. - Hideo Bannai; Pawel Gawrychowski; Shunsuke Inenaga; Masayuki Takeda (CPM, 2013)

Efficient Lyndon Factorization of Grammar Compressed Text. - Tomohiro I; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2013)

From Run Length Encoding to LZ78 and Back Again. - Yuya Tamakoshi; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (DCC, 2013)

Computing Convolution on Grammar-Compressed Text. - Toshiya Tanaka; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (DCC, 2013)

Computing Reversed Lempel-Ziv Factorization Online. - Shiho Sugimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2013)

Fast q-gram mining on SLP compressed strings. - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (J. Discrete Algorithms, 2013)

Palindrome pattern matching. - Tomohiro I; Shunsuke Inenaga; Masayuki Takeda (Theor. Comput. Sci., 2013)

Computing Palindromic Factorizations and Palindromic Covers On-line. - Tomohiro I; Shiho Sugimoto; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2014)

Shortest Unique Substrings Queries in Optimal Time. - Kazuya Tsuruta; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SOFSEM, 2014)

Faster Compact On-Line Lempel-Ziv Factorization. - Jun-ichi Yamamoto; Tomohiro I; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (STACS, 2014)

Computing Abelian Covers and Abelian Runs. - Shohei Matsuda; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2014)

Inferring strings from suffix trees and links on a binary alphabet. - Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Discret. Appl. Math., 2014)

An Opportunistic Text Indexing Structure Based on Run Length Encoding. - Yuya Tamakoshi; Keisuke Goto 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CIAC, 2015)

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. - Keisuke Goto 001; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CPM, 2015)

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. - Yoshiaki Matsuoka; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2015)

An Improved Evacuation Guidance System Based on Ant Colony Optimization. - Asuka Ohta; Hirotaka Goto; Tomofumi Matsuzawa; Munehiro Takimoto; Yasushi Kambayashi; Masayuki Takeda (IES, 2015)

Inferring Strings from Full Abelian Periods. - Makoto Nishida; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2015)

A new characterization of maximal repetitions by Lyndon trees. - Hideo Bannai; Tomohiro I; Shunsuke Inenaga; Yuto Nakashima 001; Masayuki Takeda; Kazuya Tsuruta (SODA, 2015)

A Faster Algorithm for Computing Maximal alpha -gapped Repeats in a String. - Yuka Tanimura; Yuta Fujishige; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2015)

Computing Left-Right Maximal Generic Words. - Takaaki Nishimoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2015)

Dynamic index, LZ factorization, and LCE queries in compressed space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2015)

Detecting regularities on grammar-compressed strings. - Tomohiro I; Wataru Matsubara; Kouji Shimohira; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Kazuyuki Narisawa; Ayumi Shinohara (Inf. Comput., 2015)

Constructing LZ78 tries and position heaps in linear time for large alphabets. - Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Process. Lett., 2015)

Compressed automata for dictionary matching. - Tomohiro I; Takaaki Nishimoto; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2015)

Factorizing a String into Squares in Linear Time. - Yoshiaki Matsuoka; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Florin Manea (CPM, 2016)

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. - Yuka Tanimura; Tomohiro I; Hideo Bannai; Shunsuke Inenaga; Simon J. Puglisi; Masayuki Takeda (CPM, 2016)

A Guidance System for Wide-area Complex Disaster Evacuation based on Ant Colony Optimization. - Hirotaka Goto; Asuka Ohta; Tomofumi Matsuzawa; Munehiro Takimoto; Yasushi Kambayashi; Masayuki Takeda (ICAART (1), 2016)

Finding Gapped Palindromes Online. - Yuta Fujishige; Michitaro Nakamura; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2016)

Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. - Yuta Fujishige; Yuki Tsujimaru; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (MFCS, 2016)

Shortest Unique Substring Queries on Run-Length Encoded Strings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (MFCS, 2016)

Fully Dynamic Data Structure for LCE Queries in Compressed Space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (MFCS, 2016)

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time. - Hiroe Inoue; Yoshiaki Matsuoka; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2016)

Tight bound on the maximum number of shortest unique substrings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2016)

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. - Tomohiro I; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2016)

Generalized pattern matching and periodicity under substring consistent equivalence relations. - Yoshiaki Matsuoka; Takahiro Aoki; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2016)

Pattern Matching on Compressed Text. - Masayuki Takeda; Ayumi Shinohara (Encyclopedia of Algorithms, 2016)

Faster STR-IC-LCS Computation via RLE. - Keita Kuboi; Yuta Fujishige; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2017)

Tight Bounds on the Maximum Number of Shortest Unique Substrings. - Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2017)

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. - Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2017)

Shortest Unique Palindromic Substring Queries in Optimal Time. - Yuto Nakashima 001; Hiroe Inoue; Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2017)

Computing Abelian String Regularities Based on RLE. - Shiho Sugimoto; Naoki Noda; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2017)

Small-Space LCE Data Structure with Constant-Time Queries. - Yuka Tanimura; Takaaki Nishimoto; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (MFCS, 2017)

Order Preserving Pattern Matching on Trees and DAGs. - Temma Nakamura; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2017)

On Reverse Engineering the Lyndon Tree. - Yuto Nakashima 001; Takuya Takagi; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2017)

Efficient Computation of Substring Equivalence Classes with Suffix Arrays. - Kazuyuki Narisawa; Hideharu Hiratsuka; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Algorithmica, 2017)

Computing Abelian regularities on RLE strings. - Shiho Sugimoto; Naoki Noda; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2017)

Small-space encoding LCE data structure with constant-time queries. - Yuka Tanimura; Takaaki Nishimoto; Hideo Bannai; Shunsuke Inenaga; Masayuki Takeda (CoRR, 2017)

The "Runs" Theorem. - Hideo Bannai; Tomohiro I; Shunsuke Inenaga; Yuto Nakashima 001; Masayuki Takeda; Kazuya Tsuruta (SIAM J. Comput., 2017)

Inferring strings from Lyndon factorization. - Yuto Nakashima 001; Takashi Okabe; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2017)

Faster Online Elastic Degenerate String Matching. - Kotaro Aoyama; Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Longest substring palindrome after edit. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Lyndon Factorization of Grammar Compressed Texts Revisited. - Isamu Furuya; Yuto Nakashima 001; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Computing longest common square subsequences. - Takafumi Inoue; Shunsuke Inenaga; Heikki Hyyrö; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Longest Lyndon Substring After Edit. - Yuki Urabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2018)

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. - Yuki Kuhara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2018)

Right-to-left Online Construction of Parameterized Position Heaps. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2018)

O(n log n)-time Text Compression by LZ-style Longest First Substitution. - Akihiro Nishi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2018)

Algorithms and combinatorial properties on shortest unique palindromic substrings. - Hiroe Inoue; Yuto Nakashima 001; Takuya Mieno; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (J. Discrete Algorithms, 2018)

The Parameterized Position Heap of a Trie. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CIAC, 2019)

Faster Queries for Longest Substring Palindrome After Block Edit. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

Computing Runs on a Trie. - Ryo Sugahara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. - Yuki Urabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CPM, 2019)

Finding the Maximum Number of Symbols for the 4b/10b Line Code with Error Correction. - Masayuki Takeda; Nobuyuki Yamasaki (CANDAR Workshops, 2019)

An Improved Data Structure for Left-Right Maximal Generic Words Problem. - Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (ISAAC, 2019)

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. - Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (IWOCA, 2019)

Fabrication of Nb2O5 horizontal slot waveguide structures. - Yoshiki Hayama; Shinta Uchibori; Katsumi Nakatsuhara; Masayuki Takeda; Takeshi Nishizawa (OECC/PSC, 2019)

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2019)

On Longest Common Property Preserved Substring Queries. - Kazuki Kai; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Tomasz Kociumaka (SPIRE, 2019)

Compact Data Structures for Shortest Unique Substring Queries. - Takuya Mieno; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2019)

Computing Maximal Palindromes and Distinct Palindromes in a Trie. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Stringology, 2019)

Dynamic Packed Compact Tries Revisited. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2019)

On the size of the smallest alphabet for Lyndon trees. - Yuto Nakashima 001; Takuya Takagi; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2019)

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda; Ayumi Shinohara (CPM, 2020)

DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. - Katsuhito Nakashima; Noriki Fujisato; Diptarama Hendrian; Yuto Nakashima 001; Ryo Yoshinaka; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda (CPM, 2020)

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. - Takuya Mieno; Yuki Kuhara; Tooru Akagi; Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SOFSEM, 2020)

Faster STR-EC-LCS Computation. - Kohei Yamada; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SOFSEM, 2020)

On Repetitiveness Measures of Thue-Morse Words. - Kanaru Kutsukake; Takuya Matsumoto; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2020)

Towards Efficient Interactive Computation of Dynamic Time Warping Distance. - Akihiro Nishi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2020)

Grammar-compressed Self-index with Lyndon Words. - Kazuya Tsuruta; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2020)

Computing Palindromic Trees for a Sliding Window and Its Applications. - Takuya Mieno; Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2020)

Dynamic index and LZ factorization in compressed space. - Takaaki Nishimoto; Tomohiro I; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Discret. Appl. Math., 2020)

Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration. - Masayuki Takeda; Nobuyuki Yamasaki (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings. - Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theory Comput. Syst., 2020)

Space-efficient algorithms for computing minimal/shortest unique substrings. - Takuya Mieno; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2020)

The Parameterized Suffix Tray. - Noriki Fujisato; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CIAC, 2021)

Grammar Index by Induced Suffix Sorting. - Tooru Akagi; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2021)

Longest Common Rollercoasters. - Kosuke Fujita; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2021)

On the Approximation Ratio of LZ-End to LZ77. - Takumi Ideue; Takuya Mieno; Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Masayuki Takeda (SPIRE, 2021)

Counting Lyndon Subsequences. - Ryo Hirakawa; Yuto Nakashima 001; Shunsuke Inenaga; Masayuki Takeda (Stringology, 2021)

Compressed Communication Complexity of Hamming Distance. - Shiori Mitsuya; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Algorithms, 2021)

Computing longest palindromic substring after single-character or block-wise edits. - Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2021)

Efficiently computing runs on a trie. - Ryo Sugahara; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2021)

Wavelength characteristics of Nb2O5micro-ring resonators. - Naoki Sawayanagi; Ryousuke Nakada; Yoshiki Hayama; Naoya Katsumata; Yuki Shimamura; Takumi Hinata; Masayuki Takeda; Katsumi Nakatsuhara (OECC/PSC, 2022)

Computing Minimal Unique Substrings for a Sliding Window. - Takuya Mieno; Yuta Fujishige; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Algorithmica, 2022)

Computing maximal generalized palindromes. - Mitsuru Funakoshi; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2022)

c-trie++: A dynamic trie tailored for fast prefix searches. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Comput., 2022)

Palindromic trees for a sliding window and its applications. - Takuya Mieno; Kiichi Watanabe; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Process. Lett., 2022)

Factorizing Strings into Repetitions. - Hiroe Inoue; Yoshiaki Matsuoka; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theory Comput. Syst., 2022)

Combinatorics of minimal absent words for a sliding window. - Tooru Akagi; Yuki Kuhara; Takuya Mieno; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2022)

Parameterized DAWGs: Efficient constructions and bidirectional pattern searches. - Katsuhito Nakashima; Noriki Fujisato; Diptarama Hendrian; Yuto Nakashima 001; Ryo Yoshinaka; Shunsuke Inenaga; Hideo Bannai; Ayumi Shinohara; Masayuki Takeda (Theor. Comput. Sci., 2022)

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. - Yuta Fujishige; Yuki Tsujimaru; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2023)

Computing maximal palindromes in non-standard matching models. - Takuya Mieno; Mitsuru Funakoshi; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Comput., 2025)