A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem.
Chris ArmenClifford SteinPublished in: CPM (1996)
Keyphrases
- optimization algorithm
- computationally efficient
- preprocessing
- shortest common supersequence
- improved algorithm
- experimental evaluation
- detection algorithm
- worst case
- error bounds
- cost function
- approximation ratio
- convergence rate
- computational cost
- times faster
- closed form
- monte carlo
- tree structure
- search space
- computational complexity
- learning algorithm
- optimal solution
- high accuracy
- dynamic programming
- np hard
- particle swarm optimization
- simulated annealing
- matching algorithm
- path planning
- state space
- probabilistic model
- approximation methods
- special case
- significant improvement