An efficient algorithm for the longest common palindromic subsequence problem.
Ting-Wei LiangChang-Biau YangKuo-Si HuangPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- theoretical analysis
- np hard
- times faster
- detection algorithm
- expectation maximization
- experimental evaluation
- learning algorithm
- computational complexity
- k means
- dynamic programming
- highly efficient
- improved algorithm
- selection algorithm
- recognition algorithm
- computational cost
- search space
- optimal solution
- cost function
- preprocessing
- segmentation algorithm
- classification algorithm
- path planning
- objective function
- reinforcement learning
- feature selection
- genetic algorithm
- neural network