An O(n log n) Algorithm for Finding Dissimilar Strings.
Sarmad AbbasiAnirvan SenguptaPublished in: Inf. Process. Lett. (1997)
Keyphrases
- times faster
- experimental evaluation
- detection algorithm
- computational complexity
- preprocessing
- worst case
- improved algorithm
- distance function
- expectation maximization
- selection algorithm
- matching algorithm
- classification algorithm
- segmentation algorithm
- theoretical analysis
- data sets
- high accuracy
- k means
- linear programming
- ant colony optimization
- probabilistic model
- np hard
- hidden markov models
- convergence rate
- optimal solution