Related Experiment Video
Updated: Feb 8, 2026

Extraction of High Molecular Weight Genomic DNA from Soils and Sediments
Published on: November 10, 2009
An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements
Abstract:
The preserving Genome Sorting Problem (pGSP) asks for a shortest sequence of rearrangement operations that transforms a given gene order into another given gene order by using rearrangement operations that preserve common intervals, i.e., groups of genes that form an interval in both given gene orders. The wpGSP is the weighted version of the problem were each type of rearrangement operation has a weight and a minimum weight sequence of rearrangement operations is sought. An exact algorithm - called CREx2 - is presented, which solves the wpGSP for arbitrary gene orders and the following types of rearrangement operations: inversions, transpositions, inverse transpositions, and tandem duplication random loss operations. CREx2 has a (worst case) exponential runtime, but a linear runtime for problem instances where the common intervals are organized in a linear structure. The efficiency of CREx2 and its usefulness for phylogenetic analysis is shown empirically for gene orders of fungal mitochondrial genomes.
Related Concept Videos
Fisher's Exact Test
[3,3] Sigmatropic Rearrangement of 1,5-Dienes: Cope Rearrangement
[3,3] Sigmatropic Rearrangement of Allyl Vinyl Ethers: Claisen Rearrangement
Genomics
Weighted Mean
For example, consider the number of goals scored in the matches of a tournament. While computing the average number of goals scored in the tournament, it may be more important to...
Preparation of Diols and Pinacol Rearrangement
The reaction begins with transferring a proton from the acid catalyst to one of the hydroxyl groups, producing an oxonium ion.

