Parameterized string matching and its application to pattern discovery

2010 Fiscal Year Final Research Report

• Project/Area Number: 21700019
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Single-year Grants
• Research Field: Fundamental theory of informatics
• Research Institution: Kyushu University
• Principal Investigator: INENAGA Shunsuke Kyushu University, システム情報科学研究院, 特任准教授 (60448404)
• Project Period (FY): 2009 – 2010
• Keywords: アルゴリズム理論 / 文字列処理 / データ構造 / パタン発見

Research Abstract

Parameterized string matching algorithms can be used to solve several important problems on natural language text searching and biological sequence pattern discovery. We proposed efficient algorithms to solve the parameterized string matching problem, and we revealed new properties of data structures for parameterized string matching. Also, we showed a close relationship between parameterized string matching and palindrome matching, and proposed efficient algorithms for palindrome matching.

Research Products

• [Journal Article] An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs Chicago Journal of Theoretical Computer Science (2010)
  • Author(s): Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
  • Journal Title: Special Issue : CATS 2009
• [Journal Article] Counting and Verifying Maximal Palindromes (2010)
  • Author(s): Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: In Proc.the 17th Symposium on String Processing and Information Retrieval (SPIRE 2010), Lecture Notes in Computer Science 6393 (LNCS 6393) Springer-Verlag Pages: 135-146
• [Journal Article] Verifying a Parameterized Border Array in O(n^<1.5>) Time (2010)
  • Author(s): Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: In Proc.the 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010), Lecture Notes in Computer Science (LNCS 6129) Springer-Verlag Pages: 238-250
• [Journal Article] Counting Parameterized Border Arrays for a Binary Alphabet (2009)
  • Author(s): Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Journal Title: In Proc.3rd International Conference on Language and Automata Theory and Applications (LATA 2009), Lecture Notes in Computer Science (LNCS 5457) Springer-Verlag Pages: 422-433
• [Journal Article] Lightweight Parameterized Suffix Array Construction (2009)
  • Author(s): Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
  • Journal Title: In Proc.20th International Workshop on Combinatorial Algorithms (IWOCA 2009), Lecture Notes in Computer Science (LNCS 5874) Springer-Verlag Pages: 312-323
• [Presentation] 回文照合問題 (2011)
  • Author(s): 井智弘, 稲永俊介, 竹田正幸
  • Organizer: 冬のLAシンポジウム
  • Place of Presentation: 京都大学数理解析研究所
  • Year and Date: 2011-02-02
• [Presentation] Counting Parameterized Border Arrays for a Binary Alphabet (2010)
  • Author(s): Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  • Organizer: コンピュテーション研究会
  • Place of Presentation: 長岡技術科学大学マルチメディアセンター
  • Year and Date: 2010-09-29
• [Presentation] Verifying a Parameterized Border Array in O(n^<1.5>) Time (2010)
  • Author(s): 井智弘, 稲永俊介, 坂内英夫, 竹田正幸
  • Organizer: 第9回情報科学技術フォーラム(FIT 2010)
  • Place of Presentation: 九州大学伊都キャンパス
  • Year and Date: 2010-09-07
• [Presentation] Lightweight Construction of Parameterized Suffix Arrays (2009)
  • Author(s): 井智弘, 出口悟史, 坂内英夫, 稲永俊介, 竹田正幸
  • Organizer: 夏のLAシンポジウム2009
  • Place of Presentation: 宮城県東松島市
  • Year and Date: 2009-07-23