Evidence map›Paper›PMID 32047981›Full record

ArticleJournal of mathematical biology2020

Level-1 phylogenetic networks and their balanced minimum evolution polytopes.

Cassandra Durell, Stefan Forcey

Abstract read
PubMed Publisher
In one paragraph

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 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing 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

2 citing papers in PubMed.

  1. Article
  2. 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

2 authors.

Cassandra DurellDepartment of Mathematics, The University of Akron, Akron, OH, 44325-4002, USA.
Stefan ForceyDepartment of Mathematics, The University of Akron, Akron, OH, 44325-4002, USA. sforcey@uakron.edu.ORCID 0000-0003-2251-5710

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Balanced minimum evolution is a distance-based criterion for the reconstruction of phylogenetic trees. Several algorithms exist to find the optimal tree with respect to this criterion. One approach is to minimize a certain linear functional over an appropriate polytope. Here we present polytopes that allow a similar linear programming approach to finding phylogenetic networks. We investigate a two-parameter family of polytopes that arise from phylogenetic networks, and which specialize to the Balanced Minimum Evolution polytopes as well as the Symmetric Travelling Salesman polytopes. We show that the vertices correspond to certain level-1 phylogenetic networks, and that there are facets or faces for every split. We also describe lower bound faces and a family of faces for every dimension.

Indexed as

Evolution, MolecularModels, GeneticPhylogenyAlgorithmsComputational BiologyComputer GraphicsComputer SimulationMathematical ConceptsProgramming, LinearNetworksPhylogeneticsPolytopesTrees

Identifiers

What OpenQuestion holds

Textmetadata
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.