A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations.
Xiaowen LouDaming ZhuPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- error bounds
- worst case
- theoretical analysis
- computational cost
- approximation algorithms
- segmentation algorithm
- computationally efficient
- experimental evaluation
- np hard
- computational complexity
- neural network
- dynamic programming
- data sets
- cost function
- preprocessing
- objective function
- detection algorithm
- clustering method
- times faster
- learning algorithm
- convergence rate