.png){kind=icon}
返回
Phylogenetic minimum description length: an optimality criterion based on algorithmic complexity
.png){kind=icon}
PRE
AI
DOI：10.1111/cla.12603.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Phylogenetic minimum description length (PMDL) is proposed as an optimality criterion for phylogenetic analysis. PMDL is based on algorithmic (Kolmogorov) information and the minimum description length principle. This criterion generates natural weighting functions (i.e. not being externally specified) for a diversity of phylogenetic graph, data and model types. PMDL is a generalized criterion that converges on existing forms of inference (i.e. parsimony, likelihood, Bayesian) in specific circumstances. Furthermore, as opposed to existing criteria, PMDL includes graph complexity allowing for the competition of hypotheses with myriad types of phylogenetic graphs (e.g. trees, networks, forests). Owing to its compound nature, PMDL allows for analytical model choice along with phylogenetic graph hypothesis while avoiding over-parameterization. Although uncomputable, heuristic methods are presented for the calculation of upper bounds on the algorithmic information content of a phylogenetic hypothesis. Examples are presented demonstrating the approach.
Keyword:
MAXIMUM-LIKELIHOOD
EVOLUTIONARY TREES
SEQUENCE ALIGNMENT
DNA-SEQUENCES
SENSITIVITY
PARSIMONY
MODEL
NUMBER
SUBSTITUTIONS
INFERENCE
期刊
IF:
6.2
论文数:
994
被引数:
3.9K
机构
引用论文
.png){kind=icon}
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度
OAAI
OAAI分享收藏Race, Ethnicity, Income Concentration and 10-Year Change in Urban Greenness in the United States
OAAI
OAAI分享收藏分享收藏
查看更多内容