A Fast On-Line Algorithm for the Longest Common Subsequence Problem with Constant Alphabet.
Yoshifumi SakaiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2012)
Keyphrases
- times faster
- preprocessing
- learning algorithm
- objective function
- np hard
- experimental evaluation
- computational cost
- beam search
- detection algorithm
- cost function
- segmentation algorithm
- worst case
- scheduling problem
- matching algorithm
- high accuracy
- dynamic programming
- search space
- optimization problems
- theoretical analysis
- optimization algorithm
- significant improvement
- computational complexity
- convergence rate
- similarity measure