Comparing and Combining Trees
| Project/Area Number |
23700011
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyoto University (2012-2013)
Ochanomizu University (2011) |
|---|
Principal Investigator |
JANSSON Jesper 京都大学, 白眉センター, 特定准教授 (60536100)
|
|---|
| Project Period (FY) |
2011 – 2013
|
| Project Status |
Completed (Fiscal Year 2013)
|
| Budget Amount *help |
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
Fiscal Year 2013: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2011: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | アルゴリズム / 計算複雑さ / 系統樹 / algorithm / computational complexity / phylogenetic tree / consensus tree / rooted triplet distance / 計算複雑性 / 順序木 / 超系統樹 / 合意樹 / 類似度 |
|---|
| Research Abstract |
The purpose of this research project was to develop efficient algorithms for comparing and combining trees involving huge datasets. It focused on three particular topics: (i) Building a minimally resolved supertree; (ii) Constructing a consensus tree; and (iii) Measuring the similarity of two treelike structures.
Some new theoretical algorithms were designed and analyzed, and a number of related computational complexity results were obtained.
|
Report
(4 results)
Research Products
(28 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Algorithms for Building Consensus MUL-trees2011
Author(s)
Y. Cui, J. Jansson, and W.-K. Sung
Organizer
Proceedings of the Twenty-Second International Symposium on Algorithms and Computation (ISAAC 2011), Lecture Notes in Computer Science
Place of Presentation
Yokohama, Japan(Vol. 7074, pp. 744-753, Springer-Verlag, 2011)
Year and Date
2011-12-05
Related Report
-
-
-
-
-
-
-
-
