1.375-Approximation Algorithm for Sorting by Reversals
Piotr BermanSridhar HannenhalliMarek KarpinskiPublished in: Electron. Colloquium Comput. Complex. (2001)
Keyphrases
- learning algorithm
- times faster
- improved algorithm
- convergence rate
- optimization algorithm
- theoretical analysis
- worst case
- experimental evaluation
- significant improvement
- k means
- preprocessing
- clustering method
- computational complexity
- dynamic programming
- expectation maximization
- computationally efficient
- high accuracy
- segmentation algorithm
- computational cost
- optimal solution
- error bounds
- selection algorithm
- approximation methods
- polygonal approximation
- data sets
- polynomial time approximation
- simulated annealing
- knn
- feature selection