| Project/Area Number |
23510152
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Tokyo University of Science (2013)
Muroran Institute of Technology (2011-2012) |
|---|
Principal Investigator |
SHI Jianming 東京理科大学, 経営学部, 教授 (70287465)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2013: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
|
|---|
| Keywords | 分数計和計画問題 / 数理最適化 / アルゴリズム / 遺伝子機能予測 / 主要組織適合抗原(MHC)クラスII / 分数和計画問題 / オペレーションズリサーチ / 数理計画 / MHC クラス II / ペプチド結合予測 |
|---|
| Research Abstract |
Prediction of the binding ability of antigen peptides to major histocompatibility complex (MHC) class II molecules plays an important role in vaccine development. A key to such prediction is to maximize the entropy of information obtained from the the binding ability. This problem can be formulated as a maximization of the Sum of Ratios Problem. In this study, two kinds of algorithms which use linear relaxation were proposed to such a Sum of Linear Ratios Problem, that is an approximation of general Sum of Ratios Problem. The following results have been obtained in the numerical experiments.
1) The new algorithm takes a 12% CPU time of the existing methods on average. 2) The proposed algorithm finds an optimal solution of the Sum of Linear Ratios Problem with 60 ratios in about less than 14 minutes (CPU time).
These numerical results indicate that the proposed algorithms are much superior to theses existing algorithms.
|
