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
Genome Rearrangements and Sorting by Reversals
SIAM Journal on Computing
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
Algorithms for data migration with cloning
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On generalized gossiping and broadcasting
Journal of Algorithms
On generalized gossiping and broadcasting
Journal of Algorithms
| 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. The problem of computing this distance is NP-complete. In this paper, we give an &Ogr;(2&Ogr;(n log n)) algorithm to exactly compute the syntenic distance between two genomes that contain at most n chromosomes. Our algorithm requires &Ogr;(2&Ogr;(d log d)) time when this distance is d, improving the &Ogr;(2&Ogr;(d2)) running time of the beat previous exact algorithm. Our result is based upon a tight connection between syntenic distance and a novel generalization of the classical gossip problem. We define the incomplete gossip problem, in which there are n gossipers who each have a unique piece of initial information. They communicate by phone calls in which the participants exchange all their information, and 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.