Set to set broadcasting in communication networks
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Discrete Mathematics
Polynomial-time algorithm for computing translocation distance between genomes
Discrete Applied Mathematics - Special volume on computational molecular biology
Conserved synteny as a measure of genomic distance
Discrete Applied Mathematics - Special volume on computational molecular biology
SIAM Journal on Discrete Mathematics
A 2-approximation algorithm for genome rearrangements by reversals and transpositions
Theoretical Computer Science - Special issue: Genome informatics
On the complexity and approximation of syntenic distance
Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Sorting Permutations by Reversals and Eulerian Cycle Decompositions
SIAM Journal on Discrete Mathematics
Of mice and men: algorithms for evolutionary distances between genomes with translocation
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A 3/2-approximation algorithm for sorting by reversals
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Discrete Mathematics
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
(1 + ɛ)-Approximation of sorting by reversals and transpositions
Theoretical Computer Science
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Transforming men into mice (polynomial algorithm for genomic distance problem)
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On maximal instances for the original syntenic distance
Theoretical Computer Science
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
| Hi-index | 0.00 |
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. Computing this distance is NP-hard. In the present work, we give a tight connection between syntenic distance and the incomplete gossip problem, a novel generalization of the classical gossip problem. In this problem, there are n gossipers, each with a unique piece of initial information; they communicate by phone calls in which the two participants exchange all their information. The goal is to minimize the total number of phone calls necessary to inform each gossiper of his set of relevant gossip which he desires to learn. As an application of the connection between syntenic distance and incomplete gossip, we derive an O(2O(nlogn)) algorithm to exactly compute the syntenic distance between two genomes with at most n chromosomes each. Our algorithm requires O(n2 + 2O(dlogd)) time when this distance is d, improving the O(n2 + 2O(d2)) running time of the best previous exact algorithm.(USA).