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 ć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 .
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, ISMB 1997 |
Publisher | AAAI press |
Pages | 319-328 |
Number of pages | 10 |
ISBN (Electronic) | 1577350227, 9781577350224 |
State | Published - 1997 |
Externally published | Yes |
Event | 5th International Conference on Intelligent Systems for Molecular Biology, ISMB 1997 - Halkidiki, Greece Duration: Jun 21 1997 → Jun 25 1997 |
Publication series
Name | Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, ISMB 1997 |
---|
Conference
Conference | 5th International Conference on Intelligent Systems for Molecular Biology, ISMB 1997 |
---|---|
Country/Territory | Greece |
City | Halkidiki |
Period | 06/21/97 → 06/25/97 |
Bibliographical note
Publisher Copyright:Copyright © 1997, AAAI (www.aaai.org). All rights reserved.
ASJC Scopus subject areas
- Artificial Intelligence
- Information Systems
- General Biochemistry, Genetics and Molecular Biology