An optimal algorithm for the longest common subsequence problem.
Hua LinMi LuJesse Zhixi FangPublished in: SPDP (1991)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- learning algorithm
- k means
- np hard
- computational complexity
- detection algorithm
- experimental evaluation
- optimization algorithm
- objective function
- preprocessing
- computational cost
- locally optimal
- beam search
- segmentation algorithm
- cost function
- search space
- expectation maximization
- particle swarm optimization
- linear programming
- probabilistic model
- matching algorithm
- optimal path