A lower bound on the reversal and transposition diameter

被引:6
作者
Meidanis, J
Walter, MMT
Dias, Z
机构
[1] Univ Estadual Campinas, Inst Computacao, BR-13083970 Campinas, SP, Brazil
[2] Univ Brasilia, Dept Ciencia Computacao, BR-70910900 Brasilia, DF, Brazil
关键词
genome rearrangements; breakpoint graph;
D O I
10.1089/106652702761034163
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
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 (re-arrangements) 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 [n/2] +2 for all n greater than or equal to 3. We conjecture that this value is the diameter of the permutation group under these operations.
引用
收藏
页码:743 / 745
页数:3
相关论文
共 6 条
[1]   Sorting by transpositions [J].
Bafna, V ;
Pevzner, PA .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (02) :224-240
[2]  
ERIKSEN N, 2002, IN PRESS THEORET COM
[3]   Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals [J].
Hannenhalli, S ;
Pevzner, PA .
JOURNAL OF THE ACM, 1999, 46 (01) :1-27
[4]  
HANNENHALLI S, 1996, 6 ACM SIAM S DISCR A
[5]  
MEIDANIS J, 1997, P 4 S AM WORKSH STRI, P70
[6]  
MEIDANIS J, 2000, IC0016 IC UN