Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear Extensions.

Tomás M Coronado, Joan Carles Pons, Gabriel Riera

Abstract read

In one paragraph

Article in Bulletin of mathematical biology, 2024. 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

3 authors.

Tomás M Coronado *Department of Mathematics and Computer Science, Universitat de les Illes Balears, Ctra. de Valldemossa, km 7,5, 07122, Palma, Illes Balears, Spain.

Joan Carles Pons *Department of Mathematics and Computer Science, Universitat de les Illes Balears, Ctra. de Valldemossa, km 7,5, 07122, Palma, Illes Balears, Spain.

Gabriel Riera *Department of Mathematics and Computer Science, Universitat de les Illes Balears, Ctra. de Valldemossa, km 7,5, 07122, Palma, Illes Balears, Spain. gabriel.riera@uib.es.ORCID 0000-0003-1233-0931

Funding

MCIN/AEI/10.13039/501100011033 and "ERDF A way of making Europe." PID2021-126114NB-C44

6 · The paper itself

Abstract

Orchard and tree-child networks share an important property with phylogenetic trees: they can be completely reduced to a single node by iteratively deleting cherries and reticulated cherries. As it is the case with phylogenetic trees, the number of ways in which this can be done gives information about the topology of the network. Here, we show that the problem of computing this number in tree-child networks is akin to that of finding the number of linear extensions of the poset induced by each network, and give an algorithm based on this reduction whose complexity is bounded in terms of the level of the network.

Indexed as

AlgorithmsMathematical ConceptsModels, GeneticPhylogenyLinear extensionsNetwork tree-widthOrchard networksPhylogenetic networksTree-child networks

Identifiers

PMID39520517

DOI10.1007/s11538-024-01374-1

PMCPMC11550256

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.