Metrics for classes of semi-binary phylogenetic networks using μ-representations

Journal Article (2026)
Author(s)

Christopher Reichling (Delft Institute of Applied Mathematics)

Leo van Iersel (TU Delft - Discrete Mathematics and Optimization)

Yukihiro Murakami (TU Delft - Discrete Mathematics and Optimization)

Research Group
Discrete Mathematics and Optimization
DOI related publication
https://doi.org/10.1016/j.aam.2025.102953 Final published version
More Info
expand_more
Publication Year
2026
Language
English
Research Group
Discrete Mathematics and Optimization
Journal title
Advances in Applied Mathematics
Volume number
172
Article number
102953
Downloads counter
84
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Phylogenetic networks are useful in representing the evolutionary history of taxa. In certain scenarios, one requires a way to compare different networks. In practice, this can be rather difficult, except within specific classes of networks. In this paper, we derive metrics for the class of orchard networks and the class of strongly reticulation-visible networks, from variants of so-called μ-representations, which are vector representations of networks. For both network classes, we impose degree constraints on the vertices, by considering semi-binary networks.