Regularizing and Normalizing DAGs and Phylogenetic Networks
Bulletin of Mathematical Biology · 2026
DOI: 10.1007/s11538-026-01783-4 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bulletin of Mathematical Biology, 2026. Verfasst von Marc Hellmuth und 2 weiteren Autor:innen. Beteiligte Einrichtung: Faculty of Mathematics and Computer Science, Leipzig University, 04109, Leipzig, Germany. Hauptthemen laut MEDLINE: Phylogeny, Models, Genetic. Die Arbeit nennt 31 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Phylogenetic networks and, more generally, directed acyclic graphs (DAGs) represent hierarchical structure beyond trees, for instance in the presence of reticulate evolutionary events such as hybridization or horizontal gene transfer. A central question is which parts of such graphs are essential with respect to leaf-observable information, and which parts can be removed without changing this information. Resolving this question can lead to principled simplification methods for phylogenetic networks, such as the recent normalization approach of Francis et al. In this paper, we study this question from three related perspectives: clusters displayed by a DAG G , least common ancestors (LCAs) of subsets of its leaf set, and visibility, a path-based property of vertices. We first introduce an LCA-based simplification procedure called i -regularization . For a DAG G and $$i\ge 1$$ i ≥ 1 , the DAG $$\textsc {Reg}_i(G)$$ R E G i ( G ) retains precisely those vertices that occur as unique LCAs of leaf subsets of size at most i , removes the remaining non-leaf vertices by a graph-editing operation $$\ominus $$ ⊖ , and then deletes shortcuts. We show that $$\textsc {Reg}_i(G)$$ R E G i ( G ) admits a Hasse-diagram characterization in terms of the corresponding lca-clusters. We then compare LCA-based regularization with normalization. Using the same $$\ominus $$ ⊖ -operator, we describe the cover construction underlying normalization, identify visible vertices that are nevertheless removed, and characterize when regularization and normalization coincide. Together, these results provide a unified framework for cluster-based, LCA-based, and visibility-based simplifications of DAGs and phylogenetic networks.
Schlagwörter
MeSH-Schlagwörter (MEDLINE)
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Faculty of Mathematics and Computer Science, Leipzig University, 04109, Leipzig, Germany.
- Department of Mathematics, Faculty of Science, Stockholm University, SE-10691, Stockholm, Sweden. anna.lindeberg@math.su.se.
- School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, UK.
ORCID-Profile: Marc Hellmuth, Vincent Moulton
Zitieren
APA
Hellmuth, M., Lindeberg, A., & Moulton, V. (2026). Regularizing and Normalizing DAGs and Phylogenetic Networks. Bulletin of Mathematical Biology. https://doi.org/10.1007/s11538-026-01783-4
Vancouver
Hellmuth M, Lindeberg A, Moulton V. Regularizing and Normalizing DAGs and Phylogenetic Networks. Bulletin of Mathematical Biology. 2026. doi:10.1007/s11538-026-01783-4
BibTeX
@article{Hellmuth2026,
author = {Hellmuth, Marc and Lindeberg, Anna and Moulton, Vincent},
title = {Regularizing and Normalizing DAGs and Phylogenetic Networks},
journal = {Bulletin of Mathematical Biology},
year = {2026},
doi = {10.1007/s11538-026-01783-4}
}
EUVIMED