Encoding Phylogenetic Networks with Least Common Ancestor Constraints

2026-06-15

AI Summary

This study addresses the problem of efficiently encoding phylogenetic networks while preserving their structural information through constraints derived from the lowest common ancestors (LCAs) of leaf pairs. The authors propose a framework based on a canonical directed acyclic graph constructed from LCA relationships, integrating 2-regular normal forms and closure operations to yield a sparse triplet representation of LCA constraints. This approach provides the first explicit characterization of the substructures of a network uniquely determined by its LCA relations. Furthermore, the work demonstrates that several important classes of networks—including regular level-1 networks and binary normal networks—can be exactly reconstructed in polynomial time from such sparse LCA constraints.

Abstract

Encoding phylogenetic networks by suitable substructures is a central problem in phylogenetic combinatorics. We study encodings based on least common ancestor (LCA) constraints. For a directed acyclic graph (DAG) $G$ with leaf set $X$, we consider the relation on pairs of leaves in which $(ab,xy)$ records that the LCAs of $a,b$ and $x,y$ are well-defined and that the former is a descendant of the latter. We first identify precisely which part of $G$ is determined by this relation. To this end, we compare the canonical DAG constructed from the LCA relation with the 2-regularization of $G$, obtained by removing all vertices that are not LCAs of one or two leaves and then deleting shortcut edges. We prove that these two DAGs are isomorphic. Hence the obstruction to encoding a graph by its LCA relation is exactly the information lost under 2-regularization. This yields a general reconstruction principle, which we apply to several natural classes of phylogenetic networks. In particular, we show that shortcut-free 2-LCA-relevant DAGs, phylogenetic trees, regular level-1 networks, regular networks with binary clustering systems, regular networks whose clustering systems are closed weak hierarchies, strong-phylogenetic normal networks, separated phylogenetic normal networks, and binary normal networks are encoded by their LCA relations. We also introduce a sparse triple-like restriction consisting only of comparisons of the form $(ab,ac)$, where $a,b,c\in X$ are pairwise distinct. For graphs with the 2-LCA property, we show that this sparse relation, together with the leaf set, determines the full LCA relation after a natural closure operation. Consequently, several of the above classes can be reconstructed, up to isomorphism, from the sparse relation in polynomial time.

Problem

• phylogenetic networks
• least common ancestor
• encoding
• directed acyclic graph
• reconstruction

Innovation

• phylogenetic networks
• least common ancestor (LCA)
• 2-regularization
• graph encoding
• sparse LCA constraints