A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*.
Luís Felipe I. CunhaLuis Antonio Brasil KowadaRodrigo de A. HausenCelina M. H. de FigueiredoPublished in: J. Comput. Biol. (2015)
Keyphrases
- detection algorithm
- np hard
- times faster
- k means
- learning algorithm
- optimal solution
- computational complexity
- computational cost
- error bounds
- particle swarm optimization
- improved algorithm
- preprocessing
- dynamic programming
- approximation ratio
- significant improvement
- convergence rate
- search space
- monte carlo
- closed form
- computationally demanding
- memory efficient
- recognition algorithm
- convex hull
- neural network
- path planning
- matching algorithm
- ant colony optimization
- segmentation algorithm
- computationally efficient
- simulated annealing
- high accuracy
- cost function
- similarity measure