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

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

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

Prediction for Control Delay on Reinforcement Learning. - Junya Saito; Kazuyuki Narisawa; Ayumi Shinohara (ICAART (1), 2012)

Computing Maximum Number of Runs in Strings. - Kazuhiko Kusano; Kazuyuki Narisawa; Ayumi Shinohara (SPIRE, 2012)

Permuted Pattern Matching on Multi-track Strings. - Takashi Katsura; Kazuyuki Narisawa; Ayumi Shinohara; Hideo Bannai; Shunsuke Inenaga (SOFSEM, 2013)

On Morphisms Generating Run-Rich Strings. - Kazuhiko Kusano; Kazuyuki Narisawa; Ayumi Shinohara (Stringology, 2013)

A Simple Classification Method for Class Imbalanced Data using the Kernel Mean. - Yusuke Sato; Kazuyuki Narisawa; Ayumi Shinohara (KDIR, 2014)

Reducing Sample Complexity in Reinforcement Learning by Transferring Transition and Reward Probabilities. - Kouta Oguni; Kazuyuki Narisawa; Ayumi Shinohara (ICAART (1), 2014)

Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints. - Tomoki Komatsu; Ryosuke Okuta; Kazuyuki Narisawa; Ayumi Shinohara (SOFSEM, 2014)

Position Heaps for Permuted Pattern Matching on Multi-Track String. - Takashi Katsura; Yuhei Otomo; Kazuyuki Narisawa; Ayumi Shinohara (SOFSEM (Student Research Forum Papers / Posters), 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)

Dynamic edit distance table under a general weighted cost function. - Heikki Hyyrö; Kazuyuki Narisawa; Shunsuke Inenaga (J. Discrete Algorithms, 2015)

Generalization of Efficient Implementation of Compression by Substring Enumeration. - Shumpei Sakuma; Kazuyuki Narisawa; Ayumi Shinohara (DCC, 2016)

KMP Based Pattern Matching Algorithms for Multi-Track Strings. - Diptarama; Yohei Ueki; Kazuyuki Narisawa; Ayumi Shinohara (SOFSEM (Student Research Forum Papers / Posters), 2016)

A Fast Order-Preserving Matching with q-neighborhood Filtration Using SIMD Instructions. - Yohei Ueki; Kazuyuki Narisawa; Ayumi Shinohara (SOFSEM (Student Research Forum Papers / Posters), 2016)

Position Heaps for Parameterized Strings. - Diptarama; Takashi Katsura; Yuhei Otomo; Kazuyuki Narisawa; Ayumi Shinohara (CPM, 2017)

Computing Longest Single-arm-gapped Palindromes in a String. - Shintaro Narisada; Diptarama; Kazuyuki Narisawa; Shunsuke Inenaga; Ayumi Shinohara (SOFSEM, 2017)

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings. - Yohei Ueki; Diptarama; Masatoshi Kurihara; Yoshiaki Matsuoka; Kazuyuki Narisawa; Ryo Yoshinaka; Hideo Bannai; Shunsuke Inenaga; Ayumi Shinohara (SOFSEM, 2017)

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

Permuted Pattern Matching Algorithms on Multi-Track Strings. - Diptarama Hendrian; Yohei Ueki; Kazuyuki Narisawa; Ryo Yoshinaka; Ayumi Shinohara (Algorithms, 2019)

Efficient computation of longest single-arm-gapped palindromes in a string. - Shintaro Narisada; Diptarama Hendrian; Kazuyuki Narisawa; Shunsuke Inenaga; Ayumi Shinohara (Theor. Comput. Sci., 2020)