An O(n log n) Algorithm for Finding All Repetitions in a String.
Michael G. MainRichard J. LorentzPublished in: J. Algorithms (1984)
Keyphrases
- np hard
- high accuracy
- objective function
- optimal solution
- computational complexity
- detection algorithm
- learning algorithm
- preprocessing
- optimization algorithm
- computational cost
- k means
- computationally efficient
- experimental evaluation
- theoretical analysis
- string matching
- alphabet size
- clustering method
- expectation maximization
- dynamic programming
- search space
- recognition algorithm
- selection algorithm
- particle swarm optimization
- times faster
- matching algorithm
- tree structure
- ant colony optimization
- segmentation algorithm
- cost function
- similarity measure
- face recognition