2016 Fiscal Year Final Research Report
Scientific and Practical Approaches to Computationally Hard Problems
| Project/Area Number |
24500023
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Tokyo Denki University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2012-04-01 – 2017-03-31
|
| Keywords | 近似アルゴリズム / 固定パラメータアルゴリズム / バイオインフォマティクス / 組み合わせ最適化 / ハプロタイプアセンブリー / 網状ネットワーク / 生物系統樹のrSPR距離 / 中心列問題 |
|---|
| Outline of Final Research Achievements |
We mainly studied several important and fundamental combinatorial optimization problems in bioinformatics such as the rSPR distance problem of two phylogenetic trees, the reticulate network problem of multiple phylogenetic trees, and the closest string problem. All the studied problems are computationally hard and various algorithms had been designed for them before. In this project, we designed new algorithms for the problems and not only rigorously analyzed the theoretical performance of our new algorithms but also implemented them and compared their practical performance against the previous bests. Our results show that the new algorithms are the bests not only in theory but also in practice.
|
| Free Research Field |
Algorithm Science and Engineering
|
