Beyond Level-1: Identifiability of a Class of Galled Tree-Child Networks

Area of Science:

• Computational Biology
• Phylogenetics
• Genomics

Background:

• Phylogenetic network inference is vital in the genomic era.
• Understanding network identifiability from data is crucial but poorly understood.
• Existing identifiability results are limited, especially for complex network types.

Purpose of the Study:

• To establish strong identifiability results for large subclasses of galled tree-child semidirected networks.
• To demonstrate that conditions for identifiability hold for quartet concordance factor data.
• To expand the scope of phylogenetic network identifiability beyond previously studied network classes.

Main Methods:

• Mathematical proofs establishing identifiability for specific network classes.
• Analysis of conditions required for identifiability, such as the tree of blobs and circular orders.
• Application of quartet concordance factor data under various gene tree models.

Main Results:

• Strong identifiability results are obtained for significant subclasses of galled tree-child semidirected networks.
• Identifiability conditions are shown to hold for quartet concordance factor data with 2+ samples per taxon.
• The studied network classes are more general than level-1 networks, including non-planar networks of any level.

Conclusions:

• This research provides the strongest identifiability results to date for complex phylogenetic networks.
• The findings validate the use of quartet concordance factors for inferring these networks from genomic data.
• A framework is established for proving future identifiability results for tree-child galled networks from diverse data types.