Inferring phylogenetic trees from the knowledge of rare evolutionary events

被引:0
|
作者
Marc Hellmuth
Maribel Hernandez-Rosales
Yangjing Long
Peter F. Stadler
机构
[1] University of Greifswald,Department of Mathematics and Computer Science
[2] Saarland University,Center for Bioinformatics
[3] UNAM Juriquilla,CONACYT
[4] Central China Normal University,Instituto de Matemáticas
[5] Leipzig University,School of Mathematical Sciences
[6] Max-Planck-Institute for Mathematics in the Sciences,Bioinformatics Group, Department of Computer Science, Interdisciplinary Center of Bioinformatics, German Centre for Integrative Biodiversity Research (iDiv) Halle
[7] University of Vienna,Jena
[8] Santa Fe Institute,Leipzig, Competence Center for Scalable Data Services and Solutions, and Leipzig Research Center for Civilization Diseases
来源
关键词
Phylogenetic combinatorics; Rare events; Binary relations; 05C90; 05C05; 68R05; 68R10; 92D15;
D O I
暂无
中图分类号
学科分类号
摘要
Rare events have played an increasing role in molecular phylogenetics as potentially homoplasy-poor characters. In this contribution we analyze the phylogenetic information content from a combinatorial point of view by considering the binary relation on the set of taxa defined by the existence of a single event separating two taxa. We show that the graph-representation of this relation must be a tree. Moreover, we characterize completely the relationship between the tree of such relations and the underlying phylogenetic tree. With directed operations such as tandem-duplication-random-loss events in mind we demonstrate how non-symmetric information constrains the position of the root in the partially reconstructed phylogeny.
引用
下载
收藏
页码:1623 / 1653
页数:30
相关论文
共 50 条
  • [41] Inferring species trees from gene trees: A phylogenetic analysis of the elapidae (Serpentes) based on the amino acid sequences of venom proteins
    Slowinski, JB
    Knight, A
    Rooney, AP
    MOLECULAR PHYLOGENETICS AND EVOLUTION, 1997, 8 (03) : 349 - 362
  • [42] Taxon ordering in phylogenetic trees by means of evolutionary algorithms
    Cerutti, Francesco
    Bertolotti, Luigi
    Goldberg, Tony L.
    Giacobini, Mario
    BIODATA MINING, 2011, 4
  • [43] Minimizing phylogenetic number to find good evolutionary trees
    Goldberg, LA
    Goldberg, PW
    Phillips, CA
    Sweedyk, E
    Warnow, T
    COMBINATORIAL PATTERN MATCHING, 1995, 937 : 102 - 127
  • [44] Minimizing phylogenetic number to find good evolutionary trees
    Goldberg, LA
    Goldberg, PW
    Phillips, CA
    Sweedyk, E
    Warnow, T
    DISCRETE APPLIED MATHEMATICS, 1996, 71 (1-3) : 111 - 136
  • [46] ESTIMATION OF EVOLUTIONARY DISTANCE FOR RECONSTRUCTING MOLECULAR PHYLOGENETIC TREES
    TAJIMA, F
    TAKEZAKI, N
    MOLECULAR BIOLOGY AND EVOLUTION, 1994, 11 (02) : 278 - 286
  • [47] A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
    Jiang, T
    Kearney, P
    Li, M
    SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 1942 - 1961
  • [48] Taxon ordering in phylogenetic trees by means of evolutionary algorithms
    Francesco Cerutti
    Luigi Bertolotti
    Tony L Goldberg
    Mario Giacobini
    BioData Mining, 4
  • [49] Transferomics: Seeing the Evolutionary Forest Using Phylogenetic Trees
    Whitaker, John W.
    Westhead, David R.
    EVOLUTIONARY BIOLOGY: CONCEPTS, MOLECULAR AND MORPHOLOGICAL EVOLUTION, 2010, : 101 - 114
  • [50] INFERRING EVOLUTIONARY TREES FROM GENE-FREQUENCY DATA UNDER THE PRINCIPLE OF MAXIMUM PARSIMONY
    SWOFFORD, DL
    BERLOCHER, SH
    SYSTEMATIC ZOOLOGY, 1987, 36 (03): : 293 - 325