An Optimal Algorithm to Compute all the Covers of a String.
Dennis W. G. MooreWilliam F. SmythPublished in: Inf. Process. Lett. (1994)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- experimental evaluation
- improved algorithm
- learning algorithm
- theoretical analysis
- globally optimal
- computationally efficient
- expectation maximization
- neural network
- k means
- preprocessing
- significant improvement
- optimization algorithm
- space complexity
- recognition algorithm
- closed form
- data sets
- suffix tree
- pattern matching
- optimal path
- segmentation algorithm
- decision trees
- computational complexity
- np hard
- weighting coefficients
- string matching
- hamming distance
- genetic algorithm
- matching algorithm
- ant colony optimization
- detection algorithm
- similarity measure
- data structure