Polyploidy Arithmetic

Area of Science:

• Evolutionary Biology
• Computational Biology
• Genomics

Background:

• Polyploidy, the state of having more than two sets of chromosomes, is a significant driver of speciation and genome evolution in plants and animals.
• Understanding the evolutionary history of polyploidy requires inferring the number of hybridization events that led to extant species' ploidy profiles.

Purpose of the Study:

• To rephrase the fundamental question of determining the minimum number of hybridizations required to explain a given ploidy profile.
• To establish connections between polyploid evolution, hybridization number, and mathematical concepts like addition chains and sequences.
• To develop algorithms for identifying polyploid evolutionary histories using network representations.

Main Methods:

• Reformulating the problem of finding the hybridization number as the addition sequence problem.
• Demonstrating the equivalence between tree-child network representable ploidy profiles and addition chains.
• Developing a greedy polynomial-time algorithm for beaded tree-child networks to represent autopolyploidy events.

Main Results:

• The hybridization number problem is equivalent to the computationally intractable addition sequence problem.
• Ploidy profiles representable by tree-child networks correspond exactly to addition chains, enabling polynomial-time identification.
• A greedy polynomial-time algorithm determines if a profile can be realized by a beaded tree-child network, accounting for autopolyploidy.

Conclusions:

• The study provides a novel mathematical framework for understanding polyploid evolution and hybridization.
• Computational intractability of the general hybridization number problem is shown, but efficient algorithms exist for specific network models.
• Results offer a foundation for future work in estimating hybridization numbers and reconstructing polyploid evolutionary networks.