| 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)
|
|---|
| 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.
|
