Teachability in Computational Learning. - Ayumi Shinohara; Satoru Miyano (ALT, 1990)

Which classes of elementary formal systems are polynomial-time learnable. - Satoru Miyano; Ayumi Shinohara; Takeshi Shinohara (ALT, 1991)

More About Learning Elementary Formal Systems. - Setsuo Arikawa; Takeshi Shinohara; Satoru Miyano; Ayumi Shinohara (Nonmonotonic and Inductive Logic, 1991)

Teachability in Computational Learning. - Ayumi Shinohara (New Gener. Comput., 1991)

Complexity of Computing Vapnik-Chervonenkis Dimension. - Ayumi Shinohara (ALT, 1993)

A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns. - Setsuo Arikawa; Satoru Miyano; Ayumi Shinohara; Satoru Kuhara; Yasuhito Mukouchi; Takeshi Shinohara (New Gener. Comput., 1993)

Refutably Probably Approximately Correct Learning. - Satoshi Matsumoto; Ayumi Shinohara (AII/ALT, 1994)

Complexity of Computing Generalized VC-Dimensions. - Ayumi Shinohara (ECML, 1994)

Machine Learning and Discovery for Bloinformatics: Introduction. - Satoru Miyano; Ayumi Shinohara (HICSS (5), 1994)

BONSAI Garden: Parallel Knowledge Discovery System for Amino Acid Sequences. - Takayoshi Shoudai; Michael Lappe; Satoru Miyano; Ayumi Shinohara; Takeo Okazaki; Setsuo Arikawa; Tomoyuki Uchida; Shinichi Shimozono; Takeshi Shinohara; Satoru Kuhara (ISMB, 1995)

Developments in Computational Learning and Discovery Theory within the Framework of Elementary Formal Systems. - Setsuo Arikawa; Masako Sato; Ayumi Shinohara; Takeshi Shinohara (Machine Intelligence 15, 1995)

Pattern-Matching for Strings with Short Descriptions - Marek Karpinski; Wojciech Rytter; Ayumi Shinohara (Electron. Colloquium Comput. Complex., 1995)

Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions. - Ayumi Shinohara (Theor. Comput. Sci., 1995)

On the Hardness of Approximating the Minimum Consistent OBDD Problem. - Kouichi Hirata; Shinichi Shimozono; Ayumi Shinohara (SWAT, 1996)

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

Learning Pattern Languages Using Queries. - Satoshi Matsumoto; Ayumi Shinohara (EuroCOLT, 1997)

An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. - Marek Karpinski; Wojciech Rytter; Ayumi Shinohara (Nord. J. Comput., 1997)

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

On the Hardness of Approximating the minimum Consistent Acyclic DFA and Decision Diagram. - Shinichi Shimozono; Kouichi Hirata; Ayumi Shinohara (Inf. Process. Lett., 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)

Knowledge Discovery from Health Data Using Weighted Aggregation Classifiers. - Toru Takae; Minoru Chikamune; Hiroki Arimura; Ayumi Shinohara; Hitoshi Inoue; Shun-ichi Takeya; Keiko Uezono; Terukazu Kawasaki (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)

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)

Polynomial-time Learning of Elementary Formal Systems. - Satoru Miyano; Ayumi Shinohara; Takeshi Shinohara (New Gener. Comput., 2000)

Multiple Pattern Matching Algorithms on Collage System. - Takuya Kida; Tetsuya Matsumoto; Masayuki Takeda; Ayumi Shinohara; Setsuo Arikawa (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)

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)

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)

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

String Pattern Discovery. - Ayumi Shinohara (ALT, 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)

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)

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

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance. - Heikki Hyyrö; Yoan J. Pinzón; Ayumi Shinohara (SOFSEM, 2005)

New Bit-Parallel Indel-Distance Algorithm. - Heikki Hyyrö; Yoan J. Pinzón; Ayumi Shinohara (WEA, 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)

The size of subsequence automaton. - Zdenek Tronícek; Ayumi Shinohara (Theor. Comput. Sci., 2005)

Ball tracking with velocity based on Monte-Carlo localization. - Jun Inoue 004; Akira Ishino; Ayumi Shinohara (IAS, 2006)

A Framework for Advanced Robot Programming in the RoboCup Domain - Using Plug-in System and Scripting Language. - Hayato Kobayashi; Akira Ishino; Ayumi Shinohara (IAS, 2006)

Autonomous Learning of Ball Trapping in the Four-Legged Robot League. - Hayato Kobayashi; Tsugutoyo Osaki; Eric Williams 003; Akira Ishino; Ayumi Shinohara (RoboCup, 2006)

Reducing Trials by Thinning-Out in Skill Discovery. - Hayato Kobayashi; Kohei Hatano; Akira Ishino; Ayumi Shinohara (Discovery Science, 2007)

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program. - Wataru Matsubara; Shunsuke Inenaga; Ayumi Shinohara (Structure-Based Compression of Complex Massive Data, 2008)

Development of an Augmented Environment and Autonomous Learning for Quadruped Robots. - Hayato Kobayashi; Tsugutoyo Osaki; Tetsuro Okuyama; Akira Ishino; Ayumi Shinohara (RoboCup, 2008)

Computing Longest Common Substring and All Palindromes from Compressed Strings. - Wataru Matsubara; Shunsuke Inenaga; Akira Ishino; Ayumi Shinohara; Tomoyuki Nakamura; Kazuo Hashimoto (SOFSEM, 2008)

Average Value of Sum of Exponents of Runs in Strings. - Kazuhiko Kusano; Wataru Matsubara; Akira Ishino; Ayumi Shinohara (Stringology, 2008)

New Lower Bounds for the Maximum Number of Runs in a String. - Wataru Matsubara; Kazuhiko Kusano; Akira Ishino; Hideo Bannai; Ayumi Shinohara (Stringology, 2008)

Improvement of the performance using received message on learning of communication codes. - Tatsuya Kasai; Hayato Kobayashi; Ayumi Shinohara (AAMAS (2), 2009)

Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program. - Wataru Matsubara; Shunsuke Inenaga; Ayumi Shinohara (CATS, 2009)

Complexity of Teaching by a Restricted Number of Examples. - Hayato Kobayashi; Ayumi Shinohara (COLT, 2009)

A Series of Run-Rich Strings. - Wataru Matsubara; Kazuhiko Kusano; Hideo Bannai; Ayumi Shinohara (LATA, 2009)

Bit-parallel Algorithms for Computing all the Runs in a String. - Kazunori Hirashima; Hideo Bannai; Wataru Matsubara; Akira Ishino; Ayumi Shinohara (Stringology, 2009)

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

Development of an Interactive Augmented Environment and Its Application to Autonomous Learning for Quadruped Robots. - Hayato Kobayashi; Tsugutoyo Osaki; Tetsuro Okuyama; Joshua Gramm; Akira Ishino; Ayumi Shinohara (IEICE Trans. Inf. Syst., 2009)

Average Value of Sum of Exponents of Runs in a String. - Kazuhiko Kusano; Wataru Matsubara; Akira Ishino; Ayumi Shinohara (Int. J. Found. Comput. Sci., 2009)

Efficient algorithms to compute compressed longest common substrings and compressed palindromes. - Wataru Matsubara; Shunsuke Inenaga; Akira Ishino; Ayumi Shinohara; Tomoyuki Nakamura; Kazuo Hashimoto (Theor. Comput. Sci., 2009)

Multi-target adaptive A. - Kengo Matsuta; Hayato Kobayashi; Ayumi Shinohara (AAMAS, 2010)

The Number of Runs in a Ternary Word. - Hideo Bannai; Mathieu Giraud; Kazuhiko Kusano; Wataru Matsubara; Ayumi Shinohara; Jamie Simpson (Stringology, 2010)

Average Number of Runs and Squares in Necklace. - Kazuhiko Kusano; Ayumi Shinohara (Stringology, 2010)

Inferring Strings from Runs. - Wataru Matsubara; Akira Ishino; Ayumi Shinohara (Stringology, 2010)

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs. - Wataru Matsubara; Shunsuke Inenaga; Ayumi Shinohara (Chic. J. Theor. Comput. Sci., 2010)

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

Functional programs as compressed data. - Naoki Kobayashi 001; Kazutaka Matsuda; Ayumi Shinohara (PEPM, 2012)

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

Functional programs as compressed data. - Naoki Kobayashi 001; Kazutaka Matsuda; Ayumi Shinohara; Kazuya Yaguchi (High. Order Symb. Comput., 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)

Efficient Algorithm and Coding for Higher-Order Compression. - Kazuya Yaguchi; Naoki Kobayashi 001; Ayumi Shinohara (DCC, 2014)

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)

Average number of occurrences of repetitions in a necklace. - Kazuhiko Kusano; Ayumi Shinohara (Discret. Appl. Math., 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)

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

Compact bit encoding schemes for simply-typed lambda-terms. - Kotaro Takeda; Naoki Kobayashi 001; Kazuya Yaguchi; Ayumi Shinohara (ICFP, 2016)

Visualization and Analysis of Electrical Energy Consumption in Laboratories. - Ichinari Sato; Diptarama; Ayumi Shinohara (IIAI-AAI, 2016)

QBF Encoding of Generalized Tic-Tac-Toe. - Diptarama; Ryo Yoshinaka; Ayumi Shinohara (QBF@SAT, 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)

AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching. - Diptarama; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2016)

Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings. - Diptarama; Ryo Yoshinaka; Ayumi Shinohara (Stringology, 2016)

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

An efficient query learning algorithm for zero-suppressed binary decision diagrams. - Hayato Mizumoto; Shota Todoroki; Diptarama; Ryo Yoshinaka; Ayumi Shinohara (ALT, 2017)

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)

Duel and sweep algorithm for order-preserving pattern matching. - Davaajav Jargalsaikhan; Diptarama; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2017)

New Variants of Pattern Matching with Constants and Variables. - Yuki Igarashi; Diptarama; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM, 2018)

Duel and Sweep Algorithm for Order-Preserving Pattern Matching. - Davaajav Jargalsaikhan; Diptarama; Yohei Ueki; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM, 2018)

Linear-Time Online Algorithm Inferring the Shortest Path from a Walk. - Shintaro Narisada; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2018)

Enumeration of Cryptarithms Using Deterministic Finite Automata. - Yuki Nozaki; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (CIAA, 2018)

Enumerating Cryptarithms Using Deterministic Finite Automata. - Yuki Nozaki; Diptarama Hendrian; Ryo Yoshinaka; Takashi Horiyama; Ayumi Shinohara (CoRR, 2018)

Renewal of the Major Fields from New Generation Computing Vol. 36 (2018). - Masayuki Numao; Yutaka Matsuo; Ayumi Shinohara; Masaki Suwa (New Gener. Comput., 2018)

Development of a Lightweight Cyber-enhanced Rescue Canine Suit with Heat Protection and Anti-slip Countermeasures. - Hiroyuki Nishinoma; Beokhaimook Chayapol; Kazunori Ohno; Ayumi Shinohara; Satoshi Tadokoro (SSRR, 2019)

An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm. - Satoshi Kobayashi; Diptarama; Ryo Yoshinaka; Ayumi Shinohara (Stringology, 2019)

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

Linear-size Suffix Tries for Parameterized Strings. - Katsuhito Nakashima; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2019)

Query Learning Algorithm for Residual Symbolic Finite Automata. - Kaizaburo Chubachi; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (GandALF, 2019)

Efficient dynamic dictionary matching with DAWGs and AC-automata. - Diptarama Hendrian; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (Theor. Comput. Sci., 2019)

Cyber-Enhanced Rescue Canine. - Kazunori Ohno; Ryunosuke Hamada; Tatsuya Hoshi; Hiroyuki Nishinoma; Shumpei Yamaguchi; Solvi Arnold; Kimitoshi Yamazaki; Takefumi Kikusui; Satoko Matsubara; Miho Nagasawa; Takatomi Kubo; Eri Nakahara; et al. (Disaster Robotics, 2019)

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

In-Place Bijective Burrows-Wheeler Transforms. - Dominik Köppl; Daiki Hashimoto; Diptarama Hendrian; 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)

Grammar Compression with Probabilistic Context-Free Grammar. - Hiroaki Naganuma; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara; Naoki Kobayashi 001 (DCC, 2020)

Parallel Duel-and-Sweep Algorithm for the Order-Preserving Pattern Matching. - Davaajav Jargalsaikhan; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM, 2020)

An Extension of Linear-size Suffix Tries for Parameterized Strings. - Katsuhito Nakashima; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM (Doctoral Student Research Forum), 2020)

AOBA: An Online Benchmark Tool for Algorithms in Stringology. - Ryu Wakimoto; Satoshi Kobayashi; Yuki Igarashi; Davaajav Jargalsaikhan; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM (Doctoral Student Research Forum), 2020)

Computing Covers Under Substring Consistent Equivalence Relations. - Natsumi Kikuchi; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2020)

Fast and Linear-Time String Matching Algorithms Based on the Distances of q-Gram Occurrences. - Satoshi Kobayashi; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SEA, 2020)

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)

Linear-time online algorithm for inferring the shortest path graph from a walk label. - Shintaro Narisada; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (Theor. Comput. Sci., 2020)

Inside-Outside Algorithm for Macro Grammars. - Ryuta Kambe; Naoki Kobayashi 001; Ryosuke Sato 001; Ayumi Shinohara; Ryo Yoshinaka (ICGI, 2021)

Query Learning Algorithm for Symbolic Weighted Finite Automata. - Kaito Suzuki; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (ICGI, 2021)

Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations. - Davaajav Jargalsaikhan; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (CPM, 2022)

Computing the Parameterized Burrows-Wheeler Transform Online. - Daiki Hashimoto; Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 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)

Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data. - Yutaro Numaya; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (ICGI, 2023)

Efficient Parameterized Pattern Matching in Sublinear Space. - Haruki Ideguchi; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2023)

Inferring Strings from Position Heaps in Linear Time. - Koshiro Kumagai; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (WALCOM, 2023)

Algorithms for Galois Words: Detection, Factorization, and Rotation. - Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (CPM, 2024)

Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. - Kento Iseri; Tomohiro I; Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (ICALP, 2024)

Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages. - Yoshito Kawasaki; Diptarama Hendrian; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM, 2024)

Subsequence Pattern Matching with Segment Number Constraint. - Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2024)

Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm. - Davaajav Jargalsaikhan; Diptarama Hendrian; Yohei Ueki; Ryo Yoshinaka; Ayumi Shinohara (Acta Informatica, 2024)

Subsequence Matching and LCS with Segment Number Constraints. - Yuki Yonemoto; Takuya Mieno; Shunsuke Inenaga; Ryo Yoshinaka; Ayumi Shinohara (CIAC (2), 2025)

Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time. - Yuto Iguchi; Ryo Yoshinaka; Ayumi Shinohara (CPM, 2025)

Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets. - Yutaro Numaya; Yoshito Kawasaki; Ryo Yoshinaka; Ayumi Shinohara (SOFSEM (2), 2025)

StrNim: a variant of Nim played on strings. - Shota Mizuno; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2025)

BusOut is NP-complete. - Takehiro Ishibashi; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2025)

Misère Greedy Nim and Misère Bounded Greedy Nim. - Nanako Omiya; Ryo Yoshinaka; Ayumi Shinohara (CoRR, 2025)