Constructing Phylogenetic Networks Based on the Isomorphism of Datasets

Area of Science:

• Computational evolutionary biology
• Phylogenetics
• Bioinformatics

Background:

• Constructing rooted phylogenetic networks from rooted phylogenetic trees is a key challenge in molecular evolution.
• Existing efficient methods often rely on the incompatible graph, including CASS, LNETWORK, and BIMLR.

Purpose of the Study:

• To investigate the commonalities among incompatible graph-based methods for phylogenetic network construction.
• To elucidate the relationship between incompatible graphs and phylogenetic networks.
• To analyze the topologies of incompatible graphs.

Main Methods:

• Analyzing existing algorithms based on incompatible graphs.
• Identifying fundamental properties and relationships between incompatible graphs and phylogenetic networks.
• Determining simplest datasets for a given topology G.
• Developing a method to compute a network from a simplest dataset's network.

Main Results:

• Characterization of commonalities in incompatible graph-based methods.
• Established relationships between incompatible graph structures and resulting phylogenetic networks.
• Identification of all simplest datasets for any given topology.
• A novel approach to construct phylogenetic networks by leveraging networks from simplest datasets.

Conclusions:

• The study provides a deeper understanding of incompatible graph-based phylogenetic network construction.
• The proposed method offers a more efficient approach to building phylogenetic networks, reducing computational costs.
• This research contributes to advancing computational methods in molecular evolution and phylogenetics.