Counting General Phylogenetic networks
From MaRDI portal
Publication:5863475
zbMath1492.92050arXiv2005.14547MaRDI QIDQ5863475
Publication date: 1 June 2022
Full work available at URL: https://arxiv.org/abs/2005.14547
Problems related to evolution (92D15) Exact enumeration problems, generating functions (05A15) Systems biology, networks (92C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Phylogenetic networks with every embedded phylogenetic tree a base tree
- Determining phylogenetic networks from inter-taxa distances
- Size of a phylogenetic network
- Enumerating phylogenetic trees with multiple labels
- Generating functions for multi-labeled trees
- Asymptotic enumeration and distributional properties of galled networks
- Counting and enumerating tree-child networks and their subclasses
- Counting phylogenetic networks of level 1 and 2
- Counting phylogenetic networks
- Properties of normal phylogenetic networks
- Combinatorial Scoring of Phylogenetic Networks
- Counting Trees in a Phylogenetic Network Is \#P-Complete
- On the number of vertices of each rank in phylogenetic trees and their generalizations
- Isomorphism and Symmetries in Random Phylogenetic Trees
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
This page was built for publication: Counting General Phylogenetic networks
