On the Number of Binary Characters Needed to Recover a Phylogeny Using Maximum Parsimony

被引：6

作者：

Chai, Juanjuan ^{[1
]}

Housworth, Elizabeth Ann ^{[1
]}

机构：

[1] Indiana Univ, Bloomington, IN 47405 USA

来源：

BULLETIN OF MATHEMATICAL BIOLOGY | 2011年 / 73卷 / 06期

关键词：

Phylogeny; Maximum parsimony; Binary characters; Homoplasy; One-clustering;

D O I：

10.1007/s11538-010-9579-3

中图分类号：

Q [生物科学];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

We give an explicit construction to solve a conjecture of Mike Steel and David Penny that any phylogeny involving N taxa can be recovered unambiguously using on the order of log N binary characters and the method of maximum parsimony. Biologically, this means that homoplasy need not be a deterrent to parsimony methods. Some patterns of homoplasy are phylogenetically informative and can exponentially reduce the amount of data needed to resolve a phylogeny.

引用

页码：1398 / 1411

页数：14

共 6 条

[1]

Bandelt Hans-J., 2001, GRAPH THEORETIC CONC, V2204, P1

[2] PROVING PHYLOGENETIC TREES MINIMAL WITH L-CLUSTERING AND SET PARTITIONING [J].