A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem.
Anadi AgrawalPawel GawrychowskiPublished in: ISAAC (2020)
Keyphrases
- computational complexity
- detection algorithm
- objective function
- matching algorithm
- theoretical analysis
- experimental evaluation
- optimal solution
- optimization algorithm
- improved algorithm
- high accuracy
- worst case
- learning algorithm
- times faster
- memory requirements
- computational cost
- cost function
- preprocessing
- highly efficient
- estimation algorithm
- string matching
- classification algorithm
- pattern matching
- segmentation algorithm
- particle swarm optimization
- probabilistic model
- dynamic programming
- np hard
- data structure
- similarity measure