Hideo Bannai
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
131
Venues
23
Active years
1999–2026
Best venue rank
A*
Where they publish
- BCPM37 papers
- CSPIRE27 papers
- ADIS11 papers
- BMFCS9 papers
- BDCC8 papers
- CIWOCA7 papers
- BSOFSEM7 papers
- AESA3 papers
- CWABI3 papers
- CCIAC3 papers
- BISAAC3 papers
- CLATA2 papers
- A*KR1 paper
- CDLT1 paper
- A*SODA1 paper
- ASTACS1 paper
- BMDAI1 paper
- CICCSA1 paper
- CECCB1 paper
- NationalPSB1 paper
- NationalFLOPS1 paper
- BAPLAS1 paper
- NationalFlAIRS1 paper
Papers
131 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | The Smallest String Attractors of Fibonacci and Period-Doubling Words. | Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Kppl, Takuya Mieno, Yoshio Okamoto |
| 2026 | CPM | Sensitivity of Repetitiveness Measures to String Reversal. | Hideo Bannai, Yuto Fujie, Peaker Guo, Shunsuke Inenaga, Yuto Nakashima, Simon J. Puglisi, Cristian Urbina |
| 2026 | CPM | On Occurrence-Preserving Morphisms. | Kaisei Kishi, Peaker Guo, Cristian Urbina, Hideo Bannai |
| 2026 | KR | Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis. | Mutsunori Banbara, Hideo Bannai, Takashi Horiyama, Dominik Kppl, Takuya Mieno, Hidetomo Nabeshima |
| 2025 | CPM | Text Indexing for Simple Regular Expressions. | Hideo Bannai, Philip Bille, Inge Li Grtz, Gad M. Landau, Gonzalo Navarro, Nicola Prezza, Teresa Anna Steiner, Simon Rumle Tarnow |
| 2025 | CPM | On the Compressiveness of the Burrows-Wheeler Transform. | Hideo Bannai, Tomohiro I, Yuto Nakashima |
| 2025 | SPIRE | Nyldon Factorization of Thue-Morse Words and Fibonacci Words. | Kaisei Kishi, Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2025 | SPIRE | Counting Distinct (Non-)crossing Substrings. | Haruki Umezaki, Hiroki Shibata, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2024 | CPM | Maintaining the Size of LZ77 on Semi-Dynamic Strings. | Hideo Bannai, Panagiotis Charalampopoulos, Jakub Radoszewski |
| 2024 | DCC | On the Hardness of Smallest RLSLPs and Collage Systems. | Akiyoshi Kawamoto, Tomohiro I, Dominik Kppl, Hideo Bannai |
| 2024 | ESA | Height-Bounded Lempel-Ziv Encodings. | Hideo Bannai, Mitsuru Funakoshi, Diptarama Hendrian, Myuji Matsuda, Simon J. Puglisi |
| 2024 | IWOCA | Computing Maximal Palindromes in Non-standard Matching Models. | Mitsuru Funakoshi, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2024 | MFCS | Edit and Alphabet-Ordering Sensitivity of Lex-Parse. | Yuto Nakashima, Dominik Kppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai |
| 2024 | SPIRE | Bijective BWT Based Compression Schemes. | Golnaz Badkobeh, Hideo Bannai, Dominik Kppl |
| 2024 | SPIRE | On the Number of Non-equivalent Parameterized Squares in a String. | Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | CPM | Optimal LZ-End Parsing Is Hard. | Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno |
| 2023 | ESA | Lyndon Arrays in Sublinear Time. | Hideo Bannai, Jonas Ellert |
| 2023 | SOFSEM | Space-Efficient STR-IC-LCS Computation. | Yuuki Yonemoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | SPIRE | Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings. | Kouta Okabe, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2023 | WABI | Acceleration of FM-Index Queries Through Prefix-Free Parsing. | Aaron Hong, Marco Oliva, Dominik Kppl, Hideo Bannai, Christina Boucher, Travis Gagie |
| 2022 | ESA | Computing NP-Hard Repetitiveness Measures via MAX-SAT. | Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Kppl, Takaaki Nishimoto |
| 2022 | IWOCA | Computing Longest (Common) Lyndon Subsequences. | Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Kppl, Simon J. Puglisi |
| 2022 | SPIRE | Online Algorithms for Finding Distinct Substrings with Length and Multiple Prefix and Suffix Conditions. | Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai, Takuya Mieno |
| 2021 | CIAC | The Parameterized Suffix Tray. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | CPM | 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 Krkkinen, Dominik Kppl, Marcin Piatkowski |
| 2021 | SPIRE | Grammar Index by Induced Suffix Sorting. | Tooru Akagi, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | A Separation of γ and b via Thue-Morse Words. | Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Kppl, Takuya Mieno, Takaaki Nishimoto |
| 2021 | SPIRE | Longest Common Rollercoasters. | Kosuke Fujita, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | CPM | Detecting k-(Sub-)Cadences and Equidistant Subsequence Occurrences. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara |
| 2020 | CPM | DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures. | Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda |
| 2020 | DCC | c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. | Kazuya Tsuruta, Dominik Kppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SOFSEM | Minimal Unique Substrings and Minimal Absent Words in a Sliding Window. | Takuya Mieno, Yuki Kuhara, Tooru Akagi, Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SOFSEM | Faster STR-EC-LCS Computation. | Kohei Yamada, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SPIRE | Lyndon Words, the Three Squares Lemma, and Primitive Squares. | Hideo Bannai, Takuya Mieno, Yuto Nakashima |
| 2020 | SPIRE | Longest Square Subsequence Problem Revisited. | Takafumi Inoue, Shunsuke Inenaga, Hideo Bannai |
| 2020 | SPIRE | On Repetitiveness Measures of Thue-Morse Words. | Kanaru Kutsukake, Takuya Matsumoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2020 | SPIRE | Towards Efficient Interactive Computation of Dynamic Time Warping Distance. | Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CIAC | The Parameterized Position Heap of a Trie. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Indexing the Bijective BWT. | Hideo Bannai, Juha Krkkinen, Dominik Kppl, Marcin Piatkowski |
| 2019 | CPM | Faster Queries for Longest Substring Palindrome After Block Edit. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Computing Runs on a Trie. | Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | DCC | MR-RePair: Grammar Compression Based on Maximal Repeats. | Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida |
| 2019 | ISAAC | An Improved Data Structure for Left-Right Maximal Generic Words Problem. | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | IWOCA | Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings. | Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | SPIRE | Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | SPIRE | On Longest Common Property Preserved Substring Queries. | Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka |
| 2019 | SPIRE | Compact Data Structures for Shortest Unique Substring Queries. | Takuya Mieno, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | WABI | Finding All Maximal Perfect Haplotype Blocks in Linear Time. | Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye |
| 2018 | CPM | Faster Online Elastic Degenerate String Matching. | Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Online LZ77 Parsing and Matching Statistics with RLBWTs. | Hideo Bannai, Travis Gagie, Tomohiro I |
| 2018 | CPM | Longest substring palindrome after edit. | Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Lyndon Factorization of Grammar Compressed Texts Revisited. | Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Order-Preserving Pattern Matching Indeterminate Strings. | Rui Henriques, Alexandre P. Francisco, Lus M. S. Russo, Hideo Bannai |
| 2018 | CPM | Computing longest common square subsequences. | Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyr, Hideo Bannai, Masayuki Takeda |
| 2018 | CPM | Longest Lyndon Substring After Edit. | Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2018 | SPIRE | Block Palindromes: A New Generalization of Palindromes. | Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga |
| 2018 | SPIRE | Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays. | Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | CPM | Computing All Distinct Squares in Linear Time for Integer Alphabets. | Hideo Bannai, Shunsuke Inenaga, Dominik Kppl |
| 2017 | CPM | Faster STR-IC-LCS Computation via RLE. | Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | CPM | Tight Bounds on the Maximum Number of Shortest Unique Substrings. | Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | ISAAC | Almost Linear Time Computation of Maximal Repetitions in Run Length Encoded Strings. | Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | IWOCA | Shortest Unique Palindromic Substring Queries in Optimal Time. | Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | IWOCA | Computing Abelian String Regularities Based on RLE. | Shiho Sugimoto, Naoki Noda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | MFCS | Small-Space LCE Data Structure with Constant-Time Queries. | Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2017 | SOFSEM | 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 |
| 2017 | SPIRE | Order Preserving Pattern Matching on Trees and DAGs. | Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | CPM | Factorizing a String into Squares in Linear Time. | Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea |
| 2016 | CPM | Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction. | Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda |
| 2016 | IWOCA | Finding Gapped Palindromes Online. | Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | MFCS | Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets. | Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | MFCS | Shortest Unique Substring Queries on Run-Length Encoded Strings. | Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2016 | MFCS | Fully Dynamic Data Structure for LCE Queries in Compressed Space. | Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | CIAC | An Opportunistic Text Indexing Structure Based on Run Length Encoding. | Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | CPM | LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2015 | CPM | Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree. | Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | DLT | Diverse Palindromic Factorization Is NP-complete. | Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Krkkinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto |
| 2015 | ISAAC | Inferring Strings from Full Abelian Periods. | Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2015 | SODA | A new characterization of maximal repetitions by Lyndon trees. | Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta |
| 2015 | SPIRE | Efficient Algorithms for Longest Closed Factor Array. | Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, Tomasz Walen |
| 2015 | SPIRE | A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String. | Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | CPM | Computing Palindromic Factorizations and Palindromic Covers On-line. | Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | DCC | Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets. | Keisuke Goto, Hideo Bannai |
| 2014 | MFCS | Inferring Strings from Lyndon Factorization. | Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2014 | STACS | Faster Compact On-Line Lempel-Ziv Factorization. | Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2014 | SOFSEM | Shortest Unique Substrings Queries in Optimal Time. | Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | CPM | Converting SLP to LZ78 in almost Linear Time. | Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda |
| 2013 | CPM | Efficient Lyndon Factorization of Grammar Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | DCC | Simpler and Faster Lempel Ziv Factorization. | Keisuke Goto, Hideo Bannai |
| 2013 | DCC | From Run Length Encoding to LZ78 and Back Again. | Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | DCC | Computing Convolution on Grammar-Compressed Text. | Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2013 | MFCS | Detecting Regularities on Grammar-Compressed Strings. | Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara |
| 2013 | SOFSEM | Permuted Pattern Matching on Multi-track Strings. | Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga |
| 2013 | SPIRE | Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text. | Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2012 | CPM | Speeding Up q-Gram Mining on Grammar-Based Compressed Texts. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SOFSEM | Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SPIRE | Efficient LZ78 Factorization of Grammar Compressed Text. | Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2012 | SPIRE | Eager XPath Evaluation over XML Streams. | Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, Masayuki Takeda |
| 2012 | SPIRE | The Position Heap of a Trie. | Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2011 | CPM | Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts. | Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2011 | SPIRE | Fast q-gram Mining on SLP Compressed Strings. | Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2010 | CPM | Verifying a Parameterized Border Array in | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2010 | DIS | Sparse Substring Pattern Set Discovery Using Linear Programming Boosting. | Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda |
| 2010 | SPIRE | Counting and Verifying Maximal Palindromes. | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2009 | DIS | Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem Using Betweenness Centrality. | Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, Satoru Miyano |
| 2009 | IWOCA | Lightweight Parameterized Suffix Array Construction. | Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2009 | LATA | Counting Parameterized Border Arrays for a Binary Alphabet. | Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2009 | LATA | A Series of Run-Rich Strings. | Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara |
| 2008 | DIS | String Kernels Based on Variable-Length-Don't-Care Patterns. | Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda |
| 2007 | CPM | Efficient Computation of Substring Equivalence Classes with Suffix Arrays. | Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2007 | DCC | Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. | Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda |
| 2007 | DIS | Unsupervised Spam Detection Based on String Alienness Measures. | Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Masayuki Takeda |
| 2007 | MDAI | Algorithms for String Pattern Discovery. | Hideo Bannai |
| 2006 | DIS | A New Family of String Classifiers Based on Local Relatedness. | Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2005 | DIS | Practical Algorithms for Pattern Based Linear Regression. | Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda |
| 2005 | ICCSA | Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks. | Osamu Hirose, Naoki Nariai, Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Satoru Miyano |
| 2004 | DIS | 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 |
| 2004 | WABI | Finding Optimal Pairs of Patterns. | Hideo Bannai, Heikki Hyyr, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano |
| 2003 | DIS | Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. | Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa |
| 2003 | ECCB | Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection. | Yoshinori Tamada, SunYong Kim, Hideo Bannai, Seiya Imoto, Kousuke Tashiro, Satoru Kuhara, Satoru Miyano |
| 2003 | MFCS | Inferring Strings from Graphs and Arrays. | Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2003 | PSB | Intrasplicing - Analysis of Long Intron Sequences. | Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, Satoru Miyano |
| 2002 | CPM | On the Complexity of Deriving Position Specific Score Matrices from Examples. | Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sascha Ott |
| 2002 | DIS | Discovering Best Variable-Length-Don't-Care Patterns. | Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa |
| 2002 | FLOPS | VM lambda: A Functional Calculusfor Scientific Discovery. | Eijiro Sumii, Hideo Bannai |
| 2002 | MFCS | Space-Economical Construction of Index Structures for All Suffixes of a String. | Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa |
| 2001 | APLAS | VM lambda: a Functional Calculus for Scientific Discovery. | Eijiro Sumii, Hideo Bannai |
| 2001 | DIS | VML: A View Modeling Language for Computational Knowledge Discovery. | Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Satoru Miyano |
| 2001 | FlAIRS | Views: Fundamental Building Blocks in the Process of Knowledge Discovery. | Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, Satoru Miyano |
| 1999 | DIS | A Definition of Discovery in Terms of Generalized Descriptional Complexity. | Hideo Bannai, Satoru Miyano |