Phylogenetic network classes through the lens of expanding covers.

Andrew Francis, Daniele Marchei, Mike Steel

Abstract read

In one paragraph

Article in Journal of mathematical biology, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it

0cells of the map it votes in

1citing 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

1 citing paper in PubMed.

Counting Spinal Phylogenetic Networks.Bulletin of mathematical biology · 2026
Article

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

3 authors.

Andrew FrancisCentre for Research in Mathematics and Data Science, Western Sydney University, Sydney, Australia. a.francis@unsw.edu.au.ORCID 0000-0002-9938-3499

Daniele MarcheiCentre for Research in Mathematics and Data Science, Western Sydney University, Sydney, Australia.ORCID 0000-0002-5215-8489

Mike SteelBiomathematics Research Centre, University of Canterbury, Christchurch, New Zealand.ORCID 0000-0001-7015-4644

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

It was recently shown that a large class of phylogenetic networks, the 'labellable' networks, is in bijection with the set of 'expanding' covers of finite sets. In this paper, we show how several prominent classes of phylogenetic networks can be characterised purely in terms of properties of their associated covers. These classes include the tree-based, tree-child, orchard, tree-sibling, and normal networks. In the opposite direction, we give an example of how a restriction on the set of expanding covers can define a new class of networks, which we call 'spinal' phylogenetic networks.

Indexed as

AlgorithmsModels, GeneticHumansPhylogenyAlgorithmsCharacterising network classesEncodingExpanding coverPartitionPhylogenetic networkSpanning tree

Identifiers

PMID38584237

DOI10.1007/s00285-024-02075-y

PMCPMC10999392

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.