Sorting genomes with rearrangements and segmental duplications through trajectory graphs

Area of Science:

• Computational Biology
• Genomics
• Evolutionary Biology

Background:

• Genome evolution involves complex processes like rearrangements and segmental duplications.
• Determining the most parsimonious evolutionary path between genomes is a significant computational challenge.

Purpose of the Study:

• To develop an efficient algorithm for improving evolutionary trajectories in genome sorting.
• To introduce a new graphical model for analyzing evolutionary paths.

Main Methods:

• Proposing an iterative algorithm to refine evolutionary trajectories.
• Introducing the 'trajectory graph' for modeling genomes and their evolutionary paths.
• Analyzing cycles within the trajectory graph to identify redundant rearrangements.

Main Results:

• Demonstrating that redundant rearrangements correspond to specific cycles in the trajectory graph.
• Proving the convergence of the proposed algorithm to an optimal trajectory.
• The algorithm improves initial trajectories in terms of evolutionary parsimony.

Conclusions:

• The developed iterative algorithm effectively optimizes genome sorting trajectories.
• The trajectory graph provides a novel framework for understanding genomic evolution.
• This method offers a more parsimonious reconstruction of genome evolutionary history.