Hideo Bannai's Publications

[DBLP] [Google Scholar] [ Journal Papers] [ Proceedings (peer reviewed)] [ Invited Talks] [ Posters]

Journal Papers

    2018

  1. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, and Shiho Sugimoto,
    Diverse Palindromic Factorization is NP-Complete,
    International Journal of Foundations of Computer Science, 29(2):143-163, (2018). (link)
  2. Hiroe Inoue, Yuto Nakashima, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Algorithms and combinatorial properties on shortest unique palindromic substrings,
    J. Discrete Algorithms, 52-53:122-132, (2018). (link)
  3. 2017

  4. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta,
    The "Runs" Theorem,
    SIAM Journal on Computing, 46(5):1501-1514, (2017). (link, arXiv)
  5. Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Efficient Computation of Substring Equivalence Classes with Suffix Arrays,
    Algorithmica, 79(2):291-318, (2017). (link)
  6. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Inferring strings from Lyndon factorization,
    Theoretical Computer Science, 689:147-156, (2017). (link)
  7. 2016

  8. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, Shiho Sugimoto,
    Closed factorization,
    Discrete Applied Mathematics, 212:23-29, (2016). (link)
  9. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Faster Lyndon factorization algorithms for SLP and LZ78 compressed text,
    Theoretical Computer Science, 656:215-224, (2016). (link)
  10. Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Generalized pattern matching and periodicity under substring consistent equivalence relations,
    Theoretical Computer Science, 656:225-233, (2016). (link)
  11. 2015

  12. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Constructing LZ78 tries and position heaps in linear time for large alphabets,
    Information Processing Letters, 115(9):655-659, (2015). (link)
  13. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Compressed automata for dictionary matching,
    Theoretical Computer Science, 578:30-41, (2015). (link)
  14. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, and Ayumi Shinohara,
    Detecting regularities on grammar-compressed strings,
    Information and Computation, 240:74-89, (2015). (link)
  15. 2014

  16. Eiichi Bannai, Etsuko Bannai, Hideo Bannai,
    On the existence of tight relative 2-designs on binary Hamming association schemes,
    Discrete Mathematics, 314(6):17-37, (2014). (link)
  17. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Inferring strings from suffix trees and links on a binary alphabet,
    Discrete Applied Mathematics, 163:316-325 (2014). (link)
  18. 2013

  19. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    Fast q-gram mining on SLP compressed strings,
    Journal of Discrete Algorithms, 18:89-99, (2013). (link)
  20. 2012

  21. Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, and Moshe Lewenstein,
    An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Straight-Line Programs,
    Information Processing Letters, 112(19):711-714, (2012). (link)
  22. Shunsuke Inenaga and Hideo Bannai,
    "Finding Characteristic Substrings from Compressed Texts",
    International Journal of Foundations of Computer Science, 23(2):261-280, (2012). (link)
  23. 2011

  24. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Verifying and enumerating parameterized border arrays,
    Theoretical Computer Science, 412(50):6959-6981, (2011). (link)
  25. 2009

  26. Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, and Ayumi Shinohara,
    "Linear-Time Text Compression by Longest-First Substitution",
    Algorithms, 2(4):1429-1448, (2009). (link)
  27. Yoshimi Yashiro, Hideo Bannai, Takashi Minowa, Tomohide Yabiku, Satoru Miyano, Mitsujiro Osawa, Atsushi Iwama, and Hiromitsu Nakauchi,
    "Transcriptional profiling of hematopoietic stem cells by high-throughput sequencing",
    International Journal of Hematology, 89(1):24-33, (2009). (link)
  28. 2008

  29. Eiichi Bannai, Etsuko Bannai, Hideo Bannai,
    "Uniqueness of Certain Association Schemes",
    European Journal of Combinatorics, 29(6):1379-1395, (2008). (link) (supplemental web page)
  30. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    "Reachability on Suffix Tree Graphs",
    International Journal of Foundations of Computer Science, 19(1):147-162, (2008). (link)
  31. 2007

  32. Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, and Sascha Ott,
    "On the complexity of deriving position specific score matrices from positive and negative sequences",
    Discrete Applied Mathematics, 155:676-685, (2007). (link)
  33. 2006

  34. Yoshio Takei, Akatsuki Kawakoshi, Takehiro Tsukada, Shinya Yuge, Maho Ogoshi, Koji Inoue, Susumu Hyodo, Hideo Bannai, and Satoru Miyano,
    "Contribution of comparative fish studies to general endocrinology: structure and function of some osmoregulatory hormones",
    Journal of Experimental Zoology Part A: Comparative Experimental Biology, 35(9):787-798, (2006). (link)
  35. 2005

  36. Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Toshiaki Katayama, Minoru Kanehisa, and Satoru Miyano,
    "Utilizing Evolutionary Information and Gene Expression Data for Estimating Gene Networks with Bayesian Network Models",
    Journal of Bioinformatics and Computational Biology, 3(6):1295-1313, (2005). (link)
  37. 2004

  38. Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano,
    "An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs",
    IEEE/ACM Transactions on Computational Biology and Bioinformatics (special section on the Workshop on Algorithms in Bioinformatics), 1(4):159-170, (2004). (link)
  39. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano,
    "Efficiently Finding Regulatory Elements using Correlation with Gene Expression",
    Journal of Bioinformatics and Computational Biology, 2(2):273-288, (2004). (link) (draft version)
  40. Yoshio Takei, Koji Inoue, Maho Ogoshi, Tetsushi Kawahara, Hideo Bannai, and Satoru Miyano,
    "Identification of novel adrenomedullin in mammals: a potent cardiovascular and renal regulator",
    FEBS Letters, 556:53-58, (2004). (link)
  41. 2003

  42. Yoshinori Tamada, Sunyong Kim, Hideo Bannai, Seiya Imoto, Kousuke Tashiro, Satoru Kuhara, and Satoru Miyano,
    "Estimating Gene Networks from Gene Expression Data by Combining Bayesian Network Model with Promoter Element Detection",
    Bioinformatics, 19 (Suppl.2):ii227-ii236, (2003). (LINK)
  43. Eijiro Sumii, Hideo Bannai,
    "The Extension of ML with Hypothetical Views for Discovery Science: Formalization and Implementation",
    Journal of Functional and Logic Programming, Volume 2003: Special Issue 1, (2003).

    2002

  44. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, and Satoru Miyano,
    "Extensive Feature Detection of N-Terminal Protein Sorting Signals",
    Bioinformatics, 18(2):298-305 (2002). (LINK, PDF)
  45. Osamu Maruyama, Hideo Bannai, Yoshinori Tamada, Satoru Kuhara, and Satoru Miyano,
    "Fast algorithm for extracting multiple unordered short motifs using bit operations",
    Information Sciences, 146(1-4), 115-126 (2002). (link)

    2001

  46. Toru Nakayashiki, Kanae Ebihara, Hideo Bannai, and Yoshikazu Nakamura,
    "Yeast [PSI+] ''Prions'' that Are Crosstransmissible and Susceptible beyond a Species Barrier through a Quasi-Prion State",
    Molecular Cell, 7(6), 1121-1130 (June 2001). (link)
  47. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, and Satoru Miyano,
    "Concepts for Accelerating the Computational Knowledge Discovery Process",
    Linkoping Electronic Articles in Computer and Information Science, 6 (2001). http://www.ep.liu.se/ea/cis/2001/019/

Proceedings (Peer Reviewed)

    2019

  1. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets,
    In Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), accepted.
  2. Kazuki Kai, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomasz Kociumaka,
    On Longest Common Property Preserved Substring Queries,
    In Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), accepted.
  3. Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Compact Data Structures for Shortest Unique Substring Queries,
    In Proceedings of the 26th International Symposium on String Processing and Information Retrieval (SPIRE 2019), accepted.
  4. Jarno Alanko, Hideo Bannai, Bastien Cazaux, Pierre Peterlongo, Jens Stoye,
    Finding all maximal perfect haplotype blocks in linear time,
    In Proceedings of the 19th Workshop on Algorithms in Bioinformatics (WABI 2019), accepted.
  5. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Computing Maximal Palindromes and Distinct Palindromes in a Trie,
    In Proceedings of the Prague Stringology Conference 2019 (PSC 2019), accepted.
  6. Golnaz Badkobeh, Hideo Bannai, Maxime Crochemore, Tomohiro I, Shunsuke Inenaga, Shiho Sugimoto,
    k-Abelian pattern matching: Revisited, corrected, and extended,
    In Proceedings of the Prague Stringology Conference 2019 (PSC 2019), accepted.
  7. Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings,
    In Proceedings of the 30th International Workshop on Combinatorial Algorithms (IWOCA 2019), 430-441, (2019).
  8. Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski,
    Indexing the Bijective BWT,
    In Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 17:1-17:14, (2019).
  9. Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Computing Runs on a Trie,
    In Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 23:1-23:11, (2019).
  10. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Faster Queries for Longest Substring Palindrome After Block Edit,
    In Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 27:1-27:13, (2019).
  11. Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations,
    In Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 29:1-29:11, (2019).
  12. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    The Parameterized Position Heap of a Trie,
    In Proceedings of the 11th International Conference on Algorithms and Complexity (CIAC 2019), 237-248, (2019).
  13. Isamu Furuya, Takuya Takagi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Takuya Kida,
    MR-RePair: Grammar Compression Based on Maximal Repeats
    In Proc. Data Compression Conference (DCC 2019), 508-517, (2019).
  14. 2018

  15. Keisuke Goto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga,
    Block Palindromes: A New Generalization of Palindromes,
    In Proceedings of the 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018), 183-190, (2018). (link)
  16. Yuki Kuhara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Recovering, Counting and Enumerating Strings from Forward and Backward Suffix Arrays,
    In Proceedings of the 25th International Symposium on String Processing and Information Retrieval (SPIRE 2018), 254-267, (2018). (link)
  17. Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    O(n log n)-time Text Compression by LZ-style Longest First Substitution,
    In Proceedings of the Prague Stringology Conference 2018 (PSC 2018), 12-26, (2018). (link)
  18. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda,
    Right-to-left Online Construction of Parameterized Position Heaps,
    In Proceedings of the Prague Stringology Conference 2018 (PSC 2018), 91-102, (2018). (link)
  19. Rui Henriques, Alexandre Francisco, Luís Russo, and Hideo Bannai,
    Order-Preserving Pattern Matching Indeterminate Strings,
    In Proceedings of the 29th Annual Symposium on Combinatorial Pattern matching (CPM 2018), 2:1-2:15, (2018). (link)
  20. Hideo Bannai, Travis Gagie, and Tomohiro I,
    Online LZ77 Parsing and Matching Statistics with RLBWTs,
    In Proceedings of the 29th Annual Symposium on Combinatorial Pattern matching (CPM 2018), 7:1-7:12, (2018). (link)
  21. Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Faster Online Elastic Degenerate String Matching,
    In Proceedings of the 29th Annual Symposium on Combinatorial Pattern matching (CPM 2018), 9:1-9:10, (2018). (link)
  22. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Longest substring palindrome after edit,
    In Proceedings of the 29th Annual Symposium on Combinatorial Pattern matching (CPM 2018), 12:1-12:14, (2018). (link)
  23. Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, and Masayuki Takeda
    Computing longest common square subsequences,
    In Proceedings of the 29th Annual Symposium on Combinatorial Pattern matching (CPM 2018), 15:1-15:13, (2018). (link)
  24. Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Longest Lyndon Substring After Edit,
    In Proceedings of the 29th Annual Symposium on Combinatorial Pattern matching (CPM 2018), 19:1-19:10, (2018). (link)
  25. Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Lyndon Factorization of Grammar Compressed Texts Revisited,
    In Proceedings of the 29th Annual Symposium on Combinatorial Pattern matching (CPM 2018), 24:1-24:10, (2018). (link)
  26. 2017

  27. Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Almost linear time computation of maximal repetitions in run length encoded strings,
    In Proceedings of The 28th International Symposium on Algorithms and Computation (ISAAC 2017), accepted.
  28. Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Order Preserving Pattern Matching on Trees and DAGs,
    In Proceedings of the 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), 271-277, (2017). (link)
  29. Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda,
    Small-space LCE data structure with constant-time queries,
    In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 10:1-10:15, (2017).
  30. Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Faster STR-IC-LCS Computation via RLE,
    In Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 20:1-20:12, (2017). (link)
  31. Hideo Bannai, Shunsuke Inenaga, Dominik Köppl,
    Computing All Distinct Squares in Linear Time for Integer Alphabets,
    In Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 22:1-22:18, (2017). (link)
  32. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Tight Bounds on the Maximum Number of Shortest Unique Substrings,
    In Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 24:1-24:11, (2017). (link)
  33. Yohei Ueki, Diptarama, Masatoshi Kurihara, Yoshiaki Matsuoka, Kazuyuki Narisawa, Ryo Yoshinaka, Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara,
    Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings,
    In Proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2017), 363-374, (2017). (link)
    (Note: The publisher's version contains several crucial errors in the notation. See arXiv)
  34. 2016

  35. Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Computing Smallest and Largest Repetition Factorizations in O(n log n) Time,
    In Proceedings of The Prague Stringology Conference 2016 (PSC 2016), 135-145, (2016). (link)
  36. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Dynamic Index and LZ Factorization in Compressed Space,
    In Proceedings of The Prague Stringology Conference 2016 (PSC 2016), 158-170, (2016). (link)
  37. Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets,
    In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 38:1-38:14, (2016). (link)
  38. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Shortest Unique Substring Queries on Run-Length Encoded Strings,
    In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 69:1-69:11, (2016). (link)
  39. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Fully Dynamic Data Structure for LCE Queries in Compressed Space,
    In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 72:1-72:15, (2016). (link)
  40. Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Finding Gapped Palindromes Online,
    In Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), 191-202, (2016). (link)
  41. Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon Puglisi and Masayuki Takeda,
    Deterministic sub-linear space LCE data structures with efficient construction,
    In Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 1:1-1:10, (2016). (link)
  42. Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda and Florin Manea,
    Factorizing a string into squares in linear time,
    In Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 27:1-27:12, (2016). (link)
  43. 2015

  44. Makoto Nishida, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Inferring Strings from Full Abelian Periods,
    In Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC 2015), LNCS 9472:768-779, (December 2015). (link)
  45. Hideo Bannai, Shunsuke Inenaga, Tomasz Kociumaka, Arnaud Lefebvre, Jakub Radoszewski, Wojciech Rytter, Shiho Sugimoto, and Tomasz Walen,
    Efficient Algorithms for Longest Closed Factor Array,
    In Proceedings of the 22nd International Symposium on String Processing and Information Retrieval (SPIRE 2015), LNCS 9309: 95-102, (September 2015). (link)
  46. Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    A Faster Algorithm for Computing Maximal alpha-gapped Repeats in a String,
    In Proceedings of the 22nd International Symposium on String Processing and Information Retrieval (SPIRE 2015), LNCS 9309: 124-136, (September 2015). (link)
  47. Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Computing Left-Right Maximal Generic Words,
    In Proceedings of The Prague Stringology Conference 2015 (PSC 2015), 5-16, (August 2015). (link).
  48. Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, and Shiho Sugimoto,
    Diverse Palindromic Factorization Is NP-complete,
    In Proceedings of the 19th International Conference on Developments in Language Theory (DLT 2015), LNCS 9168:85-96, (July 2015). (link)
  49. Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Semi-dynamic compact index for short patterns and succinct van Emde Boas tree,
    In Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), LNCS 9133:355-366, (June 2015). (link)
  50. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding,
    In Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), LNCS 9133:219-230, (June 2015). (link)
  51. Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    An opportunistic text indexing structure based on run length encoding,
    In Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015), LNCS 9079:390-402, (May 2015). (link)
  52. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta,
    A new characterization of maximal repetitions by Lyndon trees,
    In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, 562-571, (January 2015). (SODA'15), (link).
  53. 2014

  54. Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Computing Abelian Covers and Abelian Runs,
    In Proceedings of The Prague Stringology Conference 2014 (PSC 2014), 43-51, (September 2014). (link).
  55. Golnaz Badkobeh, Hideo Bannai, Keisuke Goto, Tomohiro I, Costas S. Iliopoulos, Shunsuke Inenaga, Simon J. Puglisi, and Shiho Sugimoto,
    Closed Factorization,
    In Proceedings of The Prague Stringology Conference 2014 (PSC 2014), 162-168, (September 2014). (link).
  56. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
    Inferring Strings from Lyndon factorization,
    In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), 565-576, (August 2014). (link)
  57. Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Computing palindromic factorizations and palindromic covers on-line,
    In Proceeding of the 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), LNCS 8486:150-161, (June 2014). (link)
  58. Keisuke Goto and Hideo Bannai,
    Space Efficient Linear Time Lempel-Ziv Factorization for Small Alphabets,
    In Proc. Data Compression Conference 2014 (DCC 2014), 163-172, (March 2014). (code)
  59. Jun'ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    Faster Compact On-Line Lempel-Ziv Factorization,
    In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS 2014), 675-678, (March 2014). (PDF)
  60. Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Shortest Unique Substrings Queries in Optimal Time,
    In Proceedings of the 40th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2014), LNCS 8327:503-513, (January 2014). (code, PDF, link)
  61. 2013

  62. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Faster Lyndon factorization algorithms for SLP and LZ78 compressed text,
    In Proceedings of the 20th International Symposium on String Processing and Information Retrieval (SPIRE 2013), LNCS 8214:174-185 (October 2013). (link)
  63. Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Computing Reversed Lempel-Ziv Factorization Online,
    In Proceedings of The Prague Stringology Conference 2013 (PSC 2013), 107-118, (September 2013). (link).
  64. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, and Ayumi Shinohara,
    Detecting regularities on grammar-compressed strings,
    In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS 2013), LNCS 8087:571-582, (August 2013). (link), (arXiv)
  65. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Compressed Automata for Dictionary Matching,
    In Proceedings of the 18th International Conference on Implementation and Application of Automata (CIAA 2013), LNCS 7982:319-330, (July 2013). (link)
  66. Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga and Masayuki Takeda,
    Converting SLP to LZ78 in almost linear time,
    In Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), LNCS 7922:38-49, (June 2013). (link)
  67. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Efficient Lyndon factorization of grammar compressed text,
    In Proceedings of the 24th Annual Symposium on Combinatorial Pattern Matching (CPM 2013), LNCS 7922:153-164, (June 2013). (link), (arXiv)
  68. Keisuke Goto and Hideo Bannai,
    Simpler and Faster Lempel Ziv Factorization,
    In Proc. Data Compression Conference 2013 (DCC 2013), 133-142, (2013). (arXiv) (link)
  69. Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    From Run Length Encoding to LZ78 and Back Again,
    In Proc. Data Compression Conference 2013 (DCC 2013), 143-152, (2013). (link)
  70. Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Computing convolution on grammar-compressed text,
    In Proc. Data Compression Conference 2013 (DCC 2013), 451-460, (2013). (arXiv) (link)
  71. Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai and Shunsuke Inenaga,
    Permuted pattern matching on multi-track strings,
    In Proceedings of the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2013), LNCS 7741:280-291, (January 2013) (link)
  72. 2012

  73. Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    Efficient LZ78 factorization of grammar compressed text,
    In Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE 2012), LNCS 7608:86-98, (October 2012) (link), (arXiv), (presentation: pptx).
  74. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    The position heap of a trie,
    In Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE 2012), LNCS 7608:360-371, (October 2012) (link).
  75. Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, and Masayuki Takeda,
    Eager XPath Evaluation over XML Streams,
    In Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE 2012), LNCS 7608:245-250, (October 2012) (link).
  76. Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, and Ken Satoh,
    Polyphonic Music Classification on Symbolic Data using Dissimilarity Functions,
    In Proceedings of the 13th International Society for Music Information Retrieval Conference (ISMIR 2012), 229-234, (October 2012) (link).
  77. Tomohiro I, Yuki Enokuma, Hideo Bannai, and Masayuki Takeda,
    General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations,
    In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD 2012), LNCS 7524:435-450, (September 2012) (link).
  78. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    Speeding up q-gram mining on grammar-based compressed texts,
    In Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012), LNCS 7354:220-231, (July 2012) (link), qir, arxiv.
  79. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts, In Proceedings of the 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012), LNCS 7147:301-312, (January 2012) (link).
  80. 2011

  81. Yoko Anan, Kohei Hatano, Hideo Bannai, and Masayuki Takeda
    Music Genre Classification using Similarity Functions,
    In Proceedings of the 12th International Society for Music Information Retrieval Conference (ISMIR 2011), 693-698, (October 2011) (link).
  82. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda,
    Fast q-gram Mining on SLP Compressed Strings,
    In Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE 2011), LNCS 7024:278-289, (October 2011) (link) (QIR repository).
  83. Kazuhito Hagio, Takashi Ohgami, Hideo Bannai, and Masayuki Takeda
    Efficient Eager XPath Filtering over XML Streams,
    In Proceedings of The Prague Stringology Conference 2011 (PSC 2011), 30-44, (August 2011) (link).
  84. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda
    Inferring Strings from Suffix Trees and Links on a Binary Alphabet,
    In Proceedings of The Prague Stringology Conference 2011 (PSC 2011), 121-131, (August 2011) (link).
  85. Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    Computing Longest Common Substring/Subsequence of Non-linear Texts,
    In Proceedings of The Prague Stringology Conference 2011 (PSC 2011), 197-208, (August 2011) (link).
  86. Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda,
    Faster Subsequence and Don't-Care Pattern Matching on Compressed Texts,
    In Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM 2011), LNCS 6661:309-322, (June 2011) (link) (QIR repository).
  87. 2010

  88. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Counting and Verifying Maximal Palindromes,
    In Proceedings of the 17th International Symposium on String Processing and Information Retrieval (SPIRE 2010), LNCS 6393:135-146, (October 2010) (link).
  89. Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda,
    Sparse Substring Pattern Set Discovery using Linear Programming Boosting,
    In Proceedings of the 13th International Conference on Discovery Science (DS 2010), LNAI 6332:132-143, (October 2010) (link).
  90. Hideo Bannai, Mathieu Giraud, Kazuhiko Kusano, Wataru Matsubara, Ayumi Shinohara, Jamie Simpson,
    The Number of Runs in a Ternary Word,
    In Proceedings of The Prague Stringology Conference 2010 (PSC 2010), 178-181, (August 2010) (link).
  91. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,
    Verifying a Parameterized Border Array in O(n1.5) Time,
    In Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), LNCS 6129:238-250, (June 2010) (link).
  92. 2009

  93. Takanori Yamamoto, Hideo Bannai, Masao Nagasaki, and Satoru Miyano,
    "Better Decomposition Heuristics for the Maximum-Weight Connected Graph Problem using Betweenness Centrality",
    In Proceedings of the 12th International Conference on Discovery Science (DS2009), LNCS 5808:465-472, (October 2009) (link).
  94. Shunsuke Inenaga and Hideo Bannai,
    "Finding Characteristic Substrings from Compressed Texts",
    In Proceedings of The Prague Stringology Conference 2009 (PSC 2009), 40-54,2009, (August 2009) (link).
  95. Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino and Ayumi Shinohara,
    "Bit-parallel algorithms for computing all the runs in a string",
    In Proceedings of The Prague Stringology Conference 2009 (PSC 2009), 203-213, (August 2009) (link).
  96. Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    "Lightweight Parameterized Suffix Array Construction",
    In Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 2009), LNCS 5874: 312-323, (June 2009) (link).
  97. Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai and Ayumi Shinohara,
    "A Series of Run-rich Strings",
    In Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), LNCS 5457:578-587, (April 2009) (link).
  98. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda,
    "Counting Parameterized Border Arrays for a Binary Alphabet",
    In Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), LNCS 5457:422-433, (April 2009) (link).
  99. 2008

  100. Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda,
    "String Kernels Based on Variable-Length-Don't-Care Patterns",
    In Proceedings of the 11th International Conference on Discovery Science (DS2008), LNAI 5255:308-318, (October 2008) (link).
  101. Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai and Ayumi Shinohara,
    "New Lower Bounds for the Maximum Number of Runs in a String",
    In Proceedings of The Prague Stringology Conference 2008 (PSC2008), 140-145, (September 2008). (files)
  102. Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    "Parameterized Suffix Arrays for Binary Strings",
    In Proceedings of The Prague Stringology Conference 2008 (PSC2008), 84-94, (September 2008). (files)
  103. 2007

  104. Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, and Masayuki Takeda,
    "Unsupervised Spam Detection based on String Alienness Measures",
    In Proceedings of the 10th International Conference on Discovery Science (DS2007), LNAI 4755:161-172, (October 2007) (link). (Kazuyuki was awarded the Carl Smith Student Award for this paper)
  105. Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    "Efficient Computation of Substring Equivalence Classes with Suffix Arrays",
    In Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching (CPM2007), LNCS 4580:340-351, (July 2007) (link).
  106. Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    "Simple Linear-Time Off-Line Text Compression by Longest-First Substitution",
    Data Compression Conference (DCC 2007), 123-132. (March 2007) (link)
  107. 2006

  108. Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda,
    "A New Family of String Classifiers based on Local Relatedness",
    In Proceedings of the 9th International Conference on Discovery Science (DS2006), LNAI 4265:114-124, (October 2006) (link).
  109. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda,
    "Reachability on Suffix Tree Graphs",
    In Proceedings of The Prague Stringology Conference '06 (PSC'06), 212-225, (August 2006). (files)
  110. 2005

  111. Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, and Masayuki Takeda,
    "Practical Algorithms for Pattern Based Linear Regression",
    In Proceedings of the 8th International Conference on Discovery Science (DS 2005), LNAI 3735:44-56, (October 2005). (PDF) (link)
  112. Osamu Hirose, Naoki Nariai, Yoshinori Tamada, Hideo Bannai, Seiya Imoto, and Satoru Miyano,
    "Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks",
    In Proceedings of the First International Workshop on Data Mining and Bioinformatics (DMBIO2005), LNCS 3482:349-356, (May 2005).
  113. 2004

  114. Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano,
    "Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance",
    In Proceedings of the 7th International Conference on Discovery Science (DS 2004), LNAI 3245:32-46, (October 2004). (link)
  115. Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano,
    "Finding Optimal Pairs of Patterns",
    In Proceedings of the 4th International Workshop on Algorithms in Bioinformatics (WABI 2004), LNBI 3240:450-462, (Septemer 2004). (PDF) (link)
  116. 2003

  117. Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, and Setsuo Arikawa,
    "Discovering Most Classificatory Patterns for Very Expressive Pattern Classes",
    In Proceedings of the 6th International Conference on Discovery Science (DS 2003), LNAI 2843:486-493, (October 2003). (PDF).
  118. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda,
    "Inferring Strings from Graphs and Arrays",
    In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS2003), LNCS 2747:208-217, (August 2003). (PDF) (C) Springer-Verlag (link)
  119. Sascha Ott, Yoshinori Tamada, Hideo Bannai, Kenta Nakai, and Satoru Miyano,
    "Intrasplicing: analysis of long intron sequences",
    In Proceedings of the 8th Pacific Symposium on Biocomputing (PSB2003), 8:339-350, (January 2003). (PDF)
  120. 2002

  121. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano,
    "A String Pattern Regression Algorithm and Its Application to Pattern Discovery in Long Introns",
    Genome Informatics (GIW2002), 13:3-11, (December 2002). (myPDF, PDF)
  122. Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa,
    "Discovering Best Variable-Length-Don't-Care Patterns",
    In Proceedings of the 5th International Conference on Discovery Science (DS2002), LNAI 2534:86-97, (November 2002). (PDF) (link)
  123. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, and Setsuo Arikawa,
    "Space-Economical Construction of Index Structures for All Suffixes of a String",
    In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS2002), LNCS 2420:341-352, (August 2002). (PDF) (link)
  124. Tatsuya Akutsu, Hideo Bannai, Satoru Miyano, Sacha Ott,
    "On the Complexity of Deriving Position Specific Score Matrices from Examples",
    In Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM2002), LNCS 2373:168-177, (July 2002). (link)
  125. Eijiro Sumii, Hideo Bannai,
    "VMlambda: A Functional Calculus for Scientific Discovery",
    In Proceedings of the 6th International Symposium on Functional and Logic Programming (FLOPS 2002), LNCS 2441:290-304, (September 2002).
  126. Osamu Maruyama, Satoru Kuhara, Hideo Bannai, Satoru Miyano and Yoshinori Tamada,
    "Fast algorithm for extracting multiple unordered short motifs using bit operations",
    In Proceedings of the 6th Joint Conference on Information Science (JCIS 2002), 1180-1185, (March 2002).
  127. 2001

  128. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, and Satoru Miyano,
    "VML: A View Modeling Language for Computational Knowledge Discovery",
    In Proceedings of the 4th International Conference on Discovery Science (DS2001), LNAI 2226:30-44 (Novermber 2001).
  129. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, and Satoru Miyano,
    "Views: Fundamental Building Blocks in the Process of Knowledge Discovery",
    In Proceedings of the 14th International FLAIRS Conference, 233-238, AAAI Press, (May 2001). (postscript, gzipped postscript, PDF) (C) AAAI
  130. 1999

  131. Tomohiro Yasuda, Hideo Bannai, Shuichi Onami, Satoru Miyano, Hiroaki Kitano,
    "Towards Automatic Construction of Cell-Lineage of C. elegans from Nomarski DIC Microscope Images",
    Genome Informatics (GIW '99), 10:144-154 (December 1999). (PDF)

Invited Talks

  1. Modeling Decisions for Artificial Intelligence 2007 (MDAI 2007), Plenary talk, "Algorithms for String Pattern Discovery"

Posters

  1. Kazuyuki Numata, Hideo Bannai, Yoshinoari Tamada, Michiel de Hoon, Seiya Imoto, and Satoru Miyano,
    "Memory-efficient clustering algorithms for microarray gene expression data",
    In Genome Informatics 2005 Poster and Software Demonstrations P049 (2005).
  2. Yoshinori Tamada, Hideo Bannai, Seiya Imoto, Toshiaki Katayama, Minoru Kanehisa, and Satoru Miyano,
    "Modeling Gene Networks Utilizing Evolutionary Information Using Bayesian Network Models",
    In Genome Informatics 2004 Poster and Software Demonstrations, P020 (2004).
  3. Osamu Hirose, Naoki Nariai, Yoshinori Tamada, Hideo Bannai, Seiya Imoto, and Satoru Miyano,
    "Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Network",
    In Genome Informatics 2004 Poster and Software Demonstrations, P022 (2004).
  4. Yoshinori Tamada, Sunyong Kim, Hideo Bannai, Seiya Imoto, Kousuke Tashiro, Satoru Kuhara, and Satoru Miyano,
    "Combining gene expression data with DNA sequence information for estimating gene networks using Bayesian network model",
    In Genome Informatics (GIW 2003), 14:352-353, (2003).
  5. Yoshinori Tamada, Sascha Ott, Hideo Bannai, Sunyong Kim, Kenta Nakai, and Satoru Miyano,
    "Analysis of aberrant splicing data",
    In Genome Informatics (GIW 2002), 13:424-425, (2002).
  6. Keisuke Iida, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano,
    "Extension and Speed up of Knowledge Discovery System BONSAI",
    Pacific Symposium on Biocomputing 2002, p. 100 (poster), (2002).
  7. Hideo Bannai, Keisuke Iida, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano,
    "More Speed and More Pattern Variations for Knowledge Discovery System BONSAI",
    In Genome Informatics (GIW2001), 12:454-455, (2001).
  8. Yoshinori Tamada, Hideo Bannai, Osamu Maruyama, and Satoru Miyano,
    "HypothesisCreator: a framework for knowledge discovery application development",
    In Genome Informatics (GIW2000), 11:360-361, (2000).
  9. Hideo Bannai, Yoshinori Tamada, Osamu Maruyama, Kenta Nakai, and Satoru Miyano,
    "Characterization of subcellular localization signals using HypothesisCreator",
    In Genome Informatics (GIW2000), 11:362-363, (2000).
  10. Hideo Bannai and Satoru Miyano,
    "A definition of discovery in terms of generalized descriptional complexity",
    In Proceedings of the 2nd International Conference on Discovery Science (DS'99), LNAI 1532:316-318, (1999).
  11. Hideo Bannai, Toshio Masuda, Masao Nagasaki, Tomohiro Yasuda, Osamu Maruyama, and Satoru Miyano,
    "Parallelized knowledge discovery system: an enhancement to BONSAI",
    In Genome Informatics (GIW '98), 9:238-239, (1998).