摘要

Inferring phylogenetic trees is a general approach in the reconstruction of the evolutionary histories of organisms. In order to estimate the events over a phylogenetic tree, several criteria and algorithms are used. In the present work, a common approach, together with an effective algorithm is proposed. The approach aims to unify the applying of the Maximum parsimony and Maximum likelihood criteria over a phylogenetic tree with various edge lengths. The events over an edge of the phylogenetic tree are described by a Markov stochastic process. Explicit formulae for the simplest case are given. Maximum likelihood is reformulated from the point of view of Information Theory as Minimum surprisal. Additionally, a new scoring criterion, Minimum entropy, is proposed.

  • 出版日期2012-10