A hardness result and new algorithm for the longest common palindromic subsequence problem.
Shunsuke InenagaHeikki HyyröPublished in: CoRR (2016)
Keyphrases
- computational complexity
- final result
- computational cost
- worst case
- detection algorithm
- theoretical analysis
- linear programming
- high accuracy
- np hard
- hidden markov models
- learning algorithm
- improved algorithm
- times faster
- similarity measure
- optimization algorithm
- objective function
- computationally efficient
- optimal solution
- k means
- cost function
- probabilistic model
- preprocessing
- matching algorithm
- input data
- expectation maximization
- video sequences
- data sets
- tree structure
- dynamic programming
- recognition algorithm