A 1 . 5-approximation algorithm for sorting by transpositions and transreversals

  • Tzvika Hartmana, Roded Sharanb
  • Published 2004
One of the most promising ways to determine evolutionary distance between two organisms is to compare the order of appearance of orthologous genes in their genomes. The resulting genome rearrangement problem calls for finding a shortest sequence of rearrangement operations that sorts one genome into the other. In this paper we provide a 1.5-approximation… CONTINUE READING