A diagonal-based algorithm for the longest common increasing subsequence problem.
Shou-Fu LoKuo-Tsung TsengChang-Biau YangKuo-Si HuangPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- experimental evaluation
- detection algorithm
- learning algorithm
- computationally efficient
- preprocessing
- k means
- times faster
- optimal solution
- computational complexity
- computational cost
- worst case
- particle swarm optimization
- optimization algorithm
- linear programming
- improved algorithm
- classification algorithm
- theoretical analysis
- simulated annealing
- dynamic programming
- expectation maximization
- tree structure
- neural network
- space efficient