Hideo Bannai

发表

A string pattern regression algorithm and its application to pattern discovery in long introns.

Ayumi Shinohara, Satoru Miyano, Hideo Bannai, 2002, Genome informatics. International Conference on Genome Informatics.

MR-RePair: Grammar Compression Based on Maximal Repeats

Hideo Bannai, Shunsuke Inenaga, Isamu Furuya, 2019, 2019 Data Compression Conference (DCC).

Speeding Up q-Gram Mining on Grammar-Based Compressed Texts

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2012, CPM.

Shortest unique palindromic substring queries in optimal time pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, IWOCA.

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, CPM.

Towards Efficient Interactive Computation of Dynamic Time Warping Distance pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2020, SPIRE.

Bit-parallel Algorithms for Computing all the Runs in a String

Ayumi Shinohara, Hideo Bannai, Akira Ishino, 2009, Stringology.

Algorithms and combinatorial properties on shortest unique palindromic substrings

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, J. Discrete Algorithms.

Longest Common Subsequence in at Least k Length Order-isomorphic Substrings pdf

Diptarama, Ryo Yoshinaka, Ayumi Shinohara, 2017, SOFSEM.

Unsupervised Spam Detection Based on String Alienness Measures

Hideo Bannai, Masayuki Takeda, Kohei Hatano, 2007, Discovery Science.

Tight Bounds on the Maximum Number of Shortest Unique Substrings pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, CPM.

Practical Algorithms for Pattern Based Linear Regression

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2005, Discovery Science.

Extensive feature detection of N-terminal protein sorting signals

Satoru Miyano, Kenta Nakai, Hideo Bannai, 2002, Bioinform..

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2012, ArXiv.

Improved algorithms for longest common extension in sublinear space

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016 .

Computing Abelian regularities on RLE strings pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, ArXiv.

Small-space encoding LCE data structure with constant-time queries pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, ArXiv.

An Improved Data Structure for Left-Right Maximal Generic Words Problem

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, ISAAC.

On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, CPM.

Foundations of Designing Computational Knowledge Discovery Processes

Satoru Miyano, Hideo Bannai, Osamu Maruyama, 2002, Progress in Discovery Science.

HypothesisCreator: Concepts for Accelerating the Computational Knowledge Discovery Process

Satoru Miyano, Hideo Bannai, Osamu Maruyama, 2001, Electron. Trans. Artif. Intell..

Inferring strings from Lyndon factorization

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, Theor. Comput. Sci..

Computing Palindromic Factorizations and Palindromic Covers On-line

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2014, CPM.

Inferring strings from suffix trees and links on a binary alphabet

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, Discret. Appl. Math..

Grammar Compression

Hideo Bannai, 2016, Encyclopedia of Algorithms.

An efficient algorithm to test square-freeness of strings compressed by straight-line programs

Gad M. Landau, Moshe Lewenstein, Hideo Bannai, 2012, Inf. Process. Lett..

On the complexity of deriving position specific score matrices from positive and negative sequences

Satoru Miyano, Tatsuya Akutsu, Hideo Bannai, 2007, Discret. Appl. Math..

HYPOTHESISCREATOR: A Framework for Knowledge Discovery Application Development

Satoru Miyano, Hideo Bannai, Osamu Maruyama, 2000 .

Efficient Algorithms for Longest Closed Factor Array

Arnaud Lefebvre, Wojciech Rytter, Jakub Radoszewski, 2015, SPIRE.

Parallelized Knowledge Discovery System

Masao Nagasaki, Satoru Miyano, Hideo Bannai, 1998 .

Detecting regularities on grammar-compressed strings

Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, 2015, Inf. Comput..

Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, SPIRE.

Longest Square Subsequence Problem Revisited

Hideo Bannai, Shunsuke Inenaga, Takafumi Inoue, 2020, SPIRE.

Compressed automata for dictionary matching

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, Theor. Comput. Sci..

Verifying and enumerating parameterized border arrays

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, Theor. Comput. Sci..

VM lambda: a Functional Calculus for Scientific Discovery

Hideo Bannai, Eijiro Sumii, H. Bannai, 2002, APLAS.

A New Family of String Classifiers Based on Local Relatedness

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2006, Discovery Science.

Efficient Eager XPath Filtering over XML Streams

Hideo Bannai, Masayuki Takeda, Kazuhito Hagio, 2011, Stringology.

Music Genre Classification using Similarity Functions

Hideo Bannai, Masayuki Takeda, Kohei Hatano, 2011, ISMIR.

Counting and Verifying Maximal Palindromes

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2010, SPIRE.

Dynamic Index and LZ Factorization in Compressed Space pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, Stringology.

Space-Economical Construction of Index Structures for All Suffixes of a String

Ayumi Shinohara, Setsuo Arikawa, Hideo Bannai, 2002, MFCS.

Lyndon Factorization of Grammar Compressed Texts Revisited

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, CPM.

Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, MFCS.

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, Theor. Comput. Sci..

Small-Space LCE Data Structure with Constant-Time Queries

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, MFCS.

On Longest Common Property Preserved Substring Queries

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, SPIRE.

DAWGs for parameterized matching: online construction and related indexing structures pdf

Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, 2020, CPM.

On the Complexity of Deriving Position Specific Score Matrices from Examples

Satoru Miyano, Tatsuya Akutsu, Hideo Bannai, 2002, CPM.

Fast q-gram mining on SLP compressed strings pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, J. Discrete Algorithms.

Factorizing a String into Squares in Linear Time

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, CPM.

Faster queries for longest substring palindrome after block edit

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, CPM.

Converting SLP to LZ78 in almost Linear Time

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, CPM.

Combining Gene Expression Data with DNA Sequence Information for Estimating Gene Networks Using Bayesian Network Model

Sun Yong Kim, Satoru Miyano, Hideo Bannai, 2003 .

Efficient Computation of Substring Equivalence Classes with Suffix Arrays

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2007, CPM.

Online LZ77 Parsing and Matching Statistics with RLBWTs pdf

Hideo Bannai, Travis Gagie, I Tomohiro, 2018, CPM.

String Kernels Based on Variable-Length-Don't-Care Patterns

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2008, Discovery Science.

Simpler and Faster Lempel Ziv Factorization

Hideo Bannai, Keisuke Goto, 2013, 2013 Data Compression Conference.

The Position Heap of a Trie

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2012, SPIRE.

On Reverse Engineering the Lyndon Tree

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, Stringology.

Indexing the Bijective BWT

Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, 2019, CPM.

Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, SPIRE.

Eager XPath Evaluation over XML Streams

Hideo Bannai, Masayuki Takeda, Kazuhito Hagio, 2012, SPIRE.

Lightweight Parameterized Suffix Array Construction

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2009, IWOCA.

Permuted Pattern Matching on Multi-track Strings

Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, 2013, SOFSEM.

Efficient Computation of Substring Equivalence Classes with Suffix Arrays

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2007, Algorithmica.

Longest Lyndon Substring After Edit

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, CPM.

A Series of Run-Rich Strings

Ayumi Shinohara, Hideo Bannai, Wataru Matsubara, 2009, LATA.

Block Palindromes: A New Generalization of Palindromes pdf

Hideo Bannai, Shunsuke Inenaga, I Tomohiro, 2018, SPIRE.

Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks

Satoru Miyano, Hideo Bannai, Seiya Imoto, 2005, ICCSA.

O(n log n)-time text compression by LZ-style longest first substitution

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, Stringology.

A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, SPIRE.

The Number of Runs in a Ternary Word

Ayumi Shinohara, Hideo Bannai, Jamie Simpson, 2010, Stringology.

Parameterized Suffix Arrays for Binary Strings

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2008, Stringology.

Views: Fundamental Building Blocks in the Process of Knowledge Discovery

Satoru Miyano, Kenta Nakai, Hideo Bannai, 2001, FLAIRS.

Finding All Maximal Perfect Haplotype Blocks in Linear Time

Jens Stoye, Hideo Bannai, Pierre Peterlongo, 2019, WABI.

Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance

Ayumi Shinohara, Satoru Miyano, Kenta Nakai, 2004, Discovery Science.

Computing longest common square subsequences

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, CPM.

An Opportunistic Text Indexing Structure Based on Run Length Encoding

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, CIAC.

Computing Left-Right Maximal Generic Words

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, Stringology.

Lyndon Words, the Three Squares Lemma, and Primitive Squares pdf

Hideo Bannai, Yuto Nakashima, Takuya Mieno, 2020, SPIRE.

Inferring Strings from Full Abelian Periods

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, ISAAC.

Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection

Satoru Miyano, Hideo Bannai, Satoru Kuhara, 2003, ECCB.

Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2012, SOFSEM.

Counting Parameterized Border Arrays for a Binary Alphabet

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2009, LATA.

Inferring Strings from Graphs and Arrays

Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, 2003, MFCS.

Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets

Hideo Bannai, Keisuke Goto, 2014, 2014 Data Compression Conference.

Fully Dynamic Data Structure for LCE Queries in Compressed Space pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, MFCS.

Computing Abelian Covers and Abelian Runs

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2014, Stringology.

Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, CPM.

Discovering Most Classificatory Patterns for Very Expressive Pattern Classes

Ayumi Shinohara, Setsuo Arikawa, Hideo Bannai, 2003, Discovery Science.

k-Abelian Pattern Matching: Revisited, Corrected, and Extended

Maxime Crochemore, Hideo Bannai, Golnaz Badkobeh, 2019, Stringology.

Compressed Automata for Dictionary Matching

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, CIAA.

Finding Optimal Pairs of Patterns

Ayumi Shinohara, Satoru Miyano, Kenta Nakai, 2004, WABI.

Order Preserving Pattern Matching on Trees and DAGs

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, SPIRE.

Constructing LZ78 tries and position heaps in linear time for large alphabets pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, Inf. Process. Lett..

Deterministic sub-linear space LCE data structures with efficient construction

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, CPM.

VML: A View Modeling Language for Computational Knowledge Discovery

Satoru Miyano, Hideo Bannai, Osamu Maruyama, 2001, Discovery Science.

Refining the r-index

Hideo Bannai, Travis Gagie, I Tomohiro, 2018, Theor. Comput. Sci..

Sparse Substring Pattern Set Discovery Using Linear Programming Boosting

Hideo Bannai, Masayuki Takeda, Kohei Hatano, 2010, Discovery Science.

Longest substring palindrome after edit

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, CPM.

Simple Linear-Time Off-Line Text Compression by Longest-First Substitution

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2007, DCC.

The "Runs" Theorem

Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, 2017, SIAM J. Comput..

The Parameterized Position Heap of a Trie

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, CIAC.

Minimal Unique Substrings and Minimal Absent Words in a Sliding Window

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2020, SOFSEM.

Faster Online Elastic Degenerate String Matching

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, CPM.

Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models

Satoru Miyano, Hideo Bannai, Seiya Imoto, 2005, J. Bioinform. Comput. Biol..

Faster STR-EC-LCS Computation pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2020, SOFSEM.

Efficient LZ78 Factorization of Grammar Compressed Text

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2012, SPIRE.

Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, SPIRE.

Computing q-gram Frequencies on Collage Systems pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, ArXiv.

Compact Data Structures for Shortest Unique Substring Queries pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, SPIRE.

Computing Palindromic Trees for a Sliding Window and Its Applications pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2020, ArXiv.

Dynamic index, LZ factorization, and LCE queries in compressed space pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, ArXiv.

General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations

Hideo Bannai, Masayuki Takeda, I Tomohiro, 2012, ECML/PKDD.

Efficiently Finding Regulatory Elements Using Correlation with Gene Expression

Ayumi Shinohara, Satoru Miyano, Hideo Bannai, 2004, J. Bioinform. Comput. Biol..

Computing runs on a trie pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, CPM.

Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality

Masao Nagasaki, Satoru Miyano, Hideo Bannai, 2009, Discovery Science.

Discovering Best Variable-Length-Don't-Care Patterns

Ayumi Shinohara, Setsuo Arikawa, Hideo Bannai, 2002, Discovery Science.

Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, IWOCA.

Computing Smallest and Largest Repetition Factorizations in O(n log n) Time

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, Stringology.

Polyphonic Music Classification on Symbolic Data Using Dissimilarity Functions

Hideo Bannai, Masayuki Takeda, Ken Satoh, 2012, ISMIR.

On the size of the smallest alphabet for Lyndon trees

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2019, Theor. Comput. Sci..

LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2015, CPM.

Fast algorithm for extracting multiple unordered short motifs using bit operations

Satoru Miyano, Hideo Bannai, Osamu Maruyama, 2002, Inf. Sci..

Restructuring Compressed Texts without Explicit Decompression pdf

Hiroshi Sakamoto, Hideo Bannai, Shunsuke Inenaga, 2011, ArXiv.

Order-Preserving Pattern Matching Indeterminate Strings pdf

Luís M. S. Russo, Hideo Bannai, Alexandre P. Francisco, 2018, CPM.

Diverse Palindromic Factorization Is NP-complete

Hideo Bannai, Shunsuke Inenaga, Juha Kärkkäinen, 2015, DLT.

Finding Gapped Palindromes Online

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, IWOCA.

Faster Compact On-Line Lempel-Ziv Factorization

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2014, STACS.

Fast q-gram Mining on SLP Compressed Strings

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, SPIRE.

Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2020, CPM.

More Speed and More Pattern Variations for Knowledge Discovery System BONSAI

Ayumi Shinohara, Satoru Miyano, Hideo Bannai, 2001 .

Finding Characteristic Substrings from Compressed Texts

Hideo Bannai, Shunsuke Inenaga, 2012, Int. J. Found. Comput. Sci..

Algorithms for String Pattern Discovery

Hideo Bannai, H. Bannai, 2007, MDAI.

A new characterization of maximal repetitions by Lyndon trees pdf

Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, 2015, SODA.

Linear-Time Text Compression by Longest-First Substitution

Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, 2009, Algorithms.

Intrasplicing - Analysis of Long Intron Sequences

Satoru Miyano, Kenta Nakai, Hideo Bannai, 2002, Pacific Symposium on Biocomputing.

Shortest Unique Substring Queries on Run-Length Encoded Strings

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, MFCS.

Shortest Unique Substrings Queries in Optimal Time

Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, 2014, SOFSEM.

Computing Abelian String Regularities Based on RLE

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, IWOCA.

Computing Longest Common Substring/Subsequence of Non-linear Texts

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2011, Stringology.

From Run Length Encoding to LZ78 and Back Again

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, 2013 Data Compression Conference.

The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation

Hideo Bannai, Eijiro Sumii, H. Bannai, 2003, J. Funct. Log. Program..

Generalized pattern matching and periodicity under substring consistent equivalence relations

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2016, Theor. Comput. Sci..

Reachability on Suffix Tree Graphs

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2008, Int. J. Found. Comput. Sci..

On repetitiveness measures of Thue-Morse words

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2020, SPIRE.

Efficient Lyndon Factorization of Grammar Compressed Text pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, CPM.

Verifying a Parameterized Border Array in O(n1.5) Time

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2010, CPM.

Uniqueness of certain association schemes

Hideo Bannai, Eiichi Bannai, Etsuko Bannai, 2008, Eur. J. Comb..

Right-to-left online construction of parameterized position heaps

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2018, Stringology.

Dynamic Packed Compact Tries Revisited pdf

Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, 2019, ArXiv.

Space Efficient Linear Time Lempel-Ziv Factorization on Constant~Size~Alphabets pdf

Hideo Bannai, Keisuke Goto, 2013, ArXiv.

Detecting Regularities on Grammar-Compressed Strings pdf

Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga, 2013, MFCS.

Closed Factorization

Costas S. Iliopoulos, Hideo Bannai, Shunsuke Inenaga, 2014, Stringology.

New Lower Bounds for the Maximum Number of Runs in a String pdf

Hideo Bannai, Akira Ishino, Wataru Matsubara, 2008, Stringology.

Computing Convolution on Grammar-Compressed Text

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, 2013 Data Compression Conference.

Computing All Distinct Squares in Linear Time for Integer Alphabets

Hideo Bannai, Shunsuke Inenaga, Dominik Köppl, 2017, CPM.

A Definition of Discovery in Terms of Generalized Descriptional Complexity

Satoru Miyano, Hideo Bannai, S. Miyano, 1999, Discovery Science.

Constructing the Bijective BWT pdf

Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, 2019, ArXiv.

Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, ISAAC.

Computing Reversed Lempel-Ziv Factorization Online

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2013, Stringology.

Computing Maximal Palindromes and Distinct Palindromes in a Trie

Hideo Bannai, Yuto Nakashima, Mitsuru Funakoshi, 2019, Stringology.

Grammar-compressed Self-index with Lyndon Words pdf

Kazuya Tsuruta, Hideo Bannai, Shunsuke Inenaga, 2020, ArXiv.

Faster STR-IC-LCS computation via RLE

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2017, CPM.

Inferring Strings from Lyndon Factorization

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2014, MFCS.

An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs

Ayumi Shinohara, Satoru Miyano, Kenta Nakai, 2004, IEEE ACM Trans. Comput. Biol. Bioinform..

Computing Minimal Unique Substrings for a Sliding Window

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2021, Algorithmica.

c-trie++: A dynamic trie tailored for fast prefix searches

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2021, Information and Computation.

Grammar Index By Induced Suffix Sorting

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2021, SPIRE.

Repetitions in Strings: A "Constant" Problem (Invited Talk)

Hideo Bannai, 2021, CPM.

Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time

Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, 2021, CPM.

Computing Longest (Common) Lyndon Subsequences pdf

Hideo Bannai, Simon J. Puglisi, I Tomohiro, 2022, ArXiv.

A Separation of $\gamma$ and $b$ via Thue--Morse Words

Hideo Bannai, I Tomohiro, Mitsuru Funakoshi, 2021, 2104.09985.

Combinatorics of minimal absent words for a sliding window pdf

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2021, ArXiv.

Longest previous overlapping factor array

Hideo Bannai, Shunsuke Inenaga, Neerja Mhaskar, 2021, Inf. Process. Lett..

Efficiently computing runs on a trie

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2021, Theor. Comput. Sci..

Longest Common Rollercoasters

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2021, SPIRE.

Compressed Communication Complexity of Hamming Distance

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2021, Algorithms.

On the existence of tight relative 2-designs on binary Hamming association schemes

Hideo Bannai, Eiichi Bannai, Etsuko Bannai, 2013 .

Verifying a Parameterized Border Array in O ( n 1 . 5 )

Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, 2010 .

Memory-Efficient Clustering Algorithms for Microarray Gene Expression Data

Satoru Miyano, Hideo Bannai, Seiya Imoto, 2005 .

Transcriptional profiling of hematopoietic stem cells by high-throughput sequencing

Satoru Miyano, Hideo Bannai, Yoshimi Yashiro, 2009, International journal of hematology.