ArticleJournal of mathematical biology2020
Counting phylogenetic networks of level 1 and 2.
Article in Journal of mathematical biology, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
7 citing papers in PubMed.
- A Dichotomy Law for Certain Classes of Phylogenetic Networks.Bulletin of mathematical biology · 2025Article
- Asymptotic Enumeration of Normal and Hybridization Networks via Tree Decoration.Bulletin of mathematical biology · 2025Article
- Sackin indices for labeled and unlabeled classes of galled trees.Journal of mathematical biology · 2025Article
- Mathematically tractable models of random phylogenetic networks: an overview of some recent developments.Philosophical transactions of the Royal Society of London. Series B, Biological sciences · 2025Review
- All galls are divided into three or more parts: recursive enumeration of labeled histories for galled trees.Algorithms for molecular biology : AMB · 2023Article
- Combinatorial characterization of a certain class of words and a conjectured connection with general subclasses of phylogenetic tree-child networks.Scientific reports · 2021Article
- On asymptotic joint distributions of cherries and pitchforks for random phylogenetic trees.Journal of mathematical biology · 2021Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
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.
Indexed as
Identifiers
33005997What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.