Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results

被引：26

作者：

Steel, M ^{[1
]}

Hendy, MD

Penny, D

机构：

[1] Univ Canterbury, Biomath Res Ctr, Christchurch 1, New Zealand

[2] Massey Univ, Dept Math, Palmerston North, New Zealand

[3] Massey Univ, Mol Genet Unit, Palmerston North, New Zealand

来源：

DISCRETE APPLIED MATHEMATICS | 1998年 / 88卷 / 1-3期

关键词：

trees; DNA sequences; Markov processes; maximum parsimony; Hadamard matrices; site substitution models;

D O I：

10.1016/S0166-218X(98)00080-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The variations between homologous nucleotide sequences representative of various species are, in part, a consequence of the evolutionary history of these species. Determining the evolutionary tree from patterns in the sequences depends on inverting the stochastic processes governing the substitutions from their ancestral sequence. We present a number of recent (and some new) results which allow for a tree to be reconstructed from the expected frequencies of patterns in its leaf colorations generated under various Markov models. We summarize recent work using Hadamard conjugation, which provides an analytic relation between the parameters of Kimura's 3ST model on a phylogenetic tree and the sequence patterns produced. We give two applications of the theory by describing new properties of the popular "maximum parsimony" method for tree reconstruction. (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：367 / 396

页数：30

共 52 条

[21] General additive distance with time-reversibility and rate variation among nucleotide sites [J].

Gu, X ;

Li, WH .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (10) :4671-4676

[22] Bias-corrected paralinear and LogDet distances and tests of molecular clocks and phylogenies under nonstationary nucleotide frequencies [J].

Gu, X ;

Li, WH .

MOLECULAR BIOLOGY AND EVOLUTION, 1996, 13 (10) :1375-1383

[23] EFFICIENT ALGORITHMS FOR INFERRING EVOLUTIONARY TREES [J].

GUSFIELD, D .

NETWORKS, 1991, 21 (01) :19-28

[24] Complete families of linear invariants for some stochastic models of sequence evolution, with and without the molecular clock assumption [J].

Hendy, MD ;

Penny, D .

JOURNAL OF COMPUTATIONAL BIOLOGY, 1996, 3 (01) :19-31

[25] A DISCRETE FOURIER-ANALYSIS FOR EVOLUTIONARY TREES [J].

HENDY, MD ;

PENNY, D ;

STEEL, MA .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1994, 91 (08) :3339-3343

[26] A COMBINATORIAL DESCRIPTION OF THE CLOSEST TREE ALGORITHM FOR FINDING EVOLUTIONARY TREES [J].

HENDY, MD .

DISCRETE MATHEMATICS, 1991, 96 (01) :51-58

[27] THE RELATIONSHIP BETWEEN SIMPLE EVOLUTIONARY TREE MODELS AND OBSERVABLE SEQUENCE DATA [J].

HENDY, MD .

SYSTEMATIC ZOOLOGY, 1989, 38 (04) :310-321

[28] A FRAMEWORK FOR THE QUANTITATIVE STUDY OF EVOLUTIONARY TREES [J].

HENDY, MD ;

PENNY, D .

SYSTEMATIC ZOOLOGY, 1989, 38 (04) :297-309

[29]

Iosifescu M., 1980, Finite markov processes and their applications

[30]

JIN L, 1990, MOL BIOL EVOL, V7, P82

← 1 2 3 4 5 6 →