Gossip is synteny: Incomplete gossip and the syntenic distance between genomes

Journal of Algorithms

Volumn 43, Issue 2, 2002, Pages 264-283

  Liben Nowell, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Comparative genomics; Genome rearrangements; Incomplete gossip; Synthenic distance

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SET THEORY; TIME DOMAIN ANALYSIS;

CLASSICAL GOSSIP PROBLEM; COMPARATIVE GENOMICS; GENOME REARRANGEMENTS; INCOMPLETE GOSSIP PROBLEMS; SYNTHETIC DISTANCE;

LEARNING ALGORITHMS;

EID: 0036591133     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00006-8     Document Type: Article

References (37)

1. V. Bafna, P.A. Pevzner, Genome rearrangements and sorting by reversals, SIAM J. Comput. 25 (2) (1996) 272-289.
2. V. Bafna, P.A. Pevzner, Sorting by transpositions, SIAM J. Discrete Math. 11 (2) (1998) 224-240.
3. A. Caprara, Sorting permutations by reversals and Eulerian cycle decompositions, SIAM J. Discrete Math. 12 (1) (1999) 91-110.
4. D.A. Christie, A 3/2-approximation algorithm for sorting by reversals, in: 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 244-252.
5. N. Eriksen, (1 + ε)-approximation of sorting by reversals and transpositions, Theoret. Comput. Sci., to appear.
6. H. Eriksson, K. Eriksson, J. Karlander, L. Svensson, J. Wästlund, Sorting a bridge hand, Discrete Math. 241 (1-3) (2001) 289-300.
7. Q.-P. Gu, S. Peng, I. Hal Sudborough, A 2-approximation algorithm for genome rearrangements by reversals and transpositions, Theoret. Comput. Sci. 210 (2) (1999) 327-339.
8. J.D. Kececioglu, D. Sankoff, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica 13 (1/2) (1995) 180-210.
9. S. Hannenhalli, Polynomial-time algorithm for computing translocation distance between genomes. Discrete Appl. Math. 71 (1-3) (1996) 137-151.
10. J.D. Kececioglu, R. Ravi, Of mice and men: Algorithms for evolutionary distance between genomes with translocations, in: 6th ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 604-613.
11. S. Hannenhalli, P. Pevzner, Transforming mice into men (polynomial algorithm for genomic distance problem), in: 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 581-592.
12. International Human Genome Sequencing Consortium, Initial sequencing and analysis of the human genomen, Nature 409 (2001) 860-921.
13. W. Bradley Barbazuk, I. Korf, C. Kadavi, J. Heyen, S. Tate, E. Wun, J.A. Bedell, J.D. McPherson, S.L. Johnson, The syntenic relationship of the zebrafish and human genomes, Genome Res. 10 (9) (2000) 1351-1358.
14. Z. Trachtulec, J. Forejt, Synteny of orthologous genes in mammals, snake, fly, nematode, and fission yeast, Mammalian Genome 12 (3) (2001) 227-231.
15. S.R. Voss, J.J. Smith, D.M. Gardiner, D.M. Parichy, Conserved vertebrate chromosome segments in the large salamander genome, Genetics 158 (2) (2001) 735-746.
16. A. McLysaght, C. Seoighe, K.H. Wolfe, High frequency of inversions during eukaryote gene order evolution, in: D. Sankoff, J.H. Nadeau (Eds.), Comparative Genomics, Kluwer Academic, 2000, pp. 47-58.
17. J.M. Ranz, F. Casals, A. Ruiz, How malleable is the eukaryotic genome? Extreme rate of chromosomal rearrangement in the genus Drosophila, Genome Res. 11 (2) (2001) 230-239.
18. C. Seoighe, N. Federspiel, T. Jones, N. Hansen, V. Bivolarovic, R. Surzycki, R. Tamse, C. Komp, L. Huizar, R.W. Davis, S. Scherer, E. Tait, D.J. Shaw, D. Harris, L. Murphy, K. Oliver, K. Taylor, M.-A. Rajandream, B.G. Barrell, K.H. Wolfe, Prevalence of small inversions in yeast gene order evolution. Proc. Natl. Acad. Sci. USA 97 (26) (2000) 14433-14437.
19. M. Blanchette, T. Kunisawa, D. Sankoff, Parametric genome rearrangement, Gene 172 (1) (1996) GC11-GC17.
20. J. Ehrlich, D. Sankoff, J.H. Nadeau, Synteny conservation and chromosome rearrangements during mammalian evolution, Genetics 147 (1) (1997) 289-296.
21. D. Sankoff, J.H. Nadeau, Conserved synteny as a measure of genomic distance, Discrete Appl. Math. 71 (1-3) (1996) 247-257.
22. V. Ferretti, J.H. Nadeau, D. Sankoff, Original synteny, in: 7th Annual Symposium on Combinatorial Pattern Matching, 1996, pp. 159-167.
23. B. DasGupta, T. Jiang, S. Kannan, M. Li, E. Sweedyk, On the complexity and approximation of syntenic distance, Discrete Appl. Math. 88 (1-3) (1998) 59-82.
24. D. Liben-Nowell, On the structure of syntenic distance, J. Comput. Biol. 8 (1) (2001) 53-67.
25. J. Kleinberg, D. Liben-Nowell, The syntenic diameter of the space of n-chromosome genomes, in: D. Sankoff, J.H. Nadeau (Eds.), Comparative Genomics, Kluwer Academic, 2000, pp. 185-197.
26. D. Liben-Nowell, J. Kleinberg, Structural properties and tractability results for linear synteny, in: 11th Annual Symposium on Combinatorial Pattern Matching, 2000, pp. 248-263.
27. N. Pisanti, M.-F. Sagot, Further thoughts on the syntenic distance between genomes, submitted.
28. B. Baker, R. Shostak, Gossips and telephones, Discrete Math. 2 (3) (1972) 191-193.
29. R.T. Bumby, A problem with telephones, SIAM J. Alg. Discrete Meth. 2 (1) (1981) 13-18.
30. A. Hajnal, E.C. Milner, E. Szemerédi, A cure for the telephone disease, Canad. Math. Bull. 15 (3) (1972) 447-450.
31. C.A.J. Hurkens, Spreading gossip efficiently, Nieuw Arch, Wisk. 5/1 (2) (2000) 208-210.
32. R. Tijdeman, On a telephone problem, Nieuw Arch. Wisk. 19 (3) (1971) 188-192.
33. S. Hedetniemi, S. Hedetniemi, A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (4) (1988) 319-349.
34. H.-M. Lee, G.J. Chang, Set to set broadcasting in communication networks, Discrete Appl. Math. 40 (3) (1992) 411-421.
35. D. Richards, A.L. Liestman, Generalizations of broadcasting and gossiping, Networks 18 (1988) 125-138.
36. G.J. Chang, Y.-J. Tsay, The partial gossiping problem, Discrete Math. 148 (1-3) (1996) 9-14.
37. N. Cot, Extensions of the telephone problem, in: 7th SE Conference on Combinatorics, Graph Theory, and Computing, Winnipeg, Utilitas Mathematics, 1976, pp. 239-256.