@inproceedings{f49f743dd6a94c0bade64b33756c81ef,
title = "Inference of Molecular Phylogenetic Tree Based on Minimum Model-based Complexity Method",
abstract = "In tliis study, starting with a newly introduced concept of data complexity ({"}empirical data complexity{"}), we specify the concept of complexity more concretely in relation to mathematical modeling {\'c}ind introduce {"}model-based complexity (MBC) {"}. Inductive inference based on the minimum model-based complexity method is then applied to the reconstruction of molecular evolutionary tree from DNA sequences. We find that minimum MBC method has good asymptotic property when DNA sequence lengtlis approach to infinite aiid compensates the bias of maximum likelihood method due to the difference of tree topology complexity. The efKciency of minimum MBC method for reconstruction of molecular tree is studied by computer simulation, and re.sults suggest that this method is superior to the traditional mciximum likelihood method or its modification by Akaike's A l C .",
author = "H. Tanaka and F. Ren and T. Okayama and T. Gojobori",
note = "Publisher Copyright: Copyright {\textcopyright} 1997, AAAI (www.aaai.org). All rights reserved.; 5th International Conference on Intelligent Systems for Molecular Biology, ISMB 1997 ; Conference date: 21-06-1997 Through 25-06-1997",
year = "1997",
language = "English (US)",
series = "Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, ISMB 1997",
publisher = "AAAI press",
pages = "319--328",
booktitle = "Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, ISMB 1997",
}