A study on preprocessing for time-efficiently aligning sequences
| Project/Area Number |
22500001
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
SAKAI Yoshifumi 東北大学, 大学院・農学研究科, 准教授 (10277361)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2010: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| Keywords | アルゴリズム理論 / 文字列比較 / アルゴリズム |
|---|
| Research Abstract |
Problems of finding a ‘good' alignment of two strings have many applications in computing the similarity between strings. This study proposed algorithms for some of such problems. By exploiting information obtained from preprocessing, these algorithms can perform faster than the previous algorithms. The problems for which the algorithms were proposed include the problem in which only one of two strings is allowed to be preprocessed because of an one-line environment, and the problem in which strings to be aligned are compressed in a certain manner.
|
Report
(4 results)
Research Products
(21 results)
