Genome halving and double distance with losses

Area of Science:

• Computational Biology
• Genomics
• Bioinformatics

Background:

• Phylogenetic trees with whole genome duplication events present computational challenges.
• Calculating rearrangement and double cut-and-join (DCJ) distances is crucial for understanding genome evolution.
• Existing genome halving algorithms are limited to genomes with complete gene copies.

Purpose of the Study:

• To develop algorithms for computing rearrangement and DCJ distances on phylogenetic tree branches involving duplication nodes.
• To generalize genome halving to genomes with missing gene copies.
• To compute the double distance between a genome and a known ancestral duplicated genome.

Main Methods:

• Generalization of an exact linear-time algorithm for genome halving to handle missing gene copies.
• Development of a greedy approach to compute the double distance.
• Implementation of two algorithms for genomes with exactly two or at most two gene copies.

Main Results:

• Algorithms are time-efficient and highly accurate for both rearrangement and DCJ distances.
• The methods successfully address genome halving for genomes with missing gene copies.
• The double distance computation is efficient for known ancestral duplicated genomes.

Conclusions:

• The developed algorithms provide accurate and efficient solutions for calculating evolutionary distances in the context of whole genome duplication.
• These methods advance the analysis of genomic rearrangements in complex phylogenetic scenarios.
• The work contributes to a better understanding of genome evolution and comparative genomics.