The syntenic distance between two genomes is given by the minimum number of fusions, ssions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. The problem of computing this distance is NP-complete. In this paper, we give an
|
242
|
A survey of gossiping and broadcasting in communication networks
– Hedetniemi, Hedetniemi, et al.
- 1988
|
|
115
|
Genome Rearrangements and Sorting by Reversals
– Bafna, Pevzner
- 1996
|
|
85
|
Sorting by transpositions
– Bafna, Pevzner
- 1998
|
|
60
|
Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement", Algorithmica 13
– Kececioglu, Sankoff
- 1995
|
|
45
|
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
– Caprara
- 1999
|
|
37
|
Polynomial Algorithm for Computing Translocation Distance between Genomes
– Hannenhalli
- 1996
|
|
35
|
A 3/2-approximation algorithm for sorting by reversals
– Christie
- 1998
|
|
27
|
Original synteny
– Ferretti, Nadeau, et al.
- 1996
|
|
25
|
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
– Gu, Peng, et al.
- 1999
|
|
24
|
Gossips and telephones
– Baker, Shostak
- 1972
|
|
20
|
A Cure for the Telephone Disease
– Hajnal, Milner, et al.
- 1972
|
|
18
|
A Problem with Telephones
– Bumby
- 1981
|
|
15
|
Conserved synteny as a measure of genomic distance
– Sankoff, Nadeau
- 1996
|
|
14
|
Of mice and men: algorithms for evolutionary distances between genomes with translocation
– Kececioglu, Ravi
- 1995
|
|
11
|
On the structure of syntenic distance
– Liben-Nowell
- 1999
|
|
11
|
Generalizations of Broadcasting and Gossiping
– Richards, Liestman
- 1988
|
|
10
|
Synteny conservation and chromosome rearrangements during mammalian evolution
– Ehrlich, Sanko, et al.
- 1997
|
|
9
|
Transforming mice into men (polynomial algorithm for genomic distance problem
– Hannenhalli, Pevzner
- 1995
|
|
9
|
On a Telephone Problem. Nieuw Archief voor Wiskunde
– Tijdeman
- 1971
|
|
7
|
The syntenic diameter of the space of n-chromosome genomes
– Kleinberg, Liben-Nowell
- 2000
|
|
7
|
Structural Properties and Tractability Results for Linear Synteny
– Liben-Nowell, Kleinberg
- 2000
|
|
6
|
Extensions of the telephone problem
– Cot
- 1976
|
|
6
|
Set to Set Broadcasting in Communication Networks
– Lee, Chang
- 1992
|
|
5
|
On the complexity and approximation of syntenic distance. Discrete Applied Mathematics
– DasGupta, Jiang, et al.
- 1998
|
|
4
|
Spreading Gossip Eciently. Nieuw Archief voor Wiskunde
– Hurkens
- 2000
|
|
2
|
Chang and Yuh-Jiuan Tsay. The partial gossiping problem
– Gerard
- 1996
|
