Login / Signup

Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement.

John D. KececiogluDavid Sankoff
Published in: Algorithmica (1995)
Keyphrases
  • approximation algorithms
  • np hard
  • special case
  • worst case
  • minimum cost
  • vertex cover
  • network design problem
  • linear programming
  • facility location problem
  • lower bound
  • set cover