V. Bafna and P. Pevzner, Genome Rearrangements and Sorting by Reversals, SIAM Journal on Computing, vol.25, issue.2, pp.272-289, 1996.
DOI : 10.1137/S0097539793250627

V. Bafna and P. Pevzner, Sorting by Transpositions, SIAM Journal on Discrete Mathematics, vol.11, issue.2, pp.224-240, 1996.
DOI : 10.1137/S089548019528280X

A. Bergeron, A Very Elementary Presentation of the Hannenhalli-Pevzner Theory, Combinatorial Pattern Matching (CPM'01), pp.106-117, 2001.
DOI : 10.1007/3-540-48194-X_9

B. Dasgupta, T. Jiang, S. Kannan, M. Li, and E. Sweedyk, On the complexity and approximation of syntenic distance, Discrete Applied Mathematics, vol.88, issue.1-3, pp.59-82, 1998.
DOI : 10.1016/S0166-218X(98)00066-3

V. Ferretti, J. H. Nadeau, and D. Sankoff, Original Synteny, Combinatorial Pattern Matching (CPM'96), pp.159-167, 1996.
DOI : 10.1007/3-540-61258-0_13

S. Hannenhalli and P. Pevzner, Transforming cabbage into turnip, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing , STOC '95, pp.1-27, 1999.
DOI : 10.1145/225058.225112

S. Hedetniemi, S. Hedetniemi, and A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.3, issue.4, pp.319-349, 1988.
DOI : 10.1002/net.3230180406

J. Kleinberg and D. Liben-nowell, The Syntenic Diameter of the Space of N-Chromosome Genomes
DOI : 10.1007/978-94-011-4309-7_17

D. Liben-nowell and J. Kleinberg, Structural Properties and Tractability Results for Linear Synteny, Combinatorial Pattern Matching (CPM'00), pp.248-263, 2000.
DOI : 10.1007/3-540-45123-4_22

D. Liben-nowell, On the Structure of Syntenic Distance, Journal of Computational Biology, vol.8, issue.1, pp.53-67, 2001.
DOI : 10.1089/106652701300099092

D. Liben-nowell, Gossip is synteny: Incomplete gossip and the syntenic distance between genomes, Journal of Algorithms, vol.43, issue.2, pp.264-283, 2002.
DOI : 10.1016/S0196-6774(02)00006-8

N. Pisanti and M. F. Sagot, Further Thoughts on the Syntenic Distance between Genomes, Algorithmica, vol.34, issue.2, pp.157-180, 2002.
DOI : 10.1007/s00453-002-0960-y
URL : https://hal.archives-ouvertes.fr/hal-00427296

. Dir, while ( atoi(argv[j]) != 0 ) S1[l][atoi(argv[j++])-1] = 1; j++; l++; for ( k = 0; k < Num[i]-1; k++ ), pp.1-1

. Dir, = 1; Sum[t] = Num[t]; for( i = t-1; i >= 0; i--) Sum[i] = Sum