The construction of rapid algorithms for constructing molecular phylogenetic trees based on the principles of metaheuristic algorithms
| Project/Area Number |
15500195
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Bioinformatics/Life informatics
|
|---|
| Research Institution | The University of Tokyo |
|---|
Principal Investigator |
NAKAMURA Masataka The University of Tokyo, College of Arts and Sciences, Associate Professor, 大学院・総合文化研究科, 助教授 (90155854)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
ITO Motomi The University of Tokyo, Associate Professor, 大学院・総合文化研究科, 助教授 (00193524)
KAWAI Kei The University of Tokyo, Professor, 大学院・総合文化研究科, 教授 (50011664)
SAKUMA Tadasshi The Yamagata University, Associate Professor, 教育学部, 助教授 (60323458)
|
|---|
| Project Period (FY) |
2003 – 2005
|
| Project Status |
Completed (Fiscal Year 2005)
|
| Budget Amount *help |
¥3,300,000 (Direct Cost: ¥3,300,000)
Fiscal Year 2005: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2004: ¥900,000 (Direct Cost: ¥900,000)
Fiscal Year 2003: ¥1,600,000 (Direct Cost: ¥1,600,000)
|
|---|
| Keywords | molecular phyloaenetic tree / Tabu search / methaheuristic algorithms / optimization algorithms / 生物分子系統樹 / バイオインフォマティクス / 組み合わせ最適化 / アルゴリズム |
|---|
| Research Abstract |
There are two main types of algorithms for constructing molecular phylogenetic trees. The first is those based on the distance matrix, while the other tries to search for an optimal binary tree under minimizing or maximizing given objective functions. The Maximum Parsimony, the Maximum-Liklihood, and the Minimum mean square are the typical examples of the latter Algorithms.
Although it is an intractable problem to find an optimal solution in the huge feasible solution space in the second cases, they have not ever realized the importance of the strategy for how to overcome the hugeness of the solution spaces, and have never investigated the methods of local searches. As a result, they neglect the possibility of finding better solutions other than those in the neighborhood of the greedily chosen initial solution.
We assert here that the so-called methaheuristic algorithms do work well in the above procedures of local searches. And actually, we have shown from the simulations that Tabu search, one of the well-known methaheuristic algorithms, greatly contribute the expand the traverse of the local search trails.
|
Report
(4 results)
Research Products
(7 results)
