Folding and unfolding phylogenetic trees and networks

被引:0
|
作者
Katharina T. Huber
Vincent Moulton
Mike Steel
Taoyang Wu
机构
[1] University of East Anglia,School of Computing Sciences
[2] University of Canterbury,School of Mathematics and Statistics
来源
关键词
Phylogenetic networks; Multi-labelled trees; Graph fibrations; Tree and network reconciliation; Universal cover of a digraph; 05C90; 92D15;
D O I
暂无
中图分类号
学科分类号
摘要
Phylogenetic networks are rooted, labelled directed acyclic graphswhich are commonly used to represent reticulate evolution. There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees). Indeed, any phylogenetic network N can be “unfolded” to obtain a MUL-tree U(N) and, conversely, a MUL-tree T can in certain circumstances be “folded” to obtain aphylogenetic network F(T) that exhibits T. In this paper, we study properties of the operations U and F in more detail. In particular, we introduce the class of stable networks, phylogenetic networks N for which F(U(N)) is isomorphic to N, characterise such networks, and show that they are related to the well-known class of tree-sibling networks. We also explore how the concept of displaying a tree in a network N can be related to displaying the tree in the MUL-tree U(N). To do this, we develop aphylogenetic analogue of graph fibrations. This allows us to view U(N) as the analogue of the universal cover of a digraph, and to establish a close connection between displaying trees in U(N) and reconciling phylogenetic trees with networks.
引用
收藏
页码:1761 / 1780
页数:19
相关论文
共 50 条
  • [21] Phylogenetic super-networks from partial trees
    Huson, DH
    Dezulian, T
    Klöpper, T
    Steel, MA
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2004, 1 (04) : 151 - 158
  • [22] A new algorithm to construct phylogenetic networks from trees
    Wang, J.
    GENETICS AND MOLECULAR RESEARCH, 2014, 13 (01) : 1456 - 1464
  • [23] The Algebra of the General Markov Model on Phylogenetic Trees and Networks
    Sumner, J. G.
    Holland, B. R.
    Jarvis, P. D.
    BULLETIN OF MATHEMATICAL BIOLOGY, 2012, 74 (04) : 858 - 880
  • [24] Phylogenetic super-networks from partial trees
    Huson, DH
    Dezulian, T
    Klöpper, T
    Steel, MA
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2004, 3240 : 388 - 399
  • [25] A Generalized Robinson-Foulds Distance for Clonal Trees, Mutation Trees, and Phylogenetic Trees and Networks
    Llabres, Merce
    Rossello, Francesc
    Valiente, Gabriel
    ACM-BCB 2020 - 11TH ACM CONFERENCE ON BIOINFORMATICS, COMPUTATIONAL BIOLOGY, AND HEALTH INFORMATICS, 2020,
  • [26] The folding and unfolding of eukaryotic chromatin
    Bassett, Andrew
    Cooper, Sarah
    Wu, Chenyi
    Travers, Andrew
    CURRENT OPINION IN GENETICS & DEVELOPMENT, 2009, 19 (02) : 159 - 165
  • [27] Folding and unfolding in computational geometry
    O'Rourke, J
    DISCRETE AND COMPUTATIONAL GEOMETRY, 2000, 1763 : 258 - 266
  • [28] Proteins: The unfolding - And folding - Picture
    Flannery, MC
    AMERICAN BIOLOGY TEACHER, 1999, 61 (02): : 150 - 153
  • [29] RATES OF UNFOLDING AND FOLDING OF MYOGLOBIN
    HERMANS, J
    SHEN, L
    FEDERATION PROCEEDINGS, 1971, 30 (03) : 1107 - &
  • [30] UNFOLDING FOLDING + FLOWING ARCHITECTURE
    POWELL, K
    ARCHITECTURAL DESIGN, 1993, (102) : 6 - 7