A linear algorithm for 3-letter longest common weakly increasing subsequence.
Lech DurajPublished in: Inf. Process. Lett. (2013)
Keyphrases
- learning algorithm
- experimental evaluation
- k means
- linear complexity
- computational cost
- dynamic programming
- theoretical analysis
- improved algorithm
- objective function
- high accuracy
- search space
- detection algorithm
- computational complexity
- computationally efficient
- clustering method
- piecewise linear
- times faster
- cost function
- expectation maximization
- neural network
- string matching
- classification algorithm
- ant colony optimization
- pattern matching
- optimization algorithm
- linear programming