Labellable Phylogenetic Networks

Author:

Francis Andrew,Steel Mike

Abstract

AbstractPhylogenetic networks are mathematical representations of evolutionary history that are able to capture both tree-like evolutionary processes (speciations), and non-tree-like “reticulate” processes such as hybridization or horizontal gene transfer. The additional complexity that comes with this capacity, however, makes networks harder to infer from data, and more complicated to work with as mathematical objects.In this paper we define a new, large class of phylogenetic networks, that we calllabellable, and show that they are in bijection with the set of “expanding covers” of finite sets. This correspondence is a generalisation of the encoding of phylogenetic forests by partitions of finite sets. Labellable networks can be characterised by a simple combinatorial condition, and we describe the relationship between this large class and other commonly studied classes. Furthermore, we show that all phylogenetic networks have a quotient network that is labellable.

Publisher

Cold Spring Harbor Laboratory

Reference20 articles.

1. Reconstructing the shape of a tree from observed dissimilarity data

2. A distance metric for a class of tree-sibling phylogenetic networks

3. Comparison of treechild phylogenetic networks;IEEE/ACM Transactions on Computational Biology and Bioinformatics,2008

4. Matchings and phylogenetic trees

5. A class of phylogenetic networks reconstructable from ancestral profiles;Mathematical Biosciences,2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3