A hardness result and new algorithm for the longest common palindromic subsequence problem.
Shunsuke InenagaHeikki HyyröPublished in: Inf. Process. Lett. (2018)
Keyphrases
- computational complexity
- worst case
- preprocessing
- k means
- computationally efficient
- dynamic programming
- experimental evaluation
- improved algorithm
- times faster
- detection algorithm
- np hard
- final result
- randomly generated
- expectation maximization
- high accuracy
- search space
- similarity measure
- learning algorithm
- computational cost
- cost function
- segmentation algorithm
- optimization algorithm
- objective function
- hidden markov models
- multi objective
- information theoretic
- data sets