Sign in
BioinformaticsSystematic Biology
Peer-reviewed journal article

PhyloFusion- Fast and easy fusion of rooted phylogenetic trees into rooted phylogenetic networks

Louxin ZhangiD, Banu Cetinkaya, Daniel H. HusoniD

Abstract

Unrooted phylogenetic networks are often used to represent evolutionary data when incompatibilities are present. Although rooted phylogenetic networks are better suited for explicitly depicting evolutionary histories that involve reticulate events, they have been rarely used in practice, due to a lack of appropriate methods for their calculation. Here we present PhyloFusion, a fast and easily-applicable method for calculating rooted phylogenetic networks on sets of rooted phylogenetic trees. The algorithm can handle trees with unresolved nodes (which arise when edges with low support are contracted) and missing taxa. We illustrate how to use the algorithm to explore different groups of functionally-related genes and report that the algorithm can be applied to datasets containing tens of trees and hundreds of taxa. AvailabilityAn open source implementation of PhyloFusion is available in SplitsTree, https://www.github.com/husonlab/splitstree6 (GPLv3 license)

PDFDOICode

02 /Specification & Classification

Click any tag to browse matching papers
Citations
9
FWCI
2.69
Field percentile
top 9%

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISHoltgrefe '26Wen '17Markin '19Willson '26Huson '25Guang '26
79% semantic matchBioinformatics
Niels Holtgrefe·Bioinformatics·Oct 1, 2026