Evidence map›Paper›PMID 30956378›Full record

ArticleAlgorithmica2018

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.

Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes

Abstract read
PubMed Full text at PMC Publisher
In one paragraph

Article in Algorithmica, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

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

6 citing papers in PubMed.

  1. Characterizing semi-directed phylogenetic networks and their multi-rootable variants.Theory in biosciences = Theorie in den Biowissenschaften · 2025
    Article
  2. Article
  3. Article
  4. Tree-Based Unrooted Phylogenetic Networks.Bulletin of mathematical biology · 2018
    Article
  5. Uprooted Phylogenetic Networks.Bulletin of mathematical biology · 2017
    Article
  6. 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

5 authors.

Leo van Iersel1Delft Institute of Applied Mathematics, Delft University of Technology, Delft, The Netherlands.
Steven Kelk2Department of Data Science and Knowledge Engineering (DKE), Maastricht University, Maastricht, The Netherlands.
Georgios Stamoulis2Department of Data Science and Knowledge Engineering (DKE), Maastricht University, Maastricht, The Netherlands.
Leen Stougie3CWI, INRIA-Erable and Department of Econometrics and Operations Research, Vrije Universiteit, Amsterdam, The Netherlands.
Olivier Boes2Department of Data Science and Knowledge Engineering (DKE), Maastricht University, Maastricht, The Netherlands.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegree two is minimized. However, from a biological point of view accurately inferring the root location in a phylogenetic tree is notoriously difficult and poor root placement can artificially inflate the hybridization number. To this end we study a number of relaxed variants of this problem. We start by showing that the fundamental problem of determining whether an

Indexed as

APX-hardnessBinary treesFixed parameter tractabilityKernelizationNP-completenessPhylogenetic networks

Identifiers

PMID30956378
PMCPMC6428403

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.