Counting general phylogenetic networks
From MaRDI portal
Abstract: We provide precise asymptotic estimates for the number of general phylogenetic networks by using analytic combinatorial methods. Recently, this approach is studied by Fuchs, Gittenberger, and the author himself (Australasian Journal of Combinatorics 73(2):385-423, 2019), to count networks with few reticulation vertices for two subclasses: tree-child and normal networks. We follow this line of research to show how to obtain results on the enumeration of general phylogenetic networks.
Recommendations
- Counting phylogenetic networks
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Counting phylogenetic networks of level 1 and 2
- Counting phylogenetic networks with few reticulation vertices: a second approach
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
Cites work
- Analytic combinatorics
- Asymptotic enumeration and distributional properties of galled networks
- Combinatorial scoring of phylogenetic networks
- Counting and enumerating tree-child networks and their subclasses
- Counting phylogenetic networks
- Counting phylogenetic networks of level 1 and 2
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Counting trees in a phylogenetic network is \#P-complete
- Determining phylogenetic networks from inter-taxa distances
- Enumerating phylogenetic trees with multiple labels
- Generating functions for multi-labeled trees
- scientific article; zbMATH DE number 3693319 (Why is no real title available?)
- Isomorphism and symmetries in random phylogenetic trees
- On the number of vertices of each rank in phylogenetic trees and their generalizations
- Phylogenetic networks with every embedded phylogenetic tree a base tree
- Properties of normal phylogenetic networks
- Size of a phylogenetic network
Cited in
(23)- Counting consistent phylogenetic trees is \#P-complete
- Asymptotic enumeration and distributional properties of galled networks
- Bijections for ranked tree-child networks
- Counting phylogenetic networks with few reticulation vertices: a second approach
- Counting and enumerating galled networks
- Counting and enumerating tree-child networks and their subclasses
- Counting phylogenetic networks of level 1 and 2
- On the asymptotic growth of the number of tree-child networks
- Counting phylogenetic networks
- Combinatorial scoring of phylogenetic networks
- Counting trees in a phylogenetic network is \#P-complete
- Complexity of phylogenetic networks: Counting cubes in median graphs and related problems
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
- Size of a phylogenetic network
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- A branching process approach to level‐k phylogenetic networks
- Enumerative and distributional results for d-combining tree-child networks
- Counting phylogenetic networks with few reticulation vertices: galled and reticulation-visible networks
- Asymptotic enumeration of rooted binary unlabeled galled trees with a fixed number of galls
- Galled tree-child networks
- Lifted inference beyond first-order logic
- Combinatorial comparison of general galled trees, time-consistent galled trees, and simplex time-consistent galled trees
- Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
This page was built for publication: Counting general phylogenetic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863475)
