A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem.
Jiaoyun YangYun XuYi ShangGuoliang ChenPublished in: IEEE Trans. Knowl. Data Eng. (2014)
Keyphrases
- computational complexity
- cost function
- higher dimensional
- detection algorithm
- optimization algorithm
- dynamic programming
- preprocessing
- learning algorithm
- beam search
- matching algorithm
- np hard
- significant improvement
- search space
- objective function
- computational cost
- worst case
- simulated annealing
- similarity measure
- optimal solution
- segmentation algorithm
- decision trees
- convergence rate
- exhaustive search
- search engine
- neural network
- previously computed