Counting phylogenetic networks of level 1 and 2
From MaRDI portal
Publication:2219260
Abstract: Phylogenetic networks generalize phylogenetic trees, and have been introduced in order to describe evolution in the case of transfer of genetic material between coexisting species. There are many classes of phylogenetic networks, which can all be modeled as families of graphs with labeled leaves. In this paper, we focus on rooted and unrooted level-k networks and provide enumeration formulas (exact and asymptotic) for rooted and unrooted level-1 and level-2 phylogenetic networks with a given number of leaves. We also prove that the distribution of some parameters of these networks (such as their number of cycles) are asymptotically normally distributed. These results are obtained by first providing a recursive description (also called combinatorial specification) of our networks, and by next applying classical methods of enumerative, symbolic and analytic combinatorics.
Recommendations
Cites work
- A calculus for the random generation of labelled combinatorial structures
- Analytic combinatorics
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Counting and enumerating galled networks
- Counting phylogenetic networks
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Do branch lengths help to locate a tree in a phylogenetic network?
- Exploring the tiers of rooted phylogenetic network space using tail moves
- scientific article; zbMATH DE number 3315017 (Why is no real title available?)
- Leaf-reconstructibility of phylogenetic networks
- Quarnet inference rules for level-1 networks
- Random Trees
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
- The Structure of Level-k Phylogenetic Networks
- Transforming phylogenetic networks: moving beyond tree space
- Trinets encode tree-child and level-2 phylogenetic networks
Cited in
(28)- Galois connections for phylogenetic networks and their polytopes
- Asymptotic enumeration and distributional properties of galled networks
- Bijections for ranked tree-child networks
- The Sackin index of simplex networks
- Phylogenetic network dissimilarity measures that take branch lengths into account
- Counting phylogenetic networks with few reticulation vertices: a second approach
- On asymptotic joint distributions of cherries and pitchforks for random phylogenetic trees
- Counting phylogenetic networks
- Combinatorial scoring of phylogenetic networks
- The Structure of Level-k Phylogenetic Networks
- 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
- Counting general phylogenetic networks
- Labellable phylogenetic networks
- A branching process approach to level‐k phylogenetic networks
- Exact-Size Sampling of Enriched Trees in Linear Time
- Enumeration of rooted binary unlabeled galled trees
- Exact counts of binary phylogenetic networks with two and three reticulation events (extended abstract)
- Asymptotic enumeration of rooted binary unlabeled galled trees with a fixed number of galls
- Galled tree-child networks
- A dichotomy law for certain classes of phylogenetic networks
- Asymptotic enumeration of normal and hybridization networks via tree decoration
- Lifted inference beyond first-order logic
- Sackin indices for labeled and unlabeled classes of galled trees
- 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
- Biochemical and phylogenetic networks. II: X-trees and phylogenetic trees
This page was built for publication: Counting phylogenetic networks of level 1 and 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219260)
