Weighted genomic distance can hardly impose a bound on the proportion of transpositions

Genomic distance between two genomes, i.e., the smallest number of genome rearrangements required to transform one genome into the other, is often used as a measure of evolutionary closeness of the genomes in comparative genomics studies. However, in models that include rearrangements of significantly different "power" such as reversals (that are "weak" and most frequent rearrangements) and transpositions (that are more "powerful" but rare), the genomic distance typically corresponds to a transformation with a large proportion of transpositions, which is not biologically adequate. Weighted genomic distance is a traditional approach to bounding the proportion of transpositions by assigning them a relative weight {\alpha} > 1. A number of previous studies addressed the problem of computing weighted genomic distance with {\alpha} \leq 2. Employing the model of multi-break rearrangements on circular genomes, that captures both reversals (modelled as 2-breaks) and transpositions (modelled as 3-breaks), we prove that for {\alpha} \in (1,2], a minimum-weight transformation may entirely consist of transpositions, implying that the corresponding weighted genomic distance does not actually achieve its purpose of bounding the proportion of transpositions. We further prove that for {\alpha} \in (1,2), the minimum-weight transformations do not depend on a particular choice of {\alpha} from this interval. We give a complete characterization of such transformations and show that they coincide with the transformations that at the same time have the shortest length and make the smallest number of breakages in the genomes. Our results also provide a theoretical foundation for the empirical observation that for {\alpha} < 2, transpositions are favored over reversals in the minimum-weight transformations.

[1]  Richard Friedberg,et al.  Efficient sorting of genomic permutations by translocation, inversion and block interchange , 2005, Bioinform..

[2]  Enno Ohlebusch,et al.  Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions , 2006, RECOMB.

[3]  Pavel A. Pevzner,et al.  Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.

[4]  David A. Christie,et al.  Sorting Permutations by Block-Interchanges , 1996, Inf. Process. Lett..

[5]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[6]  A. J. Radcliffe,et al.  Reversals and Transpositions Over Finite Alphabets , 2005 .

[7]  Max A. Alekseyev,et al.  Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes , 2008, J. Comput. Biol..

[8]  Pavel A. Pevzner,et al.  Are There Rearrangement Hotspots in the Human Genome? , 2007, PLoS Comput. Biol..

[9]  Niklas Eriksen (1+epsilon)-Approximation of Sorting by Reversals and Transpositions , 2001, WABI.

[10]  Pavel A. Pevzner,et al.  Multi-break rearrangements and chromosomal evolution , 2008, Theor. Comput. Sci..

[11]  Harald Reiterer IDA: user interface design assistance , 1995, SGCH.

[12]  Niklas Eriksen,et al.  (1+epsilon)-Approximation of sorting by reversals and transpositions , 2001, Theor. Comput. Sci..

[13]  Vineet Bafna,et al.  Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..

[14]  D. Sankoff,et al.  Parametric genome rearrangement. , 1996, Gene.

[15]  Tzvika Hartman,et al.  A 1.375-Approximation Algorithm for Sorting by Transpositions , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[16]  Pavel A. Pevzner,et al.  Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.