| Budget Amount *help |
¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2016: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2015: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2014: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2013: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
|
|---|
| 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.
|
