Sorting by reciprocal translocations via reversals theory
Michal Ozery-Flato1, Ron Shamir
1School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel. ozery@post.tau.ac.il
This study introduces new algorithms for sorting genomes by translocations, a key problem in comparative genomics. These methods efficiently transform one genome into another, improving computational approaches.
Area of Science:
- Genomics
- Computational Biology
- Bioinformatics
Background:
- Comparative genomics relies on understanding genome rearrangements.
- A central challenge is determining the shortest sequence of operations to transform one genome into another.
- Sorting by translocations is a significant problem within this field.
Purpose of the Study:
- To develop novel algorithms for sorting multi-chromosomal genomes by translocations.
- To explore and establish new relationships between sorting by translocations and the established problem of sorting by reversals.
- To enhance computational efficiency in genome rearrangement analysis.
Main Methods:
- Developing two new algorithms for sorting by reciprocal translocations.
- Leveraging newly revealed relationships between translocation and reversal sorting problems.
- Adapting established algorithms for sorting by reversals, specifically Bergeron's algorithm and the Berman-Hannenhalli method, to the translocation context.
Main Results:
- Two new algorithms for sorting by reciprocal translocations were successfully developed.
- The new algorithms demonstrate computational complexities comparable to existing algorithms for sorting by reversals.
- New theoretical relationships were established between genome sorting by translocations and reversals.
Conclusions:
- The developed algorithms provide efficient solutions for sorting genomes by translocations.
- This work advances the field of comparative genomics by offering improved computational tools.
- The findings facilitate a deeper understanding of genome evolution and rearrangement mechanisms.
More Related Videos
11:09RBDT: A Computerized Task System based in Transposition for the Continuous Analysis of Relational Behavior Dynamics in Humans
Published on: July 17, 2021
06:18Frequency and Distribution of Crossovers in Caenorhabditis elegans Meiosis by SNP Genotyping using Real-time PCR
Published on: July 11, 2025
Related Concept Videos
Overview of Transposition and Recombination
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Gene Conversion
Crossing Over
Crossing Over
The homologous pairs of sister chromosomes—one from the maternal and one from the paternal genome—then begin to align alongside each other lengthwise, matching corresponding DNA positions in a process called synapsis.
In order to...
