Counting rankings of tree-child networks
Rooted phylogenetic networks allow biologists to represent evolutionary relationships between present-day species by revealing ancestral speciation and hybridization events. A convenient and well-studied class of such networks are tree-child networks' and a ranking' of such a network is a temporal ordering of the ancestral speciation and hybridization events. In this short note, we show how to efficiently count such rankings on any given binary (or semi-binary) tree-child network. We also consider a class of binary tree-child networks that have exactly one ranking, and investigate further the relationship between ranked-tree child networks and the class of `normal' networks. Finally, we provide an explicit asymptotic expression for the expected number of rankings of a tree-child network chosen uniformly at random.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Short Note on the Exact Counting of Tree-Child Networks
Tree-child networks are an important network class which are used in phylogenetics to model reticulate evolution. In a recent paper, Pons and Batle (2021) conjectured a relation between tree-child networks and certain wo…
RelationCounting cherry reduction sequences is counting linear extensions (in phylogenetic tree-child networks)
Orchard and tree-child networks share an important property with phylogenetic trees: they can be completely reduced to a single node by iteratively deleting cherries and reticulated cherries. As it is the case with phylo…
Counting spinal phylogenetic networks
Phylogenetic networks are an important way to represent evolutionary histories that involve reticulations such as hybridization or horizontal gene transfer, yet fundamental questions such as how many networks there are t…
Learning-to-Count by Learning-to-Rank: Weakly Supervised Object Counting & Localization Using Only Pairwise Image Rankings
Object counting and localization in dense scenes is a challenging class of image analysis problems that typically requires labour intensive annotations to learn to solve. We propose a form of weak supervision that only r…
Learning-To-RankObjectObject CountingCan Multiple Phylogenetic Trees Be Displayed in a Tree-Child Network Simultaneously?
A binary phylogenetic network on a taxon set $X$ is a rooted acyclic digraph in which the degree of each nonleaf node is three and its leaves (i.e.degree-one nodes) are uniquely labeled with the taxa of $X$. It is tree-c…