An approximation algorithm for the shortest common supersequence problem: an experimental analysis.
Paolo BaronePaola BonizzoniGianluca Della VedovaGiancarlo MauriPublished in: SAC (2001)
Keyphrases
- shortest common supersequence
- learning algorithm
- objective function
- computational complexity
- optimization algorithm
- search space
- convergence rate
- np hard
- optimal solution
- detection algorithm
- times faster
- improved algorithm
- experimental evaluation
- cost function
- significant improvement
- preprocessing
- computational cost
- k means
- error tolerance
- selection algorithm
- closed form
- matching algorithm
- clustering method
- neural network
- segmentation algorithm
- theoretical analysis
- computationally efficient
- linear programming
- graphical models
- simulated annealing
- high accuracy
- probabilistic model
- evolutionary algorithm