Evidence map›Paper›PMID 40674105›Full record

ArticleSystematic biology2026

PhyloFusion-Fast and Easy Fusion of Rooted Phylogenetic Trees into Rooted Phylogenetic Networks.

Louxin Zhang, Banu Cetinkaya, Daniel H Huson

Abstract read
In one paragraph

Article in Systematic biology, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

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

3 citing papers in PubMed.

  1. Displacement-Optimized Tanglegrams for Trees and Networks.Molecular biology and evolution · 2026
    Article
  2. Sketch, capture and layout phylogenies.PLoS computational biology · 2025
    Article
  3. 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.

Louxin ZhangDepartment of Mathematics and Centre for Data Science and Machine Learning, National University of Singapore, #07-25, Block S17, 10 Lower Kent Ridge Road, Singapore 119076, Singapore.ORCID 0000-0003-0260-824X
Banu CetinkayaInstitute for Bioinformatics and Medical Informatics, and Excellence Cluster "Controlling Microbes to Fight Infection", University of Tübingen, Sand 14, Tübingen 72076, Germany.
Daniel H HusonInstitute for Bioinformatics and Medical Informatics, and Excellence Cluster "Controlling Microbes to Fight Infection", University of Tübingen, Sand 14, Tübingen 72076, Germany.ORCID 0000-0002-2961-604X

Funding

Kavli Institute for Theoretical Physics (KITP)Singapore MOE Academic Research Fund Tier 1 NSF PHY-2309135
6 · The paper itself

Abstract

Unrooted phylogenetic networks are commonly used to represent evolutionary data in the presence of incompatibilities. Although rooted phylogenetic networks offer a more explicit framework for depicting evolutionary histories involving reticulate events, they are reported less frequently, probably due to a lack of tools that are as easily applicable as those for unrooted networks. Here, we introduce PhyloFusion, a fast and user-friendly method for constructing rooted phylogenetic networks from sets of rooted phylogenetic trees. The resulting networks have the tree-child property. The algorithm accommodates trees with unresolved nodes-often resulting from the contraction of low-support edges-as well as some degree of missing taxa. We demonstrate its application to the analysis of functionally related gene groups and show that it can efficiently handle data sets comprising tens of trees or hundreds of taxa. An open source implementation of PhyloFusion is available as part of the SplitsTree app: https://www.github.com/husonlab/splitstree6. All data available here: https://doi.org/10.5061/dryad.k3j9kd5h5.

Indexed as

ClassificationPhylogenySoftwareAlgorithmsAlgorithmsphylogenetic networksphylogeneticsreticulate evolutionsoftware

Identifiers

PMID40674105
PMCPMC12805670

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.