A New Flexible Algorithm for the Longest Common Subsequence Problem.
Claus RickPublished in: CPM (1995)
Keyphrases
- experimental evaluation
- detection algorithm
- times faster
- computational cost
- dynamic programming
- cost function
- learning algorithm
- beam search
- expectation maximization
- linear programming
- similarity measure
- k means
- improved algorithm
- information retrieval
- optimization algorithm
- matching algorithm
- theoretical analysis
- decision trees
- input data
- search strategy
- high accuracy
- computational complexity
- preprocessing
- search space
- recognition algorithm
- hill climbing
- training data
- document collections
- particle swarm optimization
- optimal solution
- simulated annealing
- worst case
- supervised learning
- np hard