A Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problem.
Xiaodong WangYingjie WuDaxin ZhuPublished in: GPC (2016)
Keyphrases
- computational complexity
- computational cost
- worst case
- significant improvement
- preprocessing
- convergence rate
- segmentation algorithm
- dynamic programming
- optimal solution
- optimization algorithm
- np hard
- k means
- simulated annealing
- linear programming
- cost function
- matching algorithm
- feature selection
- approximation algorithms