Distinct-Cluster Tree-Child Phylogenetic Networks and Possible Uses to Study Polyploidy

Abstract

As phylogenetic networks become more widely studied and the networks grow larger, it may be useful to “simplify” such networks into especially tractable networks. Recent results have found methods to simplify networks into normal networks. By definition, normal networks contain no redundant arcs. Nevertheless, there may be redundant arcs in networks where speciation events involving allopolyploidy occur. It is therefore desirable to find a different tractable class of networks that may contain redundant arcs. This paper proposes distinct-cluster tree-child networks as such a class, here abbreviated as DCTC networks. They are shown to have a number of useful properties, such as quadratic growth of the number of vertices with the number of leaves. A DCTC network is shown to be essentially a normal network to which some redundant arcs may have been added without losing the tree-child property. Every phylogenetic network can be simplified into a DCTC network depending only on the structure of the original network. There is always a CSD map from the original network to the resulting DCTC network. As a result, the simplified network can readily be interpreted via a “wired lift” in which the original network is redrawn with each arc represented in one of two ways.