Evidence map›Paper›PMID 41721936›Full record

ArticleBulletin of mathematical biology2026

Counting Rankings of Tree-Child Networks.

Qiang Zhang, Mike Steel

Abstract read
In one paragraph

Article in Bulletin of mathematical biology, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Qiang ZhangBiomathematics Research Center, School of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand.
Mike SteelBiomathematics Research Center, School of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand. mike.steel@canterbury.ac.nz.ORCID http://orcid.org/0000-0001-7015-4644

Funding

Marsden Fund 23-UOC-003
6 · The paper itself

Abstract

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 investigate the question of counting such rankings on any given binary (or semi-binary) tree-child network. We also investigate the relationship between rankable 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.

Indexed as

Models, GeneticPhylogenyAlgorithmsAnimalsBiological EvolutionComputer SimulationGenetic SpeciationHybridization, GeneticMathematical ConceptsAlgorithmEnumerationPhylogenetic networkRankings

Identifiers

PMID41721936
PMCPMC12924824

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.