A 1.375-Approximation Algorithm for Sorting by Transpositions.
Isaac EliasTzvika HartmanPublished in: WABI (2005)
Keyphrases
- theoretical analysis
- objective function
- np hard
- computational complexity
- search space
- cost function
- times faster
- optimal solution
- closed form
- worst case
- learning algorithm
- preprocessing
- computational cost
- detection algorithm
- optimization algorithm
- computationally efficient
- improved algorithm
- sorting algorithms
- matching algorithm
- particle swarm optimization
- significant improvement
- expectation maximization
- high accuracy
- experimental evaluation
- error bounds
- approximation algorithms
- recognition algorithm
- k means
- approximation ratio
- data sets