A sub-quadratic algorithm for the longest common increasing subsequence problem.
Lech DurajPublished in: CoRR (2019)
Keyphrases
- computational complexity
- objective function
- high accuracy
- computational cost
- dynamic programming
- theoretical analysis
- k means
- improved algorithm
- pairwise
- np hard
- learning algorithm
- segmentation algorithm
- detection algorithm
- experimental evaluation
- recognition algorithm
- preprocessing
- times faster
- similarity measure
- linear programming
- cost function
- lower bound
- optimal solution
- expectation maximization
- worst case
- matching algorithm
- suffix array