On the complexity and approximation of syntenic distance

Authors:
B. DasGupta;T. Jiang;S. Kannan;M. Li;Z. Sweedyk
Affiliations:
Department of Computer Science, Rutgers University, Camden, NJ;Department of Computer Science, McMaster University, Hamilton, Ontario L8S 4K1, Canada;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong;Department of Computer and Information Sciences, University of Pennsylvania, Philadelphia, PA
Venue:
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Year:
1997

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Of mice and men: algorithms for evolutionary distances between genomes with translocation

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Sorting permutations by tanspositions

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes

CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Efficient Bounds for Oriented Chromosome Inversion Distance

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Original Synteny

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching

On the Structure of Syntenic Distance

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching

Hi-index	0.00