Algorithm to Determine Longest Common Subsequences of Two Finite Languages.
Dang Quyet ThangPublished in: ACIIDS Posters (2011)
Keyphrases
- learning algorithm
- optimization algorithm
- experimental evaluation
- k means
- expectation maximization
- high accuracy
- dynamic programming
- cost function
- preprocessing
- objective function
- significant improvement
- multi objective
- computational cost
- detection algorithm
- classification algorithm
- matching algorithm
- times faster
- probabilistic model
- neural network
- search space
- computational complexity
- optimal solution
- input data
- simulated annealing
- theoretical analysis
- clustering method
- similarity measure
- convergence rate
- edit distance
- string matching