| 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
|
| Project Status |
Completed (Fiscal Year 2010)
|
| Budget Amount *help |
¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2010: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2009: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
|
|---|
| 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.
|
