Deriving a fast systolic algorithm for the longest common subsequence problem.
Yen-Chun LinJih-Wei YehPublished in: Parallel Algorithms Appl. (2002)
Keyphrases
- learning algorithm
- dynamic programming
- optimal solution
- beam search
- improved algorithm
- computational cost
- significant improvement
- cost function
- preprocessing
- recognition algorithm
- high accuracy
- optimization algorithm
- expectation maximization
- convergence rate
- times faster
- detection algorithm
- theoretical analysis
- input data
- simulated annealing
- probabilistic model
- experimental evaluation
- k means
- tree structure
- search space
- evolutionary algorithm
- computational complexity