Marcelo P. Lopes

Learn More
Feng and Zhu defined the permutation tree structure to achieve a running time of O(n log n) for Hartman and Shamir's 1.5-approximation algorithm for sorting genomes by transpositions. The present work describes the first available implementation of this algorithm using permutation trees. Our analysis of Hartman and Shamir's algorithm also leads to a(More)
  • 1