A 1.5-approximation algorithm for sorting by transpositions and transreversals.

Tzvika Hartman Roded Sharan

Published in: J. Comput. Syst. Sci. (2005)

Keyphrases

computational cost
detection algorithm
computational complexity
significant improvement
improved algorithm
experimental evaluation
learning algorithm
optimization algorithm

times faster
theoretical analysis
computationally efficient
cost function
k means
dynamic programming
np hard
worst case

error bounds
polygonal approximation
recognition algorithm
convergence rate
data sets
sorting algorithms
monte carlo
ant colony optimization

segmentation algorithm
particle swarm optimization
linear programming
high accuracy
upper bound
optimal solution
objective function