A fast and practical bit-vector algorithm for the Longest Common Subsequence problem.
Maxime CrochemoreCostas S. IliopoulosYoan J. PinzónJames F. ReidPublished in: Inf. Process. Lett. (2001)
Keyphrases
- experimental evaluation
- learning algorithm
- times faster
- matching algorithm
- detection algorithm
- bit vector
- convergence rate
- probabilistic model
- significant improvement
- computational complexity
- preprocessing
- np hard
- beam search
- optimal solution
- segmentation algorithm
- simulated annealing
- k means
- dynamic programming
- markov random field
- high accuracy
- language model
- classification accuracy
- search space
- clustering method
- computational cost
- cost function
- neural network