Recovering normal networks from shortest inter-taxa distance information.

Area of Science:

• Evolutionary biology
• Computational phylogenetics
• Graph theory

Background:

• Phylogenetic networks model complex evolutionary histories, including reticulation events.
• Tree-child networks are a specific class of phylogenetic networks.
• Previous work showed edge-weighted tree-child networks are determined by inter-taxa distances, but collections can be exponentially large.

Purpose of the Study:

• To investigate if a smaller set of distances can determine normal phylogenetic networks.
• To develop efficient algorithms for reconstructing phylogenetic networks.

Main Methods:

• Focusing on normal tree-child phylogenetic networks (those without "shortcuts").
• Utilizing the shortest distance between each pair of taxa.
• Developing constructive proofs and cubic-time algorithms.

Main Results:

• Normal tree-child networks are determined by a quadratic number of inter-taxa shortest distances.
• This significantly reduces the data required compared to previous methods.
• Constructive proofs lead to efficient algorithms for network reconstruction.

Conclusions:

• The shortest inter-taxa distances provide a more efficient characterization of normal phylogenetic networks.
• This research offers a computational advantage for inferring evolutionary histories with reticulations.
• The findings contribute to the development of more scalable phylogenetic inference methods.