On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Superstring Problem.
Dirk BongartzPublished in: Comput. Artif. Intell. (2001)
Keyphrases
- approximation ratio
- np hard
- computational complexity
- experimental evaluation
- optimal solution
- detection algorithm
- significant improvement
- high accuracy
- cost function
- improved algorithm
- recognition algorithm
- greedy algorithm
- input data
- computational cost
- approximation algorithms
- knapsack problem
- similarity measure
- times faster
- optimization algorithm
- estimation algorithm
- matching algorithm
- preprocessing
- dynamic programming
- segmentation algorithm
- computationally efficient
- k means
- simulated annealing
- hidden markov models
- probabilistic model
- approximation guarantees
- data sets
- randomized algorithms
- memory requirements
- knn
- special case
- learning algorithm