An Efficient Algorithm for Enumerating Longest Common Increasing Subsequences.
Chun LinChao-Yuan HuangMing-Jer TsaiPublished in: COCOON (2021)
Keyphrases
- optimal solution
- preprocessing
- learning algorithm
- improved algorithm
- optimization algorithm
- np hard
- computational complexity
- dynamic programming
- experimental evaluation
- times faster
- high accuracy
- segmentation algorithm
- expectation maximization
- hidden markov models
- convergence rate
- classification algorithm
- theoretical analysis
- computationally efficient
- computational cost
- search space
- particle swarm optimization
- objective function
- detection algorithm
- worst case
- matching algorithm
- convex hull
- selection algorithm
- neural network