• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

1998 Fiscal Year Final Research Report Summary

Inference of molecular phylogenetic tree based on minimum complexity principle

Research Project

Project/Area Number 09680354
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Intelligent informatics
Research InstitutionMedical Research Institute, Tokyo Medical and Dental University

Principal Investigator

TANAKA Hiroshi  Medical Research Institute/Tokyo Medical and Dental University Professor, 難治疾患研究所, 教授 (60155158)

Co-Investigator(Kenkyū-buntansha) REN Fengrong  Medical Research Institute/Tokyo Medical and Dental University Research Assistan, 難治疾患研究所, 教務職員 (60280989)
Project Period (FY) 1997 – 1998
KeywordsMolecular phylogenetic tree / Minimum complexity principle / Model-based complexity / Maximum likelihood method / DNA sequence
Research Abstract

In reconstruction of phylogenetic trees from molecular data, it has been pointed oat that multifurcate phylogenetic trees are difficult to be correctly reconstructed by the conventional methods like maximum likelihood method. In order to resolve this problem, we have been engaged in developing a new phylogenetic tree reconstruction method based on the minimum complexity principle widely used in the inductive inference. In this study, we defined a new concept of complexity, which we call "empirical model-based complexity" and proposed "minimum model-based complexity(MBC)" criterion for reconstructing molecular phylogenetic tree. This method describes the complexity of molecular phylogenetic tree by three terms which are related to the tree topology, the branch length and fitness between the model and data measured by likelihood function.
The Computer simulation is used to investigate the efficiency of this method in estimating rooted and unrooted phylogenetic tree in comparison with those of maximum likelihood method and Akaike information method(AIC). The results suggest that the MBC method has a good asymptotic property compared with traditional maximum likelihood method or its modification, AIC method in the case that the multifurcate tree is considered as a candidate topology of the tree and/or long DNA sequences could be used in reconstructing phylogenetic tree (over 3000-bp), because it avoids excess-complexity of the tree model in relation to the amount of the information available from DNA sequences of current species. Therefore it could be generally used for reconstruction of phylogenetic tree having arbitrary multifurcations.

  • Research Products

    (6 results)

All Other

All Publications (6 results)

  • [Publications] H.Tanaka,F.Ren,T.Okayama,T.Gojobori: "Inference of Molecular Phylogenetic Tree Based on Minimum Model-Based Complexity Method" Intelligent Systems for Molecular Biology. 5. 319-328 (1997)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] H.Tanaka,F.Ren,T.Okayama,T.Gojobori: "Topology Selection in Unrooted Molecular Phylogenetic Tree by Minimum Model-based Complexity" Pacific Symposium on Biocomputing. 4. 326-337 (1999)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] F.Ren,H.Tanaka,T.Okayama,T.Gojobori: "Molecular Phylogenetic Trees Are Inferred by Using Minimum Model-based Complexity" Biocomputing and Emergent Computation. 1. 122-131 (1997)

    • Description
      「研究成果報告書概要(和文)」より
  • [Publications] Hiroshi Tanaka, Fengrong Ren, Toshitsugu Okayama and Takashi Gojobori: "Inference of Molecular Phylogenetic Tree Based on Minimum Model-Based Complexity Method" Intelligent Systems for Molecular Biology. 5.AAAI Press. 319-328 (1997)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Hiroshi Tanaka, Fengrong Ren, Toshitsugu Okayama and Takashi Gojobori: "Topology Selection in Unrooted Molecular Phylogenetic Tree by Minimum Model-based Complexity" Pacific Symposium on Biocomputing. 4, World Scientific. 326-337 (1999)

    • Description
      「研究成果報告書概要(欧文)」より
  • [Publications] Fengrong Ren, Hiroshi Tanaka, Toshitsugu Okayama and Takashi Gojobori: "Molecular Phylogenetic Trees Are Inferred by Using Minimum Model-based Complexity" Biocomputing and Emergent Computation. 1, Springer-Verlag. 122-131 (1997)

    • Description
      「研究成果報告書概要(欧文)」より

URL: 

Published: 1999-12-08  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi