Related Experiment Video
Updated: Jul 3, 2026

Following the Dynamics of Structural Variants in Experimentally Evolved Populations
Published on: February 3, 2023
Exploring the solution space of sorting by reversals, with experiments and an application to evolution.
Marília D V Braga1, Marie-France Sagot, Celine Scornavacca
1Laboratoire de Biométrie et Biologie Evolutive, UMR 5558, Université de Lyon 1 Claude Bernard, 43, Bd du 11 Novembre 1918, F-69622 Villeurbanne, France. marilia@biomserv.univ-lyon1.fr
This study introduces a novel algorithm for comparative genomics, efficiently structuring evolutionary rearrangement scenarios. It overcomes limitations of existing methods by classifying and counting optimal solutions, aiding in evolutionary analysis.
Area of Science:
- Computational Biology
- Evolutionary Genomics
- Bioinformatics Algorithms
Background:
- Comparative genomics uses algorithms to sort permutations by reversals for evolutionary scenario reconstruction.
- Current methods provide a single solution, overlooking the vast number of optimal solutions and lacking discrimination criteria.
- Previous work by Bergeron et al. aimed to structure the set of optimal solutions but lacked an efficient computational method.
Purpose of the Study:
- To address the open problem of efficiently computing the structure of optimal solutions in permutation by reversals.
- To develop an algorithm that enumerates classes of solutions and counts solutions within each class.
- To provide a more efficient alternative to complete enumeration for analyzing evolutionary rearrangement scenarios.
Main Methods:
- Development of a novel algorithm to compute the structure of optimal solutions for sorting by reversals.
- The algorithm enumerates all solution classes and quantifies the number of solutions per class.
- Application of the algorithm to analyze rearrangement scenarios in mammalian sex chromosomes.
Main Results:
- The proposed algorithm offers improved theoretical and practical complexity compared to complete enumeration.
- It successfully classifies and counts optimal solutions, providing structure to the solution space.
- Demonstrated reduction in the number of classes using additional constraints.
Conclusions:
- The developed algorithm efficiently addresses the challenge of structuring optimal solutions in comparative genomics.
- It enables more comprehensive analysis of evolutionary rearrangement scenarios, particularly for complex genomes like mammalian sex chromosomes.
- This work provides a significant advancement for evolutionary biology and bioinformatics.
Related Concept Videos
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Signal Sequences and Sorting Receptors
Limits to Natural Selection
Reversible and Irreversible Processes
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
Overview of Transposition and Recombination

