Genome rearrangements with duplications.

Area of Science:

• Genomics
• Computational Biology
• Evolutionary Biology

Background:

• Comparative genomics often simplifies genomes by assuming single gene copies, which is biologically unrealistic.
• Real genomes contain duplicated gene content, posing challenges for existing genome rearrangement algorithms.
• Handling unequal gene content, especially with arbitrary-sized duplications and deletions, remains a significant computational hurdle.

Purpose of the Study:

• To extend a heuristic algorithm for genome sorting to accommodate multichromosomal genomes.
• To enable the analysis of genome evolution involving tandem duplications and deletions of arbitrary segment sizes.
• To develop a computational tool for reconstructing evolutionary histories with complex genomic changes.

Main Methods:

• Extension of a previously developed heuristic algorithm for genome sorting.
• Adaptation of the algorithm to handle multichromosomal genomes.
• Incorporation of operations including reversals, block interchanges, tandem duplications, and deletions of arbitrary size.

Main Results:

• The algorithm successfully sorts multichromosomal genomes.
• It accommodates a wide range of evolutionary operations, including tandem duplications and deletions.
• The approach addresses the challenge of unequal gene content in comparative genomics.

Conclusions:

• The developed algorithm effectively reconstructs evolutionary pathways for multichromosomal genomes.
• It provides sorting sequences with evolutionary distances close to the true biological values.
• This work advances the field of comparative genomics by providing a more realistic model of genome evolution.