A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem.
Carlos E. R. AlvesEdson CáceresSiang W. SongPublished in: IPDPS (2003)
Keyphrases
- learning algorithm
- dynamic programming
- np hard
- beam search
- preprocessing
- cost function
- segmentation algorithm
- worst case
- search space
- neural network
- expectation maximization
- probabilistic model
- computational cost
- similarity measure
- k means
- data structure
- objective function
- training data
- feature extraction
- active learning
- simulated annealing
- optimal solution
- detection algorithm
- matching algorithm
- search strategy
- search procedure