On maximal instances for the original syntenic distance

Theoretical Computer Science

Volumn 326, Issue 1-3, 2004, Pages 29-43

  Chauve, Cedric ^a   Fertin, Guillaume ^b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b UNIVERSITÉ DE NANTES   (France)

Author keywords

Computational biology; Gossiping; Syntenic distance

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GENES; PROBLEM SOLVING;

COMPUTATIONAL BIOLOGY; GOSSIPING; SYNTENIC DISTANCE;

COMPUTER SCIENCE;

EID: 5144233214     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.05.006     Document Type: Article

References (13)

1. Bafna V., Pevzner P. Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2):1996;272-289.
2. Bafna V., Pevzner P. Sorting by transpositions. SIAM J. Discrete Math. 11(2):1998;224-240.
3. A. Bergeron, A very elementary presentation of the Hannenhalli-Pevzner theory, in: Combinatorial Pattern Matching (CPM'01), Lecture Notes in Computer Science, Vol. 2089, Springer, Berlin, 2001, pp. 106-117.
4. C. Chauve, G. Fertin, On maximal instances for the original syntenic distance, Technical Report 03.03, IRIN, Nantes, 2003.
5. DasGupta B., Jiang T., Kannan S., Li M., Sweedyk E. On the complexity and approximation of syntenic distance. Discrete Appl. Math. 88(1-3):1998;59-82.
6. V. Ferretti, J.H. Nadeau, D. Sankoff, Original synteny, in: Combinatorial Pattern Matching (CPM'96), Lecture Notes in Computer Science, Vol. 1075, Springer, Berlin, 1996, pp. 159-167.
7. Hannenhalli S., Pevzner P. Transforming cabbage into turnip. polynomial algorithm for sorting signed permutations by reversals J. ACM. 46(1):1999;1-27.
8. Hedetniemi S., Hedetniemi S., Liestman A. A survey of gossiping and broadcasting in communication networks. Networks. 18:1988;319-349.
9. J. Kleinberg, D. Liben-Nowell, The syntenic diameter of the space of N -chromosome genomes, in: Conf. on Gene Order Dynamics, Comparative Maps, and Multigene Families (DCAF), Kluwer Academic Press, Dordrecht, 2000, pp. 185-197.
10. Liben-Nowell D. On the structure of syntenic distance. J. Comput. Biol. 8(1):2001;53-67.
11. Liben-Nowell D. Gossip is synteny. incomplete gossip and syntenic distance between genomes J. Algorithms. 43(2):2002;264-283.
12. D. Liben-Nowell, J. Kleinberg, Structural properties and tractability results for linear synteny, in: Combinatorial Pattern Matching (CPM'00), Lecture Notes in Computer Science, Vol. 1848, Springer, Berlin, 2000, pp. 248-263.
13. Pisanti N., Sagot M.F. Further thoughts on the syntenic distance between genomes. Algorithmica. 34(2):2002;157-180.