A Lower Bound on the Reversal and Transposition Diameter
نویسندگان
چکیده
One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangements) needed to transform one permutation into another. Under this model, the shorter the distance, the closer the genomes are. Two operations that have been extensively studied are the reversal and the transposition. A reversal is an operation that reverses the order of the genes on a certain portion of the permutation. A transposition is an operation that "cuts" a certain portion of the permutation and "pastes" it elsewhere in the same permutation. In this note, we show that the reversal and transposition distance of the signed permutation pi(n) = (-1 -2.-(n - 1)-n) with respect to the identity is left floor n/2 right floor + 2 for all n>or=3. We conjecture that this value is the diameter of the permutation group under these operations.
منابع مشابه
Reversal and Transposition Distance of Linear Chromosomes
In recent years we are seeing increasing interest in research on mutational events acting on large portions of the chromosomes. Among these events, a reversal acts on a fragment of a chromosome reversing the order and orientation of the genes, and a transposition moves fragments from one region to another within a chromosome. In this article we analyze genomes evolving by reversals and transpos...
متن کاملA Lower Bound on the Transposition Diameter
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among all pairs of permutations in Sn. It was previously conjectured [H. Eriksson et al., Discrete Math., 241 (2001), pp. 289–300] that TD(n) ≤ n+1 2 . This conjecture was disproved by Elias and Hartman [IEEE/ACM Trans. Com...
متن کاملA simple framework on sorting permutations
In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These problems are very important in the study of the evolution of genomes. We give a general formulation for lower bounds of the transposition and block-interchange dis...
متن کاملUpper bound and numerical analysis of cyclic expansion extrusion (CEE) process
Deformation of the material during cyclic expansion extrusion (CEE) is investigated using upper-bound theorem. The analytical approximation of forming loads agrees very well with the FEM results for different amounts of chamber diameter, friction factor and also for lower die angles. However, the difference between analytical and numerical solution increases at higher die angles which are expla...
متن کاملOn Reversal and Transposition Medians
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures. A main task in all phylogenetic reconstruction algorithms is to solve the median of three problem. Although this problem is NP-hard even for the simplest distance measures, there are exact algorithms for the breakpoint median and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of computational biology : a journal of computational molecular cell biology
دوره 9 5 شماره
صفحات -
تاریخ انتشار 2002