When are quarnets sufficient to reconstruct semi-directed phylogenetic networks?

2024-08-23

AI Summary

This study addresses whether semi-directed phylogenetic networks can be uniquely reconstructed from their quartet networks (quarnets), a foundational question for accurate inference of complex evolutionary histories. Method: Employing combinatorial graph theory and network topology analysis, we establish rigorous necessary and sufficient conditions for quarnet-based reconstruction. Contribution/Results: We prove that all level-2 semi-directed binary networks are uniquely determined—and thus fully encoded—by their quarnets, establishing quarnet completeness for this class. In contrast, uniqueness fails for level-3 networks, thereby delineating the theoretical boundary of quarnet encoding power. Moreover, we show that the blob tree of any semi-directed network is always reconstructible from its quarnets. These results provide the first formal consistency guarantee for quarnet-based statistical methods (e.g., Squirrel) at level-2, while simultaneously demonstrating fundamental limitations at level-3, thereby characterizing both the capabilities and inherent limits of quarnet-driven phylogenetic inference.

Technology Category

• Knowledge Representation and Reasoning: Qualitative Reasoning
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty
• Constraint Satisfaction and Optimization: Satisfiability

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Web Mining and Content Analysis: Models for Web evolution
• Search and Retrieval-Augmented AI: Web query analysis, representation and understanding

Abstract

Phylogenetic networks are graphs that are used to represent evolutionary relationships between different taxa. They generalize phylogenetic trees since for example, unlike trees, they permit lineages to combine. Recently, there has been rising interest in semi-directed phylogenetic networks, which are mixed graphs in which certain lineage combination events are represented by directed edges coming together, whereas the remaining edges are left undirected. One reason to consider such networks is that it can be difficult to root a network using real data. In this paper, we consider the problem of when a semi-directed phylogenetic network is defined or encoded by the smaller networks that it induces on the 4-leaf subsets of its leaf set. These smaller networks are called quarnets. We prove that semi-directed binary level-2 phylogenetic networks are encoded by their quarnets, but that this is not the case for level-3. In addition, we prove that the so-called blob tree of a semi-directed binary network, a tree that give the coarse-grained structure of the network, is always encoded by the quarnets of the network. These results are relevant for proving the statistical consistency of programs that are currently being developed for reconstructing phylogenetic networks from practical data, such as the recently developed Squirrel software tool.

Problem

• Phylogenetic Networks
• Quartet Analysis
• Semi-directed Graphs

Innovation

• Quartets
• Block Trees
• Evolutionary History Reconstruction