An approximation algorithm for sorting by reversals and transpositions.
Atif RahmanSwakkhar ShatabdaMasud HasanPublished in: J. Discrete Algorithms (2008)
Keyphrases
- dynamic programming
- high accuracy
- significant improvement
- learning algorithm
- detection algorithm
- segmentation algorithm
- particle swarm optimization
- times faster
- expectation maximization
- experimental evaluation
- k means
- optimal solution
- computational complexity
- preprocessing
- neural network
- computational cost
- matching algorithm
- tree structure
- randomized approximation
- approximation ratio
- piecewise constant
- improved algorithm
- recognition algorithm
- convergence rate
- error bounds
- reinforcement learning
- path planning
- clustering method
- cost function
- optimization algorithm
- data structure
- computationally efficient
- evolutionary algorithm
- input data
- worst case