• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Algorithms for Model Selection in String Pattern Discovery and String Data Classification

Research Project

Project/Area Number 20700141
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Intelligent informatics
Research InstitutionKyushu University

Principal Investigator

BANNAI Hideo  Kyushu University, 大学院・システム情報科学研究院, 准教授 (20323644)

Project Period (FY) 2008 – 2009
Project Status Completed (Fiscal Year 2009)
Budget Amount *help
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2009: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2008: ¥2,080,000 (Direct Cost: ¥1,600,000、Indirect Cost: ¥480,000)
Keywords文字列アルゴリズム / 文字列パターン発見 / パターン発見 / パラメータ化文字列 / 繰り返し構造 / アルゴリズム / データ構造 / 文字列
Research Abstract

This study is concerned with developing efficient methods for selecting a good pattern class for pattern discovery from string data, as well as classification of string data based on patterns. We developed efficient algorithms and data structures for string pattern discovery and string data classification for several different classes of patterns, namely the VLDC pattern class, and the parameterized substring pattern class.

Report

(3 results)
  • 2009 Annual Research Report   Final Research Report ( PDF )
  • 2008 Annual Research Report
  • Research Products

    (22 results)

All 2009 2008

All Journal Article (13 results) (of which Peer Reviewed: 13 results) Presentation (9 results)

  • [Journal Article] Bit-parallel algorithms for computing all the runs in a string2009

    • Author(s)
      Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    • Journal Title

      In Proceedings of The Prague Stringology Conference 2009

      Pages: 203-213

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Lightweight Parameterized Suffix Array Construction2009

    • Author(s)
      Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    • Journal Title

      In Proceedings of the 20th International Workshop on Combinatorial Algorithms LNCS5874

      Pages: 312-323

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] A Series of Run-rich Strings2009

    • Author(s)
      Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
    • Journal Title

      In Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA 2009) 5457

      Pages: 578-587

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Counting Parameterized Border Arrays for a Binary Alphabet2009

    • Author(s)
      Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Journal Title

      In Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA 2009) 5457

      Pages: 422-433

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Bit-parallel algorithms for computing all the runs in a string2009

    • Author(s)
      K.Hirashima, H.Bannai, 他3名
    • Journal Title

      Proc.Prague Stringology Conference 2009

      Pages: 203-213

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Finding Characteristic Substrings from Compressed Texts2009

    • Author(s)
      S.Inenaga, H.Bannai
    • Journal Title

      Proc.Prague Stringology Conference 2009

      Pages: 40-54

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Lightweight Parameterized Suffix Array Construction2009

    • Author(s)
      T.I, S.Deguchi, H.Bannai, S.Inenaga, M. Takeda
    • Journal Title

      Proc.20^<th> International Workshop on Combinatorial Algorithms LNCS 5874

      Pages: 312-323

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Counting Parameterized Border Arrays for a Biriary Alphabet2009

    • Author(s)
      T.I, S.Inenaga, H.Bannai, M.Takeda
    • Journal Title

      Proc.3^<rd> International Conf.on Language and Automata Theory and Applications LNCS 5457

      Pages: 422-433

    • Related Report
      2009 Annual Research Report
    • Peer Reviewed
  • [Journal Article] String Kernels Based on Variable-Length-Don't-Care Patterns2008

    • Author(s)
      Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
    • Journal Title

      In Proceedings of the 11th International Conference on Discovery Science (DS2008) 5255

      Pages: 308-318

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] Parameterized Suffix Arrays for Binary Strings2008

    • Author(s)
      Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    • Journal Title

      In Proceedings of The Prague Stringology Conference 2008 (PSC2008)

      Pages: 84-94

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] New Lower Bounds for the Maximum Number of Runs in a String2008

    • Author(s)
      Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara
    • Journal Title

      In Proceedings of The Prague Stringology Conference 2008 (PSC2008)

      Pages: 140-145

    • Related Report
      2009 Final Research Report
    • Peer Reviewed
  • [Journal Article] String Kernels Based on Variable-Length-Don' t Care Patterns2008

    • Author(s)
      Narisawa, et.al.
    • Journal Title

      Proc. 11^<th> International Conference on Discovery Science (DS 2008), Lecture Notes in Artificial Int teligence 5255

      Pages: 308-318

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Parameterized Suffix Arrays for Binary Strings2008

    • Author(s)
      Deguchi, et.al.
    • Journal Title

      Proc. Prague Stringology Conference 2008 (PSC2008)

      Pages: 84-94

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Presentation] Bit-parallel algorithms for computing all the runs in a string2009

    • Author(s)
      Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    • Organizer
      Prague Stringology Conference 2009
    • Place of Presentation
      プラハ, チェコ共和国
    • Year and Date
      2009-09-02
    • Related Report
      2009 Final Research Report
  • [Presentation] Lightweight Construction of Parameterized Suffix Arrays2009

    • Author(s)
      井智弘, 出口悟史, 坂内英夫, 稲永俊介, 竹田正幸
    • Organizer
      夏のLAシンポジウム2009
    • Place of Presentation
      宮城県東松島市
    • Year and Date
      2009-07-23
    • Related Report
      2009 Final Research Report
  • [Presentation] Lightweight Parameterized Suffix Array Construction2009

    • Author(s)
      Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    • Organizer
      20th International Workshop on Combinatorial Algorithms
    • Place of Presentation
      Hradec nad Moravici, チェコ共和国
    • Year and Date
      2009-06-29
    • Related Report
      2009 Final Research Report
  • [Presentation] A Series of Run-rich Strings2009

    • Author(s)
      Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
    • Organizer
      3rd International Conference on Language and Automata Theory and Applications
    • Place of Presentation
      タラゴナ, スペイン
    • Year and Date
      2009-04-07
    • Related Report
      2009 Final Research Report
  • [Presentation] Counting Parameterized Border Arrays for a Binary Alphabet2009

    • Author(s)
      Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    • Organizer
      3rd International Conference on Language and Automata Theory and Applications
    • Place of Presentation
      タラゴナ, スペイン
    • Year and Date
      2009-04-02
    • Related Report
      2009 Final Research Report
  • [Presentation] String Kernels Based on Variable-Length-Don't-Care Patterns2008

    • Author(s)
      Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
    • Organizer
      International Conference on Discovery Science (DS2008)
    • Place of Presentation
      ブダペスト, ハンガリー
    • Year and Date
      2008-10-14
    • Related Report
      2009 Final Research Report
  • [Presentation] String Kernels Based on Variable-Length-Don' t Care Patterns2008

    • Author(s)
      Kazuyuki Narisawa
    • Organizer
      11^<th> International Conference on Discovery Science (DS 2008)
    • Place of Presentation
      ブダペスト, ハンガリー
    • Year and Date
      2008-10-14
    • Related Report
      2008 Annual Research Report
  • [Presentation] New Lower Bounds for the Maximum Number of Runs in a String2008

    • Author(s)
      Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara
    • Organizer
      Prague Stringology Conference 2008
    • Place of Presentation
      プラハ, チェコ共和国
    • Year and Date
      2008-09-03
    • Related Report
      2009 Final Research Report
  • [Presentation] Parameterized Suffix Arrays for Binary Strings2008

    • Author(s)
      Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    • Organizer
      Prague Stringology Conference 2008
    • Place of Presentation
      プラハ, チェコ共和国
    • Year and Date
      2008-09-01
    • Related Report
      2009 Final Research Report

URL: 

Published: 2008-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi