FRACTION OF TREES WITH GIVEN ROOT TRAITS - THE LIMIT OF LARGE TREES

被引:2
|
作者
BUTLER, JP
机构
[1] HARVARD UNIV,SCH PUBL HLTH,DEPT ENVIRONM SCI & PHYSIOL,BOSTON,MA 02115
[2] BIOMECH INST,BOSTON,MA 02215
基金
美国国家卫生研究院;
关键词
D O I
10.1016/S0022-5193(05)80056-6
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
An evolutionary tree is considered as a rooted binary tree, with leaves representing taxa assigned particular traits. Interior nodes of the tree are assigned traits in a parsimonious fashion, including the concept of an ambiguous state. The ambiguous state arises if two offspring nodes have different definite traits, and may be resolved by joining with other definite traits. For a single characteristic with two possible trait values, the fraction of trees that root in a particular trait is known for small values of n, the total number of taxa under consideration. This paper presents formulae for the fraction of trees with a given root trait asymptotically as n → ∞, for a specified fractionation of traits at the leaves, or terminal taxa. For example, if the terminal taxa are evenly split between the two traits, then the fraction of trees that parsimoniously root with definitively one of those traits is, in the limit of large trees, exactly 1/3. © 1990 Academic Press Limited.
引用
收藏
页码:265 / 274
页数:10
相关论文
共 50 条
  • [11] Root grafting in trees
    La Rue, CD
    AMERICAN JOURNAL OF BOTANY, 1934, 21 (03) : 121 - 126
  • [12] Goal Trees and Fault Trees for Root Cause Analysis
    Zhu, Qin
    2008 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, 2008, : 436 - 439
  • [13] Limit laws for functions of fringe trees for binary search trees and random recursive trees
    Holmgren, Cecilia
    Janson, Svante
    ELECTRONIC JOURNAL OF PROBABILITY, 2015, 20 : 1 - 51
  • [14] Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
    Michael Fuchs
    Hsien-Kuei Hwang
    Ralph Neininger
    Algorithmica, 2006, 46 : 367 - 407
  • [15] Profiles of random trees: Limit theorems for random recursive trees and binary search trees
    Fuchs, Michael
    Hwang, Hsien-Kuei
    Neininger, Ralph
    ALGORITHMICA, 2006, 46 (3-4) : 367 - 407
  • [16] On Trees with Minimal ABC Index among Trees with Given Number of Leaves
    Lin, Wenshui
    Chen, Jiwen
    Ma, Chi
    Zhang, Yuan
    Chen, Junjie
    Zhang, Dongzhan
    Jia, Fei
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2016, 76 (01) : 131 - 140
  • [17] The cold range limit of trees
    Korner, Christian
    TRENDS IN ECOLOGY & EVOLUTION, 2021, 36 (11) : 979 - 989
  • [18] Laplacian coefficients of trees with a given bipartition
    Lin, Weiqi
    Yan, Weigen
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2011, 435 (01) : 152 - 162
  • [19] On minimal energies of trees with given diameter
    Li, Shuchao
    Li, Nana
    ELECTRONIC JOURNAL OF LINEAR ALGEBRA, 2008, 17 : 414 - 425
  • [20] The number of subtrees of trees with given diameter
    Chen, Zichong
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2018, 10 (01)