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

非明示的表現に対するアルゴリズムの開発

Research Project

Project/Area Number 16092220
Research Category

Grant-in-Aid for Scientific Research on Priority Areas

Allocation TypeSingle-year Grants
Review Section Science and Engineering
Research InstitutionTohoku University (2005-2007)
Kyushu University (2004)

Principal Investigator

篠原 歩  Tohoku University, 大学院・情報科学研究科, 教授 (00226151)

Co-Investigator(Kenkyū-buntansha) 竹田 正幸  九州大学, 大学院・システム情報科学研究院, 教授 (50216909)
下薗 真一  九州工業大学, 情報工学部, 准教授 (70243988)
坂本 比呂志  九州工業大学, 情報工学部, 准教授 (50315123)
石野 明  東北大学, 大学院・情報科学研究科, 助教 (10315129)
Project Period (FY) 2004 – 2007
Project Status Completed (Fiscal Year 2007)
Budget Amount *help
¥14,400,000 (Direct Cost: ¥14,400,000)
Fiscal Year 2007: ¥3,600,000 (Direct Cost: ¥3,600,000)
Fiscal Year 2006: ¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2005: ¥3,500,000 (Direct Cost: ¥3,500,000)
Fiscal Year 2004: ¥3,800,000 (Direct Cost: ¥3,800,000)
Keywords最大共通部分文字列 / 回文構造 / 文字列圧縮 / フィボナッチ文字列 / アルゴリズム / 文字列照合 / XML / 索引構造 / 文字列処理 / データ圧縮 / 非明示的表現 / 文字列照合アルゴリズム / データ構造 / パターン照合 / パターン発見 / 最長共通部分列 / ビット並列化 / 文法圧縮
Research Abstract

本研究は,非明示的に表現されたオブジェクトに対するアルゴリズムの開発とその計算量の解析を行うことを目的し,また同時に,効率のよいアルゴリズムの開発に適した非明示的な表現法を文字列やグラフなどの離散構造を対象として研究を展開してきた.
具体的には,直線的プログラムとして圧縮表現された文字列を対象として,繰り返し構造や共通部分を検出する問題に取り組んだ.直線的プログラムは,文字列の連結を基本命令とした代入式の列であり,種々の文法圧縮,辞書式圧縮を抽象化したものである.もしもこの直線的プログラムからもとの文字列を陽に展開してしまうと,その長さは指数的に長くなりうるため,決して多項式時間で処理を行うことができない.我々は文字列に内在する組み合わせ構造や周期に着目することにより,圧縮文字列に含まれる回文構造の検出や,最大共通部分文字列の計算を多項式時間で行うアルゴリズムを開発した.
また,漸化式として表される文字列の性質を調べた.隣接2項の漸化式で表されるフィボナッチ文字列を一般化し,隣接n項の漸化式でn-ボナッチ文字列を定義した.本研究では,任意のn≧2に対して,無限n-ボナッチ文字列における第k項目の有限n-ボナッチ文字列の最大連続出現数はk→∞のとき2+1/(φ(n)-1)に収束することを証明した.ここに,φ(n)はn-ボナッチ定数であり,特にφ(2)=(1+√<5>)/2は黄金比として知られている.さらに,nを増加させると,最大連続数はちょうど3に近づくことを示した.

Report

(4 results)
  • 2007 Annual Research Report
  • 2006 Annual Research Report
  • 2005 Annual Research Report
  • 2004 Annual Research Report
  • Research Products

    (24 results)

All 2008 2007 2006 2005 2004

All Journal Article (23 results) (of which Peer Reviewed: 2 results) Presentation (1 results)

  • [Journal Article] Computing longest common substring and all palindromes from compressed strings2008

    • Author(s)
      W.Matsubara, 他5名
    • Journal Title

      Proc.34th Int. Conference on Current Trends in Theory and Practice of Computer Science LNCS4910

      Pages: 364-375

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Reducing Trials by Thinning-Out in Skill Discovery2007

    • Author(s)
      H.Kobayashi, 他3名
    • Journal Title

      Proc.10th Int. Conference on Discovery Science LNCS4755

      Pages: 127-138

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Simple Linear-Time Off-Line Text Compression by Longest-First Substitution2007

    • Author(s)
      R.Nakamura et al.
    • Journal Title

      Data Compression Conference '07

      Pages: 123-132

    • Related Report
      2006 Annual Research Report
  • [Journal Article] XML文書フィルタリングのための軽量な高速化技法2007

    • Author(s)
      御手洗秀一, 石野 明, 竹田 正幸
    • Journal Title

      電子情報通信学会データ工学ワークショップ論文集 電子出版

    • Related Report
      2006 Annual Research Report
  • [Journal Article] On-line Linear-time Construction of Word Suffix Trees2006

    • Author(s)
      S.Inenaga, M.Takeda
    • Journal Title

      Proc. 17th Annual Symposium on Combinatorial Pattern Matching (CPM'06) LNCS4009

      Pages: 60-71

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Sparse Compact Directed Acyclic Word Graphs2006

    • Author(s)
      S.Inenaga, M.Takeda
    • Journal Title

      Proc. Prague Stringology Conference 2006

      Pages: 195-211

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Sparse Directed Acyclic Word Graphs2006

    • Author(s)
      S.Inenaga, M.Takeda
    • Journal Title

      Proc. 13th International Symposium on String Processing and Information Retrieval LNCS 4209

      Pages: 61-73

    • Related Report
      2006 Annual Research Report
  • [Journal Article] Improving Time and Space Complexity for Compressed Pattern Matching2006

    • Author(s)
      S.Maruyama, H.Miyagawa, H.Sakamoto
    • Journal Title

      Proc. of The 17th International Symposium on Algorithms and Computation (ISAAC 2006) LNCS 4288

      Pages: 484-493

    • Related Report
      2006 Annual Research Report
  • [Journal Article] A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems2005

    • Author(s)
      S.Inenaga, A.Shinohara, M.Takeda
    • Journal Title

      International Journal of Foundations of Computer Science Vol.16, No.6

      Pages: 1155-1166

    • Related Report
      2005 Annual Research Report
  • [Journal Article] The Size of Subsequence Automaton2005

    • Author(s)
      Z.Tronicek, A.Shinohara
    • Journal Title

      Theoretical Computer Science Vol.341, Issue 1-3

      Pages: 379-384

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Fully Incremental LCS Computation2005

    • Author(s)
      Y.Ishida et al.
    • Journal Title

      Proc.The 15th International Symposium of Fundamentals of Computation Theory (FCT2005) LNCS3623

      Pages: 563-574

    • Related Report
      2005 Annual Research Report
  • [Journal Article] New Bit-Parallel Indel-Distance Algorithm2005

    • Author(s)
      H.Hyyro, Y.Pinzon, A.Shinohara
    • Journal Title

      Proc.4th International Workshop on Efficient and Experimental Algorithms (WEA2005) LNCS3503

      Pages: 380-390

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Practical Algorithms for Pattern Based Linear Regression2005

    • Author(s)
      H.Bannai K.Hatano, S.Inenaga, M.Takeda
    • Journal Title

      Proc.8th International Conference on Discovery Science (DS 2005) LNAI3735

      Pages: 44-56

    • Related Report
      2005 Annual Research Report
  • [Journal Article] A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's2005

    • Author(s)
      H.Tsuji, A.Ishino, M.Takeda
    • Journal Title

      Proc.12th Inter.Conf.on String Processing and Information Retrieval (SPIRE 2005) LNCS3772

      Pages: 388-398

    • Related Report
      2005 Annual Research Report
  • [Journal Article] Fast Bit-Vector Algorithms for Approximate String Matching under Indel-Distance2005

    • Author(s)
      Heikki Hyyro et al.
    • Journal Title

      Proc.The 31st Annual Conference on Current Trends in Theory and Practice of Informatics(SOFSEM 2005) LNCS 3381

      Pages: 380-384

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.2004

    • Author(s)
      Shunsuke Inenaga et al.
    • Journal Title

      The 7th International Conference on Discovery Science(DS 2004) LNAI 3245

      Pages: 32-46

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Finding Optimal Pairs of Patterns2004

    • Author(s)
      Hideo Bannai et al.
    • Journal Title

      Proc.The 4th Workshop on Algorithms in Bioinformatics(WABI 2004) LNB 3240

      Pages: 450-452

    • Related Report
      2004 Annual Research Report
  • [Journal Article] An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars2004

    • Author(s)
      Shunsuke Inenaga et al.
    • Journal Title

      Proc.The 8th International Conference on Developments in Language Theory(DLT2004) LNCS 3340

      Pages: 225-236

    • Related Report
      2004 Annual Research Report
  • [Journal Article] On Bit-Parallel Processing of Multibyte Text2004

    • Author(s)
      Heikki Hyyro et al.
    • Journal Title

      The First Asia Information Retrieval symposium(AIRS 2004) LNCS 3411

      Pages: 289-300

    • Related Report
      2004 Annual Research Report
  • [Journal Article] String Pattern Discovery.2004

    • Author(s)
      Ayumi Shinohara
    • Journal Title

      Proc.The 15th International Conference Algorithmic Learning Theory(ALt2004) LNAI 3244

      Pages: 1-13

    • Related Report
      2004 Annual Research Report
  • [Journal Article] A Fully Compressed Pattern Matching Algorithm For Simple Collage Systems2004

    • Author(s)
      Shunsuke Inenaga et al.
    • Journal Title

      Proc.The Prague Stringology Conference'04(PSC' 04) (印刷中)

    • Related Report
      2004 Annual Research Report
  • [Journal Article] Approximate Point Set Pattern Matching on Sequences and Planes2004

    • Author(s)
      Tomoaki Suga et al.
    • Journal Title

      Proceeding of the 15th Annual Symposium on Combinatorial Pattern Matching(CPM 2004) LNCS 3109

      Pages: 89-101

    • Related Report
      2004 Annual Research Report
  • [Journal Article] A Space-Saving Linear-Time Algorithm for Grammar-Based Compression2004

    • Author(s)
      Hiroshi Sakamoto et al.
    • Journal Title

      Proc.of String Processing and Information Retrieval : 11th International Conference(SPIRE 2004) LNCS 3246

      Pages: 218-229

    • NAID

      110003178856

    • Related Report
      2004 Annual Research Report
  • [Presentation] 圧縮文字列における最長共通部分文字列および回文を求める多項式時間アルゴリズム2008

    • Author(s)
      松原渉, 他5名
    • Organizer
      情報処理学会 第70回全国大会
    • Place of Presentation
      IBM東京基礎研究所
    • Year and Date
      2008-03-10
    • Related Report
      2007 Annual Research Report

URL: 

Published: 2004-04-01   Modified: 2018-03-28  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi