RECOVERING A TREE FROM THE LEAF COLOURATIONS IT GENERATES UNDER A MARKOV MODEL

被引：183

作者：

STEEL, M

机构：

[1] Mathematics Department, University of Canterbury Christchurch

来源：

APPLIED MATHEMATICS LETTERS | 1994年 / 7卷 / 02期

关键词：

TREES; SEQUENCE EVOLUTION; PHYLOGENETIC INVARIANTS;

D O I：

10.1016/0893-9659(94)90024-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We describe a simple transformation that allows for the fast recovery of a tree from the probabilities such a tree induces on the colourations of its leaves under a simple Markov process (with unknown parameters). This generalizes earlier results by not requiring the transition matrices associated with the edges of the tree to be of a particular form, or to be related by some fixed mte matrix, and by not insisting on a particular distribution of colours at the root of the tree. Applications to taxonomy are outlined briefly in three corollaries.

引用

页码：19 / 23

页数：5

共 9 条

[1]

Bandelt, Dress, Reconstructing the shape of a tree from observed dissimilarity data, Adv. Appl. Math., 7, pp. 309-343, (1986)

[2]

Cavender, Taxonomy with confidence, Math. Biosci., 40, pp. 271-280, (1978)

[3]

Farris, A probability model for inferring evolutionary trees, Systematic Zoology, 22, pp. 250-256, (1973)

[4]

Pearl, Tarsi, Structuring causal trees, J. Complexity, 2, pp. 60-77, (1986)

[5]

Hendy, The relationship between simple evolutionary tree models and observable sequence data, Systematic Zoology, 38, pp. 310-321, (1989)

[6]

Rodriguez, Oliver, Marin, Medina, The general stochastic model of nucleotide substitution, J. Theor. Biol., 142, pp. 485-501, (1990)

[7]

Renyi, Probability Theory, (1970)

[8]

Bandelt, Dress, A canonical decomposition theory for metrics on a finite set, Adv. Math., 92, 1, pp. 47-105, (1992)

[9]

Cavender, Felsenstein, Invariants of phylogenies: Simple cases with discrete states, J. Classification, 4, pp. 57-71, (1987)

← 1 →